./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix003_tso.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_f3d3d572-4ed3-4e79-81bb-f5b837c8aae0/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f3d3d572-4ed3-4e79-81bb-f5b837c8aae0/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f3d3d572-4ed3-4e79-81bb-f5b837c8aae0/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f3d3d572-4ed3-4e79-81bb-f5b837c8aae0/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix003_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f3d3d572-4ed3-4e79-81bb-f5b837c8aae0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f3d3d572-4ed3-4e79-81bb-f5b837c8aae0/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 957932eb1d526e6d8778d28a684b5b910d90e05e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 13:00:19,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:00:19,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:00:19,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:00:19,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:00:19,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:00:19,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:00:19,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:00:19,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:00:19,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:00:19,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:00:19,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:00:19,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:00:19,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:00:19,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:00:19,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:00:19,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:00:19,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:00:19,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:00:19,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:00:19,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:00:19,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:00:19,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:00:19,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:00:19,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:00:19,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:00:19,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:00:19,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:00:19,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:00:19,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:00:19,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:00:19,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:00:19,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:00:19,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:00:19,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:00:19,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:00:19,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:00:19,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:00:19,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:00:19,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:00:19,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:00:19,823 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f3d3d572-4ed3-4e79-81bb-f5b837c8aae0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:00:19,833 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:00:19,833 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:00:19,833 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:00:19,833 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:00:19,834 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:00:19,834 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:00:19,834 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:00:19,834 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:00:19,834 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:00:19,834 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:00:19,834 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:00:19,834 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:00:19,834 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:00:19,834 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:00:19,835 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:00:19,835 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:00:19,835 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:00:19,835 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:00:19,835 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:00:19,835 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:00:19,835 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:00:19,836 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:00:19,836 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:00:19,836 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:00:19,836 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:00:19,836 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:00:19,836 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:00:19,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:00:19,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:00:19,837 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:00:19,837 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:00:19,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:00:19,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:00:19,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:00:19,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:00:19,837 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:00:19,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:00:19,837 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:00:19,838 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:00:19,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:00:19,838 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_f3d3d572-4ed3-4e79-81bb-f5b837c8aae0/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 -> 957932eb1d526e6d8778d28a684b5b910d90e05e [2019-12-07 13:00:19,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:00:19,945 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:00:19,947 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:00:19,948 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:00:19,948 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:00:19,948 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f3d3d572-4ed3-4e79-81bb-f5b837c8aae0/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix003_tso.oepc.i [2019-12-07 13:00:19,985 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3d3d572-4ed3-4e79-81bb-f5b837c8aae0/bin/utaipan/data/f6627b265/741d5fed5ce94a989f2aa8d461c9e799/FLAG42e5518b4 [2019-12-07 13:00:20,464 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:00:20,464 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f3d3d572-4ed3-4e79-81bb-f5b837c8aae0/sv-benchmarks/c/pthread-wmm/mix003_tso.oepc.i [2019-12-07 13:00:20,475 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3d3d572-4ed3-4e79-81bb-f5b837c8aae0/bin/utaipan/data/f6627b265/741d5fed5ce94a989f2aa8d461c9e799/FLAG42e5518b4 [2019-12-07 13:00:20,484 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f3d3d572-4ed3-4e79-81bb-f5b837c8aae0/bin/utaipan/data/f6627b265/741d5fed5ce94a989f2aa8d461c9e799 [2019-12-07 13:00:20,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:00:20,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:00:20,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:00:20,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:00:20,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:00:20,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:00:20" (1/1) ... [2019-12-07 13:00:20,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce5fe65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:20, skipping insertion in model container [2019-12-07 13:00:20,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:00:20" (1/1) ... [2019-12-07 13:00:20,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:00:20,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:00:20,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:00:20,781 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:00:20,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:00:20,868 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:00:20,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:20 WrapperNode [2019-12-07 13:00:20,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:00:20,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:00:20,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:00:20,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:00:20,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:20" (1/1) ... [2019-12-07 13:00:20,888 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:20" (1/1) ... [2019-12-07 13:00:20,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:00:20,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:00:20,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:00:20,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:00:20,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:20" (1/1) ... [2019-12-07 13:00:20,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:20" (1/1) ... [2019-12-07 13:00:20,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:20" (1/1) ... [2019-12-07 13:00:20,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:20" (1/1) ... [2019-12-07 13:00:20,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:20" (1/1) ... [2019-12-07 13:00:20,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:20" (1/1) ... [2019-12-07 13:00:20,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:20" (1/1) ... [2019-12-07 13:00:20,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:00:20,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:00:20,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:00:20,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:00:20,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3d3d572-4ed3-4e79-81bb-f5b837c8aae0/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 13:00:20,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:00:20,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:00:20,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:00:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:00:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:00:20,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:00:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:00:20,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:00:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:00:20,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:00:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:00:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:00:20,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:00:20,973 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 13:00:21,345 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:00:21,345 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:00:21,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:00:21 BoogieIcfgContainer [2019-12-07 13:00:21,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:00:21,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:00:21,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:00:21,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:00:21,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:00:20" (1/3) ... [2019-12-07 13:00:21,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ff0c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:00:21, skipping insertion in model container [2019-12-07 13:00:21,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:20" (2/3) ... [2019-12-07 13:00:21,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ff0c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:00:21, skipping insertion in model container [2019-12-07 13:00:21,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:00:21" (3/3) ... [2019-12-07 13:00:21,353 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_tso.oepc.i [2019-12-07 13:00:21,362 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:00:21,362 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:00:21,368 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:00:21,369 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:00:21,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,396 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,396 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,396 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,397 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,397 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,403 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,403 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,409 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,409 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:00:21,434 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 13:00:21,446 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:00:21,446 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:00:21,447 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:00:21,447 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:00:21,447 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:00:21,447 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:00:21,447 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:00:21,447 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:00:21,458 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-07 13:00:21,459 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-07 13:00:21,514 INFO L134 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-07 13:00:21,515 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:00:21,525 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 13:00:21,541 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-07 13:00:21,573 INFO L134 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-07 13:00:21,573 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:00:21,579 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 13:00:21,594 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 13:00:21,595 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:00:24,551 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 13:00:24,878 INFO L206 etLargeBlockEncoding]: Checked pairs total: 132619 [2019-12-07 13:00:24,878 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 13:00:24,880 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-07 13:00:41,187 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-07 13:00:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-07 13:00:41,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:00:41,192 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:41,193 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:00:41,193 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:00:41,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:41,197 INFO L82 PathProgramCache]: Analyzing trace with hash 919842, now seen corresponding path program 1 times [2019-12-07 13:00:41,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:00:41,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279566268] [2019-12-07 13:00:41,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:00:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:41,330 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 13:00:41,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279566268] [2019-12-07 13:00:41,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:41,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:00:41,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084302158] [2019-12-07 13:00:41,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:00:41,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:00:41,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:00:41,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:00:41,346 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-07 13:00:42,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:42,236 INFO L93 Difference]: Finished difference Result 119613 states and 515253 transitions. [2019-12-07 13:00:42,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:00:42,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 13:00:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:42,694 INFO L225 Difference]: With dead ends: 119613 [2019-12-07 13:00:42,694 INFO L226 Difference]: Without dead ends: 105755 [2019-12-07 13:00:42,695 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 13:00:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105755 states. [2019-12-07 13:00:49,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105755 to 105755. [2019-12-07 13:00:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105755 states. [2019-12-07 13:00:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105755 states to 105755 states and 454361 transitions. [2019-12-07 13:00:49,544 INFO L78 Accepts]: Start accepts. Automaton has 105755 states and 454361 transitions. Word has length 3 [2019-12-07 13:00:49,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:49,545 INFO L462 AbstractCegarLoop]: Abstraction has 105755 states and 454361 transitions. [2019-12-07 13:00:49,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:00:49,545 INFO L276 IsEmpty]: Start isEmpty. Operand 105755 states and 454361 transitions. [2019-12-07 13:00:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:00:49,548 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:49,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:00:49,548 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:00:49,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:49,548 INFO L82 PathProgramCache]: Analyzing trace with hash 474732739, now seen corresponding path program 1 times [2019-12-07 13:00:49,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:00:49,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143336508] [2019-12-07 13:00:49,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:00:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:00:49,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143336508] [2019-12-07 13:00:49,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:49,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:00:49,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155148671] [2019-12-07 13:00:49,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:00:49,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:00:49,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:00:49,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:00:49,812 INFO L87 Difference]: Start difference. First operand 105755 states and 454361 transitions. Second operand 4 states. [2019-12-07 13:00:50,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:50,718 INFO L93 Difference]: Finished difference Result 168845 states and 694815 transitions. [2019-12-07 13:00:50,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:00:50,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 13:00:50,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:51,126 INFO L225 Difference]: With dead ends: 168845 [2019-12-07 13:00:51,126 INFO L226 Difference]: Without dead ends: 168747 [2019-12-07 13:00:51,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:00:55,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168747 states. [2019-12-07 13:00:59,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168747 to 153153. [2019-12-07 13:00:59,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153153 states. [2019-12-07 13:00:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153153 states to 153153 states and 639357 transitions. [2019-12-07 13:00:59,867 INFO L78 Accepts]: Start accepts. Automaton has 153153 states and 639357 transitions. Word has length 11 [2019-12-07 13:00:59,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:59,867 INFO L462 AbstractCegarLoop]: Abstraction has 153153 states and 639357 transitions. [2019-12-07 13:00:59,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:00:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand 153153 states and 639357 transitions. [2019-12-07 13:00:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:00:59,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:59,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:00:59,871 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:00:59,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:59,871 INFO L82 PathProgramCache]: Analyzing trace with hash -512415605, now seen corresponding path program 1 times [2019-12-07 13:00:59,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:00:59,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466784070] [2019-12-07 13:00:59,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:00:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:00:59,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466784070] [2019-12-07 13:00:59,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:59,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:00:59,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724155288] [2019-12-07 13:00:59,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:00:59,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:00:59,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:00:59,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:00:59,921 INFO L87 Difference]: Start difference. First operand 153153 states and 639357 transitions. Second operand 4 states. [2019-12-07 13:01:01,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:01,304 INFO L93 Difference]: Finished difference Result 220024 states and 896381 transitions. [2019-12-07 13:01:01,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:01:01,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:01:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:01,895 INFO L225 Difference]: With dead ends: 220024 [2019-12-07 13:01:01,895 INFO L226 Difference]: Without dead ends: 219912 [2019-12-07 13:01:01,896 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 13:01:07,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219912 states. [2019-12-07 13:01:11,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219912 to 183120. [2019-12-07 13:01:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183120 states. [2019-12-07 13:01:12,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183120 states to 183120 states and 760223 transitions. [2019-12-07 13:01:12,300 INFO L78 Accepts]: Start accepts. Automaton has 183120 states and 760223 transitions. Word has length 13 [2019-12-07 13:01:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:12,301 INFO L462 AbstractCegarLoop]: Abstraction has 183120 states and 760223 transitions. [2019-12-07 13:01:12,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:01:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 183120 states and 760223 transitions. [2019-12-07 13:01:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:01:12,308 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:12,308 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:12,308 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:12,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:12,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1719969010, now seen corresponding path program 1 times [2019-12-07 13:01:12,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:01:12,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057546570] [2019-12-07 13:01:12,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:12,349 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 13:01:12,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057546570] [2019-12-07 13:01:12,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:12,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:01:12,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567699360] [2019-12-07 13:01:12,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:01:12,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:01:12,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:01:12,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:01:12,350 INFO L87 Difference]: Start difference. First operand 183120 states and 760223 transitions. Second operand 4 states. [2019-12-07 13:01:13,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:13,872 INFO L93 Difference]: Finished difference Result 225249 states and 927434 transitions. [2019-12-07 13:01:13,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:01:13,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 13:01:13,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:14,447 INFO L225 Difference]: With dead ends: 225249 [2019-12-07 13:01:14,447 INFO L226 Difference]: Without dead ends: 225249 [2019-12-07 13:01:14,448 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 13:01:19,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225249 states. [2019-12-07 13:01:22,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225249 to 195075. [2019-12-07 13:01:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195075 states. [2019-12-07 13:01:23,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195075 states to 195075 states and 809283 transitions. [2019-12-07 13:01:23,317 INFO L78 Accepts]: Start accepts. Automaton has 195075 states and 809283 transitions. Word has length 16 [2019-12-07 13:01:23,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:23,317 INFO L462 AbstractCegarLoop]: Abstraction has 195075 states and 809283 transitions. [2019-12-07 13:01:23,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:01:23,317 INFO L276 IsEmpty]: Start isEmpty. Operand 195075 states and 809283 transitions. [2019-12-07 13:01:23,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:01:23,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:23,324 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:23,324 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:23,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:23,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1720071868, now seen corresponding path program 1 times [2019-12-07 13:01:23,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:01:23,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348309213] [2019-12-07 13:01:23,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:23,347 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 13:01:23,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348309213] [2019-12-07 13:01:23,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:23,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:01:23,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184470805] [2019-12-07 13:01:23,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:01:23,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:01:23,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:01:23,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:01:23,349 INFO L87 Difference]: Start difference. First operand 195075 states and 809283 transitions. Second operand 3 states. [2019-12-07 13:01:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:24,526 INFO L93 Difference]: Finished difference Result 282572 states and 1168256 transitions. [2019-12-07 13:01:24,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:01:24,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 13:01:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:25,252 INFO L225 Difference]: With dead ends: 282572 [2019-12-07 13:01:25,252 INFO L226 Difference]: Without dead ends: 282572 [2019-12-07 13:01:25,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:01:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282572 states. [2019-12-07 13:01:36,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282572 to 224589. [2019-12-07 13:01:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224589 states. [2019-12-07 13:01:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224589 states to 224589 states and 936012 transitions. [2019-12-07 13:01:37,350 INFO L78 Accepts]: Start accepts. Automaton has 224589 states and 936012 transitions. Word has length 16 [2019-12-07 13:01:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:37,350 INFO L462 AbstractCegarLoop]: Abstraction has 224589 states and 936012 transitions. [2019-12-07 13:01:37,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:01:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 224589 states and 936012 transitions. [2019-12-07 13:01:37,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:01:37,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:37,356 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:37,356 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:37,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:37,356 INFO L82 PathProgramCache]: Analyzing trace with hash 759335912, now seen corresponding path program 1 times [2019-12-07 13:01:37,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:01:37,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258503920] [2019-12-07 13:01:37,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:37,387 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 13:01:37,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258503920] [2019-12-07 13:01:37,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:37,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:01:37,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185979501] [2019-12-07 13:01:37,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:01:37,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:01:37,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:01:37,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:01:37,389 INFO L87 Difference]: Start difference. First operand 224589 states and 936012 transitions. Second operand 4 states. [2019-12-07 13:01:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:39,021 INFO L93 Difference]: Finished difference Result 265350 states and 1097413 transitions. [2019-12-07 13:01:39,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:01:39,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 13:01:39,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:39,695 INFO L225 Difference]: With dead ends: 265350 [2019-12-07 13:01:39,695 INFO L226 Difference]: Without dead ends: 265350 [2019-12-07 13:01:39,695 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 13:01:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265350 states. [2019-12-07 13:01:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265350 to 227267. [2019-12-07 13:01:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227267 states. [2019-12-07 13:01:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227267 states to 227267 states and 947978 transitions. [2019-12-07 13:01:49,652 INFO L78 Accepts]: Start accepts. Automaton has 227267 states and 947978 transitions. Word has length 16 [2019-12-07 13:01:49,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:49,652 INFO L462 AbstractCegarLoop]: Abstraction has 227267 states and 947978 transitions. [2019-12-07 13:01:49,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:01:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 227267 states and 947978 transitions. [2019-12-07 13:01:49,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:01:49,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:49,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:49,663 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:49,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:49,664 INFO L82 PathProgramCache]: Analyzing trace with hash 980787520, now seen corresponding path program 1 times [2019-12-07 13:01:49,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:01:49,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735171190] [2019-12-07 13:01:49,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:49,722 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 13:01:49,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735171190] [2019-12-07 13:01:49,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:49,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:01:49,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529865793] [2019-12-07 13:01:49,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:01:49,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:01:49,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:01:49,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:01:49,724 INFO L87 Difference]: Start difference. First operand 227267 states and 947978 transitions. Second operand 3 states. [2019-12-07 13:01:50,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:50,708 INFO L93 Difference]: Finished difference Result 227267 states and 938556 transitions. [2019-12-07 13:01:50,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:01:50,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 13:01:50,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:51,807 INFO L225 Difference]: With dead ends: 227267 [2019-12-07 13:01:51,807 INFO L226 Difference]: Without dead ends: 227267 [2019-12-07 13:01:51,807 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 13:01:59,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227267 states. [2019-12-07 13:02:02,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227267 to 223833. [2019-12-07 13:02:02,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223833 states. [2019-12-07 13:02:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223833 states to 223833 states and 925814 transitions. [2019-12-07 13:02:03,275 INFO L78 Accepts]: Start accepts. Automaton has 223833 states and 925814 transitions. Word has length 18 [2019-12-07 13:02:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:03,275 INFO L462 AbstractCegarLoop]: Abstraction has 223833 states and 925814 transitions. [2019-12-07 13:02:03,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 223833 states and 925814 transitions. [2019-12-07 13:02:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:02:03,285 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:03,285 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:03,285 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:03,285 INFO L82 PathProgramCache]: Analyzing trace with hash -907604290, now seen corresponding path program 1 times [2019-12-07 13:02:03,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:03,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876016855] [2019-12-07 13:02:03,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:03,332 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 13:02:03,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876016855] [2019-12-07 13:02:03,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:03,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:02:03,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774259063] [2019-12-07 13:02:03,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:03,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:03,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:03,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:03,334 INFO L87 Difference]: Start difference. First operand 223833 states and 925814 transitions. Second operand 3 states. [2019-12-07 13:02:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:04,315 INFO L93 Difference]: Finished difference Result 227222 states and 936124 transitions. [2019-12-07 13:02:04,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:04,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 13:02:04,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:05,359 INFO L225 Difference]: With dead ends: 227222 [2019-12-07 13:02:05,359 INFO L226 Difference]: Without dead ends: 227222 [2019-12-07 13:02:05,360 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 13:02:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227222 states. [2019-12-07 13:02:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227222 to 223830. [2019-12-07 13:02:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223830 states. [2019-12-07 13:02:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223830 states to 223830 states and 925802 transitions. [2019-12-07 13:02:14,129 INFO L78 Accepts]: Start accepts. Automaton has 223830 states and 925802 transitions. Word has length 18 [2019-12-07 13:02:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:14,129 INFO L462 AbstractCegarLoop]: Abstraction has 223830 states and 925802 transitions. [2019-12-07 13:02:14,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 223830 states and 925802 transitions. [2019-12-07 13:02:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:02:14,141 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:14,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:14,141 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:14,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:14,141 INFO L82 PathProgramCache]: Analyzing trace with hash 793088017, now seen corresponding path program 1 times [2019-12-07 13:02:14,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:14,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175324226] [2019-12-07 13:02:14,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:14,173 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 13:02:14,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175324226] [2019-12-07 13:02:14,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:14,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:02:14,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361419268] [2019-12-07 13:02:14,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:02:14,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:14,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:02:14,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:02:14,175 INFO L87 Difference]: Start difference. First operand 223830 states and 925802 transitions. Second operand 5 states. [2019-12-07 13:02:18,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:18,703 INFO L93 Difference]: Finished difference Result 327040 states and 1320543 transitions. [2019-12-07 13:02:18,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:02:18,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 13:02:18,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:19,483 INFO L225 Difference]: With dead ends: 327040 [2019-12-07 13:02:19,483 INFO L226 Difference]: Without dead ends: 326858 [2019-12-07 13:02:19,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:02:25,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326858 states. [2019-12-07 13:02:29,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326858 to 238804. [2019-12-07 13:02:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238804 states. [2019-12-07 13:02:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238804 states to 238804 states and 984590 transitions. [2019-12-07 13:02:30,060 INFO L78 Accepts]: Start accepts. Automaton has 238804 states and 984590 transitions. Word has length 19 [2019-12-07 13:02:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:30,060 INFO L462 AbstractCegarLoop]: Abstraction has 238804 states and 984590 transitions. [2019-12-07 13:02:30,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:02:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 238804 states and 984590 transitions. [2019-12-07 13:02:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:02:30,073 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:30,073 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:30,073 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:30,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:30,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1187768320, now seen corresponding path program 1 times [2019-12-07 13:02:30,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:30,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531203685] [2019-12-07 13:02:30,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:30,094 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 13:02:30,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531203685] [2019-12-07 13:02:30,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:30,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:30,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624531717] [2019-12-07 13:02:30,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:30,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:30,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:30,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:30,095 INFO L87 Difference]: Start difference. First operand 238804 states and 984590 transitions. Second operand 3 states. [2019-12-07 13:02:30,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:30,228 INFO L93 Difference]: Finished difference Result 47432 states and 154279 transitions. [2019-12-07 13:02:30,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:30,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 13:02:30,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:30,293 INFO L225 Difference]: With dead ends: 47432 [2019-12-07 13:02:30,293 INFO L226 Difference]: Without dead ends: 47432 [2019-12-07 13:02:30,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47432 states. [2019-12-07 13:02:30,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47432 to 47432. [2019-12-07 13:02:30,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47432 states. [2019-12-07 13:02:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47432 states to 47432 states and 154279 transitions. [2019-12-07 13:02:31,008 INFO L78 Accepts]: Start accepts. Automaton has 47432 states and 154279 transitions. Word has length 19 [2019-12-07 13:02:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:31,009 INFO L462 AbstractCegarLoop]: Abstraction has 47432 states and 154279 transitions. [2019-12-07 13:02:31,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:31,009 INFO L276 IsEmpty]: Start isEmpty. Operand 47432 states and 154279 transitions. [2019-12-07 13:02:31,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:02:31,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:31,014 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:31,014 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:31,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:31,015 INFO L82 PathProgramCache]: Analyzing trace with hash -390431288, now seen corresponding path program 1 times [2019-12-07 13:02:31,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:31,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862498709] [2019-12-07 13:02:31,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:31,054 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 13:02:31,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862498709] [2019-12-07 13:02:31,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:31,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:02:31,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027096161] [2019-12-07 13:02:31,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:02:31,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:31,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:02:31,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:02:31,055 INFO L87 Difference]: Start difference. First operand 47432 states and 154279 transitions. Second operand 5 states. [2019-12-07 13:02:31,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:31,481 INFO L93 Difference]: Finished difference Result 63875 states and 202791 transitions. [2019-12-07 13:02:31,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:02:31,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 13:02:31,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:31,574 INFO L225 Difference]: With dead ends: 63875 [2019-12-07 13:02:31,574 INFO L226 Difference]: Without dead ends: 63861 [2019-12-07 13:02:31,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:02:31,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63861 states. [2019-12-07 13:02:32,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63861 to 50292. [2019-12-07 13:02:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50292 states. [2019-12-07 13:02:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50292 states to 50292 states and 162986 transitions. [2019-12-07 13:02:32,775 INFO L78 Accepts]: Start accepts. Automaton has 50292 states and 162986 transitions. Word has length 22 [2019-12-07 13:02:32,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:32,775 INFO L462 AbstractCegarLoop]: Abstraction has 50292 states and 162986 transitions. [2019-12-07 13:02:32,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:02:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 50292 states and 162986 transitions. [2019-12-07 13:02:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:02:32,781 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:32,781 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:32,781 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:32,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:32,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2088873634, now seen corresponding path program 1 times [2019-12-07 13:02:32,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:32,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908076498] [2019-12-07 13:02:32,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:02:32,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908076498] [2019-12-07 13:02:32,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:32,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:02:32,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291982378] [2019-12-07 13:02:32,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:02:32,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:32,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:02:32,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:02:32,822 INFO L87 Difference]: Start difference. First operand 50292 states and 162986 transitions. Second operand 5 states. [2019-12-07 13:02:33,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:33,274 INFO L93 Difference]: Finished difference Result 65915 states and 209832 transitions. [2019-12-07 13:02:33,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:02:33,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 13:02:33,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:33,363 INFO L225 Difference]: With dead ends: 65915 [2019-12-07 13:02:33,363 INFO L226 Difference]: Without dead ends: 65901 [2019-12-07 13:02:33,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:02:33,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65901 states. [2019-12-07 13:02:34,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65901 to 48914. [2019-12-07 13:02:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48914 states. [2019-12-07 13:02:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48914 states to 48914 states and 158771 transitions. [2019-12-07 13:02:34,214 INFO L78 Accepts]: Start accepts. Automaton has 48914 states and 158771 transitions. Word has length 22 [2019-12-07 13:02:34,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:34,214 INFO L462 AbstractCegarLoop]: Abstraction has 48914 states and 158771 transitions. [2019-12-07 13:02:34,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:02:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand 48914 states and 158771 transitions. [2019-12-07 13:02:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:02:34,227 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:34,227 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:34,227 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:34,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:34,228 INFO L82 PathProgramCache]: Analyzing trace with hash 967503752, now seen corresponding path program 1 times [2019-12-07 13:02:34,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:34,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599812341] [2019-12-07 13:02:34,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:34,247 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 13:02:34,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599812341] [2019-12-07 13:02:34,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:34,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:02:34,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477184311] [2019-12-07 13:02:34,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:34,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:34,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:34,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:34,248 INFO L87 Difference]: Start difference. First operand 48914 states and 158771 transitions. Second operand 3 states. [2019-12-07 13:02:34,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:34,424 INFO L93 Difference]: Finished difference Result 62759 states and 194816 transitions. [2019-12-07 13:02:34,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:34,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 13:02:34,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:34,511 INFO L225 Difference]: With dead ends: 62759 [2019-12-07 13:02:34,511 INFO L226 Difference]: Without dead ends: 62759 [2019-12-07 13:02:34,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62759 states. [2019-12-07 13:02:35,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62759 to 48438. [2019-12-07 13:02:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48438 states. [2019-12-07 13:02:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48438 states to 48438 states and 150393 transitions. [2019-12-07 13:02:35,394 INFO L78 Accepts]: Start accepts. Automaton has 48438 states and 150393 transitions. Word has length 27 [2019-12-07 13:02:35,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:35,394 INFO L462 AbstractCegarLoop]: Abstraction has 48438 states and 150393 transitions. [2019-12-07 13:02:35,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:35,394 INFO L276 IsEmpty]: Start isEmpty. Operand 48438 states and 150393 transitions. [2019-12-07 13:02:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:02:35,406 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:35,406 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:35,407 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:35,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:35,407 INFO L82 PathProgramCache]: Analyzing trace with hash 196927527, now seen corresponding path program 1 times [2019-12-07 13:02:35,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:35,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008341182] [2019-12-07 13:02:35,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:35,441 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 13:02:35,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008341182] [2019-12-07 13:02:35,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:35,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:02:35,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483682969] [2019-12-07 13:02:35,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:02:35,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:35,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:02:35,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:02:35,443 INFO L87 Difference]: Start difference. First operand 48438 states and 150393 transitions. Second operand 5 states. [2019-12-07 13:02:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:35,768 INFO L93 Difference]: Finished difference Result 59466 states and 182837 transitions. [2019-12-07 13:02:35,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:02:35,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 13:02:35,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:35,851 INFO L225 Difference]: With dead ends: 59466 [2019-12-07 13:02:35,851 INFO L226 Difference]: Without dead ends: 59424 [2019-12-07 13:02:35,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:02:36,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59424 states. [2019-12-07 13:02:36,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59424 to 50589. [2019-12-07 13:02:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50589 states. [2019-12-07 13:02:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50589 states to 50589 states and 156953 transitions. [2019-12-07 13:02:36,683 INFO L78 Accepts]: Start accepts. Automaton has 50589 states and 156953 transitions. Word has length 27 [2019-12-07 13:02:36,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:36,683 INFO L462 AbstractCegarLoop]: Abstraction has 50589 states and 156953 transitions. [2019-12-07 13:02:36,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:02:36,683 INFO L276 IsEmpty]: Start isEmpty. Operand 50589 states and 156953 transitions. [2019-12-07 13:02:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 13:02:36,697 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:36,697 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 13:02:36,697 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:36,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:36,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1188103809, now seen corresponding path program 1 times [2019-12-07 13:02:36,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:36,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924588789] [2019-12-07 13:02:36,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:36,730 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 13:02:36,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924588789] [2019-12-07 13:02:36,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:36,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:02:36,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065148693] [2019-12-07 13:02:36,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:02:36,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:36,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:02:36,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:02:36,731 INFO L87 Difference]: Start difference. First operand 50589 states and 156953 transitions. Second operand 5 states. [2019-12-07 13:02:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:37,116 INFO L93 Difference]: Finished difference Result 61327 states and 188389 transitions. [2019-12-07 13:02:37,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:02:37,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 13:02:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:37,192 INFO L225 Difference]: With dead ends: 61327 [2019-12-07 13:02:37,193 INFO L226 Difference]: Without dead ends: 61283 [2019-12-07 13:02:37,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:02:37,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61283 states. [2019-12-07 13:02:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61283 to 50396. [2019-12-07 13:02:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50396 states. [2019-12-07 13:02:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50396 states to 50396 states and 156269 transitions. [2019-12-07 13:02:38,010 INFO L78 Accepts]: Start accepts. Automaton has 50396 states and 156269 transitions. Word has length 28 [2019-12-07 13:02:38,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:38,010 INFO L462 AbstractCegarLoop]: Abstraction has 50396 states and 156269 transitions. [2019-12-07 13:02:38,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:02:38,010 INFO L276 IsEmpty]: Start isEmpty. Operand 50396 states and 156269 transitions. [2019-12-07 13:02:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 13:02:38,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:38,022 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:38,022 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:38,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:38,022 INFO L82 PathProgramCache]: Analyzing trace with hash -175678458, now seen corresponding path program 1 times [2019-12-07 13:02:38,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:38,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17336959] [2019-12-07 13:02:38,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:38,054 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 13:02:38,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17336959] [2019-12-07 13:02:38,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:38,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:02:38,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965616559] [2019-12-07 13:02:38,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:02:38,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:38,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:02:38,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:02:38,056 INFO L87 Difference]: Start difference. First operand 50396 states and 156269 transitions. Second operand 4 states. [2019-12-07 13:02:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:38,115 INFO L93 Difference]: Finished difference Result 19540 states and 57989 transitions. [2019-12-07 13:02:38,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:02:38,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 13:02:38,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:38,135 INFO L225 Difference]: With dead ends: 19540 [2019-12-07 13:02:38,135 INFO L226 Difference]: Without dead ends: 19540 [2019-12-07 13:02:38,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:02:38,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19540 states. [2019-12-07 13:02:38,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19540 to 18350. [2019-12-07 13:02:38,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18350 states. [2019-12-07 13:02:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18350 states to 18350 states and 54533 transitions. [2019-12-07 13:02:38,380 INFO L78 Accepts]: Start accepts. Automaton has 18350 states and 54533 transitions. Word has length 29 [2019-12-07 13:02:38,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:38,380 INFO L462 AbstractCegarLoop]: Abstraction has 18350 states and 54533 transitions. [2019-12-07 13:02:38,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:02:38,380 INFO L276 IsEmpty]: Start isEmpty. Operand 18350 states and 54533 transitions. [2019-12-07 13:02:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:02:38,392 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:38,393 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 13:02:38,393 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:38,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:38,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1042720045, now seen corresponding path program 1 times [2019-12-07 13:02:38,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:38,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820081914] [2019-12-07 13:02:38,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:38,432 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 13:02:38,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820081914] [2019-12-07 13:02:38,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:38,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:02:38,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911243557] [2019-12-07 13:02:38,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:02:38,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:38,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:02:38,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:02:38,433 INFO L87 Difference]: Start difference. First operand 18350 states and 54533 transitions. Second operand 6 states. [2019-12-07 13:02:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:38,833 INFO L93 Difference]: Finished difference Result 23136 states and 67942 transitions. [2019-12-07 13:02:38,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:02:38,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 13:02:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:38,856 INFO L225 Difference]: With dead ends: 23136 [2019-12-07 13:02:38,856 INFO L226 Difference]: Without dead ends: 23136 [2019-12-07 13:02:38,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:02:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23136 states. [2019-12-07 13:02:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23136 to 18518. [2019-12-07 13:02:39,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18518 states. [2019-12-07 13:02:39,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18518 states to 18518 states and 55063 transitions. [2019-12-07 13:02:39,135 INFO L78 Accepts]: Start accepts. Automaton has 18518 states and 55063 transitions. Word has length 33 [2019-12-07 13:02:39,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:39,135 INFO L462 AbstractCegarLoop]: Abstraction has 18518 states and 55063 transitions. [2019-12-07 13:02:39,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:02:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 18518 states and 55063 transitions. [2019-12-07 13:02:39,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 13:02:39,148 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:39,148 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:39,148 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:39,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:39,148 INFO L82 PathProgramCache]: Analyzing trace with hash -738339527, now seen corresponding path program 1 times [2019-12-07 13:02:39,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:39,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404228960] [2019-12-07 13:02:39,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:39,204 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 13:02:39,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404228960] [2019-12-07 13:02:39,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:39,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:02:39,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841133618] [2019-12-07 13:02:39,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:02:39,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:39,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:02:39,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:02:39,206 INFO L87 Difference]: Start difference. First operand 18518 states and 55063 transitions. Second operand 6 states. [2019-12-07 13:02:39,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:39,660 INFO L93 Difference]: Finished difference Result 22607 states and 66417 transitions. [2019-12-07 13:02:39,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:02:39,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 13:02:39,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:39,681 INFO L225 Difference]: With dead ends: 22607 [2019-12-07 13:02:39,681 INFO L226 Difference]: Without dead ends: 22607 [2019-12-07 13:02:39,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:02:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22607 states. [2019-12-07 13:02:39,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22607 to 17801. [2019-12-07 13:02:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17801 states. [2019-12-07 13:02:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17801 states to 17801 states and 52950 transitions. [2019-12-07 13:02:39,935 INFO L78 Accepts]: Start accepts. Automaton has 17801 states and 52950 transitions. Word has length 34 [2019-12-07 13:02:39,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:39,935 INFO L462 AbstractCegarLoop]: Abstraction has 17801 states and 52950 transitions. [2019-12-07 13:02:39,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:02:39,935 INFO L276 IsEmpty]: Start isEmpty. Operand 17801 states and 52950 transitions. [2019-12-07 13:02:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 13:02:39,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:39,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:39,950 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:39,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:39,950 INFO L82 PathProgramCache]: Analyzing trace with hash 520376947, now seen corresponding path program 1 times [2019-12-07 13:02:39,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:39,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377244611] [2019-12-07 13:02:39,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:39,985 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 13:02:39,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377244611] [2019-12-07 13:02:39,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:39,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:02:39,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110083246] [2019-12-07 13:02:39,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:02:39,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:39,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:02:39,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:02:39,986 INFO L87 Difference]: Start difference. First operand 17801 states and 52950 transitions. Second operand 5 states. [2019-12-07 13:02:40,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:40,035 INFO L93 Difference]: Finished difference Result 16373 states and 49888 transitions. [2019-12-07 13:02:40,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:02:40,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 13:02:40,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:40,052 INFO L225 Difference]: With dead ends: 16373 [2019-12-07 13:02:40,052 INFO L226 Difference]: Without dead ends: 16373 [2019-12-07 13:02:40,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:02:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16373 states. [2019-12-07 13:02:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16373 to 14868. [2019-12-07 13:02:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14868 states. [2019-12-07 13:02:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14868 states to 14868 states and 45573 transitions. [2019-12-07 13:02:40,260 INFO L78 Accepts]: Start accepts. Automaton has 14868 states and 45573 transitions. Word has length 40 [2019-12-07 13:02:40,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:40,261 INFO L462 AbstractCegarLoop]: Abstraction has 14868 states and 45573 transitions. [2019-12-07 13:02:40,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:02:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 14868 states and 45573 transitions. [2019-12-07 13:02:40,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:02:40,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:40,272 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:40,273 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:40,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:40,273 INFO L82 PathProgramCache]: Analyzing trace with hash -344664589, now seen corresponding path program 1 times [2019-12-07 13:02:40,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:40,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108473332] [2019-12-07 13:02:40,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:40,321 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 13:02:40,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108473332] [2019-12-07 13:02:40,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:40,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:40,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250370686] [2019-12-07 13:02:40,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:40,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:40,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:40,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:40,322 INFO L87 Difference]: Start difference. First operand 14868 states and 45573 transitions. Second operand 3 states. [2019-12-07 13:02:40,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:40,395 INFO L93 Difference]: Finished difference Result 17935 states and 55056 transitions. [2019-12-07 13:02:40,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:40,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 13:02:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:40,414 INFO L225 Difference]: With dead ends: 17935 [2019-12-07 13:02:40,414 INFO L226 Difference]: Without dead ends: 17935 [2019-12-07 13:02:40,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:40,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17935 states. [2019-12-07 13:02:40,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17935 to 14126. [2019-12-07 13:02:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14126 states. [2019-12-07 13:02:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14126 states to 14126 states and 43768 transitions. [2019-12-07 13:02:40,642 INFO L78 Accepts]: Start accepts. Automaton has 14126 states and 43768 transitions. Word has length 65 [2019-12-07 13:02:40,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:40,642 INFO L462 AbstractCegarLoop]: Abstraction has 14126 states and 43768 transitions. [2019-12-07 13:02:40,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 14126 states and 43768 transitions. [2019-12-07 13:02:40,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:02:40,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:40,654 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:40,655 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:40,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:40,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1092893205, now seen corresponding path program 1 times [2019-12-07 13:02:40,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:40,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659873980] [2019-12-07 13:02:40,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:40,707 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 13:02:40,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659873980] [2019-12-07 13:02:40,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:40,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:02:40,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360006168] [2019-12-07 13:02:40,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:02:40,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:40,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:02:40,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:02:40,708 INFO L87 Difference]: Start difference. First operand 14126 states and 43768 transitions. Second operand 4 states. [2019-12-07 13:02:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:40,783 INFO L93 Difference]: Finished difference Result 13941 states and 43032 transitions. [2019-12-07 13:02:40,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:02:40,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 13:02:40,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:40,798 INFO L225 Difference]: With dead ends: 13941 [2019-12-07 13:02:40,798 INFO L226 Difference]: Without dead ends: 13941 [2019-12-07 13:02:40,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:02:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13941 states. [2019-12-07 13:02:40,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13941 to 12813. [2019-12-07 13:02:40,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12813 states. [2019-12-07 13:02:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12813 states to 12813 states and 39419 transitions. [2019-12-07 13:02:40,980 INFO L78 Accepts]: Start accepts. Automaton has 12813 states and 39419 transitions. Word has length 66 [2019-12-07 13:02:40,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:40,980 INFO L462 AbstractCegarLoop]: Abstraction has 12813 states and 39419 transitions. [2019-12-07 13:02:40,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:02:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 12813 states and 39419 transitions. [2019-12-07 13:02:40,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:02:40,990 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:40,990 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:40,990 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:40,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1927450831, now seen corresponding path program 1 times [2019-12-07 13:02:40,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:40,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780448461] [2019-12-07 13:02:40,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:41,041 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 13:02:41,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780448461] [2019-12-07 13:02:41,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:41,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:02:41,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347773263] [2019-12-07 13:02:41,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:02:41,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:41,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:02:41,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:02:41,042 INFO L87 Difference]: Start difference. First operand 12813 states and 39419 transitions. Second operand 7 states. [2019-12-07 13:02:41,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:41,310 INFO L93 Difference]: Finished difference Result 37733 states and 114777 transitions. [2019-12-07 13:02:41,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:02:41,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 13:02:41,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:41,341 INFO L225 Difference]: With dead ends: 37733 [2019-12-07 13:02:41,341 INFO L226 Difference]: Without dead ends: 29367 [2019-12-07 13:02:41,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:02:41,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29367 states. [2019-12-07 13:02:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29367 to 16177. [2019-12-07 13:02:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16177 states. [2019-12-07 13:02:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16177 states to 16177 states and 49986 transitions. [2019-12-07 13:02:41,647 INFO L78 Accepts]: Start accepts. Automaton has 16177 states and 49986 transitions. Word has length 66 [2019-12-07 13:02:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:41,647 INFO L462 AbstractCegarLoop]: Abstraction has 16177 states and 49986 transitions. [2019-12-07 13:02:41,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:02:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 16177 states and 49986 transitions. [2019-12-07 13:02:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:02:41,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:41,660 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:41,660 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:41,660 INFO L82 PathProgramCache]: Analyzing trace with hash -267113195, now seen corresponding path program 2 times [2019-12-07 13:02:41,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:41,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562783276] [2019-12-07 13:02:41,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:02:41,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562783276] [2019-12-07 13:02:41,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:41,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:02:41,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974473514] [2019-12-07 13:02:41,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:02:41,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:41,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:02:41,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:02:41,713 INFO L87 Difference]: Start difference. First operand 16177 states and 49986 transitions. Second operand 7 states. [2019-12-07 13:02:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:42,016 INFO L93 Difference]: Finished difference Result 42039 states and 126759 transitions. [2019-12-07 13:02:42,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:02:42,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 13:02:42,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:42,047 INFO L225 Difference]: With dead ends: 42039 [2019-12-07 13:02:42,047 INFO L226 Difference]: Without dead ends: 31453 [2019-12-07 13:02:42,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:02:42,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31453 states. [2019-12-07 13:02:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31453 to 19227. [2019-12-07 13:02:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19227 states. [2019-12-07 13:02:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19227 states to 19227 states and 59226 transitions. [2019-12-07 13:02:42,373 INFO L78 Accepts]: Start accepts. Automaton has 19227 states and 59226 transitions. Word has length 66 [2019-12-07 13:02:42,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:42,373 INFO L462 AbstractCegarLoop]: Abstraction has 19227 states and 59226 transitions. [2019-12-07 13:02:42,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:02:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 19227 states and 59226 transitions. [2019-12-07 13:02:42,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:02:42,389 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:42,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:42,389 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:42,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:42,389 INFO L82 PathProgramCache]: Analyzing trace with hash 39480987, now seen corresponding path program 3 times [2019-12-07 13:02:42,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:42,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428814875] [2019-12-07 13:02:42,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:42,431 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 13:02:42,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428814875] [2019-12-07 13:02:42,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:42,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:02:42,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013506110] [2019-12-07 13:02:42,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:02:42,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:42,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:02:42,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:02:42,432 INFO L87 Difference]: Start difference. First operand 19227 states and 59226 transitions. Second operand 5 states. [2019-12-07 13:02:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:42,797 INFO L93 Difference]: Finished difference Result 27271 states and 81800 transitions. [2019-12-07 13:02:42,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:02:42,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 13:02:42,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:42,827 INFO L225 Difference]: With dead ends: 27271 [2019-12-07 13:02:42,827 INFO L226 Difference]: Without dead ends: 27051 [2019-12-07 13:02:42,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:02:42,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27051 states. [2019-12-07 13:02:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27051 to 22376. [2019-12-07 13:02:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22376 states. [2019-12-07 13:02:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22376 states to 22376 states and 68504 transitions. [2019-12-07 13:02:43,159 INFO L78 Accepts]: Start accepts. Automaton has 22376 states and 68504 transitions. Word has length 66 [2019-12-07 13:02:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:43,159 INFO L462 AbstractCegarLoop]: Abstraction has 22376 states and 68504 transitions. [2019-12-07 13:02:43,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:02:43,159 INFO L276 IsEmpty]: Start isEmpty. Operand 22376 states and 68504 transitions. [2019-12-07 13:02:43,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:02:43,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:43,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:43,178 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:43,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:43,178 INFO L82 PathProgramCache]: Analyzing trace with hash -878142947, now seen corresponding path program 4 times [2019-12-07 13:02:43,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:43,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163862266] [2019-12-07 13:02:43,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:02:43,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163862266] [2019-12-07 13:02:43,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:43,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:43,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421144838] [2019-12-07 13:02:43,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:43,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:43,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:43,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:43,217 INFO L87 Difference]: Start difference. First operand 22376 states and 68504 transitions. Second operand 3 states. [2019-12-07 13:02:43,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:43,274 INFO L93 Difference]: Finished difference Result 19324 states and 58087 transitions. [2019-12-07 13:02:43,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:43,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 13:02:43,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:43,293 INFO L225 Difference]: With dead ends: 19324 [2019-12-07 13:02:43,293 INFO L226 Difference]: Without dead ends: 19324 [2019-12-07 13:02:43,293 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 13:02:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19324 states. [2019-12-07 13:02:43,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19324 to 17470. [2019-12-07 13:02:43,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17470 states. [2019-12-07 13:02:43,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17470 states to 17470 states and 52579 transitions. [2019-12-07 13:02:43,529 INFO L78 Accepts]: Start accepts. Automaton has 17470 states and 52579 transitions. Word has length 66 [2019-12-07 13:02:43,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:43,529 INFO L462 AbstractCegarLoop]: Abstraction has 17470 states and 52579 transitions. [2019-12-07 13:02:43,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:43,529 INFO L276 IsEmpty]: Start isEmpty. Operand 17470 states and 52579 transitions. [2019-12-07 13:02:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:02:43,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:43,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:43,543 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:43,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:43,543 INFO L82 PathProgramCache]: Analyzing trace with hash -543525966, now seen corresponding path program 1 times [2019-12-07 13:02:43,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:43,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274803213] [2019-12-07 13:02:43,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:43,707 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 13:02:43,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274803213] [2019-12-07 13:02:43,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:43,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:02:43,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762565507] [2019-12-07 13:02:43,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 13:02:43,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:43,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 13:02:43,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:02:43,708 INFO L87 Difference]: Start difference. First operand 17470 states and 52579 transitions. Second operand 11 states. [2019-12-07 13:02:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:44,755 INFO L93 Difference]: Finished difference Result 26557 states and 79522 transitions. [2019-12-07 13:02:44,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 13:02:44,756 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 13:02:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:44,777 INFO L225 Difference]: With dead ends: 26557 [2019-12-07 13:02:44,777 INFO L226 Difference]: Without dead ends: 22075 [2019-12-07 13:02:44,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-07 13:02:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22075 states. [2019-12-07 13:02:45,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22075 to 17900. [2019-12-07 13:02:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17900 states. [2019-12-07 13:02:45,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17900 states to 17900 states and 53733 transitions. [2019-12-07 13:02:45,035 INFO L78 Accepts]: Start accepts. Automaton has 17900 states and 53733 transitions. Word has length 67 [2019-12-07 13:02:45,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:45,036 INFO L462 AbstractCegarLoop]: Abstraction has 17900 states and 53733 transitions. [2019-12-07 13:02:45,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 13:02:45,036 INFO L276 IsEmpty]: Start isEmpty. Operand 17900 states and 53733 transitions. [2019-12-07 13:02:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:02:45,089 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:45,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:45,089 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:45,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:45,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1737332378, now seen corresponding path program 2 times [2019-12-07 13:02:45,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:45,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37536181] [2019-12-07 13:02:45,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:02:45,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37536181] [2019-12-07 13:02:45,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:45,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 13:02:45,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478511695] [2019-12-07 13:02:45,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:02:45,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:45,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:02:45,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:02:45,252 INFO L87 Difference]: Start difference. First operand 17900 states and 53733 transitions. Second operand 12 states. [2019-12-07 13:02:46,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:46,324 INFO L93 Difference]: Finished difference Result 24829 states and 73860 transitions. [2019-12-07 13:02:46,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 13:02:46,324 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 13:02:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:46,345 INFO L225 Difference]: With dead ends: 24829 [2019-12-07 13:02:46,345 INFO L226 Difference]: Without dead ends: 21661 [2019-12-07 13:02:46,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2019-12-07 13:02:46,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21661 states. [2019-12-07 13:02:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21661 to 17790. [2019-12-07 13:02:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17790 states. [2019-12-07 13:02:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17790 states to 17790 states and 53411 transitions. [2019-12-07 13:02:46,600 INFO L78 Accepts]: Start accepts. Automaton has 17790 states and 53411 transitions. Word has length 67 [2019-12-07 13:02:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:46,600 INFO L462 AbstractCegarLoop]: Abstraction has 17790 states and 53411 transitions. [2019-12-07 13:02:46,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:02:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 17790 states and 53411 transitions. [2019-12-07 13:02:46,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:02:46,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:46,614 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:46,614 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:46,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:46,614 INFO L82 PathProgramCache]: Analyzing trace with hash 202288426, now seen corresponding path program 3 times [2019-12-07 13:02:46,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:46,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700452305] [2019-12-07 13:02:46,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:46,730 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 13:02:46,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700452305] [2019-12-07 13:02:46,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:46,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:02:46,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305808288] [2019-12-07 13:02:46,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:02:46,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:46,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:02:46,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:02:46,732 INFO L87 Difference]: Start difference. First operand 17790 states and 53411 transitions. Second operand 10 states. [2019-12-07 13:02:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:47,597 INFO L93 Difference]: Finished difference Result 26543 states and 78637 transitions. [2019-12-07 13:02:47,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 13:02:47,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 13:02:47,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:47,620 INFO L225 Difference]: With dead ends: 26543 [2019-12-07 13:02:47,620 INFO L226 Difference]: Without dead ends: 22976 [2019-12-07 13:02:47,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:02:47,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22976 states. [2019-12-07 13:02:47,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22976 to 18236. [2019-12-07 13:02:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18236 states. [2019-12-07 13:02:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18236 states to 18236 states and 54497 transitions. [2019-12-07 13:02:47,885 INFO L78 Accepts]: Start accepts. Automaton has 18236 states and 54497 transitions. Word has length 67 [2019-12-07 13:02:47,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:47,885 INFO L462 AbstractCegarLoop]: Abstraction has 18236 states and 54497 transitions. [2019-12-07 13:02:47,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:02:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 18236 states and 54497 transitions. [2019-12-07 13:02:47,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:02:47,899 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:47,899 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:47,899 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:47,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:47,899 INFO L82 PathProgramCache]: Analyzing trace with hash -917850962, now seen corresponding path program 4 times [2019-12-07 13:02:47,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:47,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322229624] [2019-12-07 13:02:47,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:48,027 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 13:02:48,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322229624] [2019-12-07 13:02:48,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:48,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:02:48,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082254617] [2019-12-07 13:02:48,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 13:02:48,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:48,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 13:02:48,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:02:48,028 INFO L87 Difference]: Start difference. First operand 18236 states and 54497 transitions. Second operand 11 states. [2019-12-07 13:02:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:49,132 INFO L93 Difference]: Finished difference Result 25641 states and 75828 transitions. [2019-12-07 13:02:49,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 13:02:49,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 13:02:49,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:49,164 INFO L225 Difference]: With dead ends: 25641 [2019-12-07 13:02:49,164 INFO L226 Difference]: Without dead ends: 22705 [2019-12-07 13:02:49,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2019-12-07 13:02:49,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22705 states. [2019-12-07 13:02:49,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22705 to 18220. [2019-12-07 13:02:49,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18220 states. [2019-12-07 13:02:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18220 states to 18220 states and 54443 transitions. [2019-12-07 13:02:49,429 INFO L78 Accepts]: Start accepts. Automaton has 18220 states and 54443 transitions. Word has length 67 [2019-12-07 13:02:49,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:49,429 INFO L462 AbstractCegarLoop]: Abstraction has 18220 states and 54443 transitions. [2019-12-07 13:02:49,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 13:02:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 18220 states and 54443 transitions. [2019-12-07 13:02:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:02:49,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:49,443 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:49,444 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:49,444 INFO L82 PathProgramCache]: Analyzing trace with hash 668274002, now seen corresponding path program 5 times [2019-12-07 13:02:49,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:49,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343890252] [2019-12-07 13:02:49,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:49,580 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 13:02:49,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343890252] [2019-12-07 13:02:49,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:49,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 13:02:49,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138837606] [2019-12-07 13:02:49,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:02:49,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:49,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:02:49,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:02:49,581 INFO L87 Difference]: Start difference. First operand 18220 states and 54443 transitions. Second operand 12 states. [2019-12-07 13:02:50,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:50,750 INFO L93 Difference]: Finished difference Result 39086 states and 115346 transitions. [2019-12-07 13:02:50,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 13:02:50,751 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 13:02:50,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:50,783 INFO L225 Difference]: With dead ends: 39086 [2019-12-07 13:02:50,783 INFO L226 Difference]: Without dead ends: 31174 [2019-12-07 13:02:50,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=1020, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 13:02:50,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31174 states. [2019-12-07 13:02:51,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31174 to 16784. [2019-12-07 13:02:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16784 states. [2019-12-07 13:02:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16784 states to 16784 states and 50153 transitions. [2019-12-07 13:02:51,092 INFO L78 Accepts]: Start accepts. Automaton has 16784 states and 50153 transitions. Word has length 67 [2019-12-07 13:02:51,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:51,092 INFO L462 AbstractCegarLoop]: Abstraction has 16784 states and 50153 transitions. [2019-12-07 13:02:51,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:02:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 16784 states and 50153 transitions. [2019-12-07 13:02:51,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:02:51,105 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:51,105 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:51,105 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:51,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:51,105 INFO L82 PathProgramCache]: Analyzing trace with hash 226014226, now seen corresponding path program 6 times [2019-12-07 13:02:51,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:51,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459342947] [2019-12-07 13:02:51,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:51,378 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 13:02:51,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459342947] [2019-12-07 13:02:51,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:51,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 13:02:51,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943777394] [2019-12-07 13:02:51,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 13:02:51,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:51,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 13:02:51,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:02:51,380 INFO L87 Difference]: Start difference. First operand 16784 states and 50153 transitions. Second operand 15 states. [2019-12-07 13:02:53,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:53,547 INFO L93 Difference]: Finished difference Result 24077 states and 70995 transitions. [2019-12-07 13:02:53,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 13:02:53,547 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-07 13:02:53,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:53,569 INFO L225 Difference]: With dead ends: 24077 [2019-12-07 13:02:53,570 INFO L226 Difference]: Without dead ends: 22578 [2019-12-07 13:02:53,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=272, Invalid=1210, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 13:02:53,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22578 states. [2019-12-07 13:02:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22578 to 16864. [2019-12-07 13:02:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16864 states. [2019-12-07 13:02:53,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16864 states to 16864 states and 50365 transitions. [2019-12-07 13:02:53,826 INFO L78 Accepts]: Start accepts. Automaton has 16864 states and 50365 transitions. Word has length 67 [2019-12-07 13:02:53,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:53,826 INFO L462 AbstractCegarLoop]: Abstraction has 16864 states and 50365 transitions. [2019-12-07 13:02:53,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 13:02:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 16864 states and 50365 transitions. [2019-12-07 13:02:53,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:02:53,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:53,839 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:53,839 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:53,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:53,839 INFO L82 PathProgramCache]: Analyzing trace with hash -222673432, now seen corresponding path program 7 times [2019-12-07 13:02:53,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:53,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28092933] [2019-12-07 13:02:53,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:53,987 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 13:02:53,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28092933] [2019-12-07 13:02:53,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:53,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 13:02:53,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616057649] [2019-12-07 13:02:53,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:02:53,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:02:53,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:02:53,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:02:53,989 INFO L87 Difference]: Start difference. First operand 16864 states and 50365 transitions. Second operand 13 states. [2019-12-07 13:02:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:54,767 INFO L93 Difference]: Finished difference Result 32181 states and 95072 transitions. [2019-12-07 13:02:54,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 13:02:54,768 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-07 13:02:54,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:54,802 INFO L225 Difference]: With dead ends: 32181 [2019-12-07 13:02:54,802 INFO L226 Difference]: Without dead ends: 31294 [2019-12-07 13:02:54,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 13:02:54,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31294 states. [2019-12-07 13:02:55,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31294 to 16768. [2019-12-07 13:02:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16768 states. [2019-12-07 13:02:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16768 states to 16768 states and 50113 transitions. [2019-12-07 13:02:55,131 INFO L78 Accepts]: Start accepts. Automaton has 16768 states and 50113 transitions. Word has length 67 [2019-12-07 13:02:55,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:55,131 INFO L462 AbstractCegarLoop]: Abstraction has 16768 states and 50113 transitions. [2019-12-07 13:02:55,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 13:02:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 16768 states and 50113 transitions. [2019-12-07 13:02:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:02:55,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:55,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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:55,144 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:55,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:55,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1210625396, now seen corresponding path program 8 times [2019-12-07 13:02:55,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:02:55,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765296732] [2019-12-07 13:02:55,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:02:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:02:55,222 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 13:02:55,222 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:02:55,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t83~0.offset_23|) (= v_~z$r_buff0_thd2~0_185 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t83~0.base_32| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t83~0.base_32|) |v_ULTIMATE.start_main_~#t83~0.offset_23| 0)) |v_#memory_int_21|) (= 0 v_~x~0_134) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t83~0.base_32|) (= v_~z$w_buff0_used~0_784 0) (= v_~__unbuffered_p1_EBX~0_36 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t83~0.base_32| 1)) (= v_~z$w_buff1_used~0_442 0) (= |v_#NULL.offset_7| 0) (= v_~z~0_178 0) (= v_~z$r_buff1_thd0~0_195 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t83~0.base_32| 4) |v_#length_23|) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~z$read_delayed~0_6 0) (= v_~y~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~__unbuffered_cnt~0_87) (= v_~weak$$choice2~0_133 0) (= v_~z$r_buff0_thd1~0_306 0) (= 0 v_~z$flush_delayed~0_26) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff0_thd3~0_400) (= v_~z$w_buff1~0_222 0) (= 0 v_~__unbuffered_p0_EAX~0_142) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~z$r_buff1_thd3~0_306) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$r_buff1_thd1~0_175 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t83~0.base_32|)) (= v_~z$r_buff1_thd2~0_185 0) (= v_~z$w_buff0~0_312 0) (= v_~z$r_buff0_thd0~0_204 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t83~0.base=|v_ULTIMATE.start_main_~#t83~0.base_32|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_42|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_54|, ULTIMATE.start_main_~#t85~0.offset=|v_ULTIMATE.start_main_~#t85~0.offset_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_34|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_142, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_442, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_175, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_400, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~x~0=v_~x~0_134, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_222, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_62|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t84~0.base=|v_ULTIMATE.start_main_~#t84~0.base_29|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ULTIMATE.start_main_~#t84~0.offset=|v_ULTIMATE.start_main_~#t84~0.offset_22|, ~y~0=v_~y~0_24, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_185, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_36, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_24|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_784, ~z$w_buff0~0=v_~z$w_buff0~0_312, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ULTIMATE.start_main_~#t85~0.base=|v_ULTIMATE.start_main_~#t85~0.base_16|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t83~0.offset=|v_ULTIMATE.start_main_~#t83~0.offset_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_133, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_306} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t83~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t85~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t84~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t84~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t85~0.base, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t83~0.offset, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:02:55,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L750: Formula: (and (= ~z$r_buff1_thd2~0_Out-889577135 ~z$r_buff0_thd2~0_In-889577135) (= ~z$r_buff0_thd0~0_In-889577135 ~z$r_buff1_thd0~0_Out-889577135) (= ~z$r_buff0_thd1~0_In-889577135 ~z$r_buff1_thd1~0_Out-889577135) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-889577135 0)) (= ~z$r_buff1_thd3~0_Out-889577135 ~z$r_buff0_thd3~0_In-889577135) (= ~x~0_In-889577135 ~__unbuffered_p0_EAX~0_Out-889577135) (= 1 ~z$r_buff0_thd1~0_Out-889577135)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-889577135, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-889577135, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-889577135, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-889577135, ~x~0=~x~0_In-889577135, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-889577135} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-889577135, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-889577135, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-889577135, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-889577135, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-889577135, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-889577135, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-889577135, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-889577135, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-889577135, ~x~0=~x~0_In-889577135, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-889577135} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:02:55,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t84~0.offset_10| 0) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t84~0.base_11| 1)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t84~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t84~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t84~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t84~0.base_11| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t84~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t84~0.base_11|) |v_ULTIMATE.start_main_~#t84~0.offset_10| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t84~0.base=|v_ULTIMATE.start_main_~#t84~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t84~0.offset=|v_ULTIMATE.start_main_~#t84~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t84~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t84~0.offset] because there is no mapped edge [2019-12-07 13:02:55,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L773-2-->L773-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out1552853930| |P1Thread1of1ForFork2_#t~ite10_Out1552853930|)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1552853930 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1552853930 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out1552853930| ~z$w_buff1~0_In1552853930)) (and .cse1 (or .cse0 .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out1552853930| ~z~0_In1552853930)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1552853930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1552853930, ~z$w_buff1~0=~z$w_buff1~0_In1552853930, ~z~0=~z~0_In1552853930} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1552853930|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1552853930, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1552853930|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1552853930, ~z$w_buff1~0=~z$w_buff1~0_In1552853930, ~z~0=~z~0_In1552853930} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 13:02:55,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1647272888 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1647272888 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out1647272888| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1647272888| ~z$w_buff0_used~0_In1647272888) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1647272888, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1647272888} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1647272888, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1647272888|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1647272888} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 13:02:55,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L834-1-->L836: Formula: (and (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t85~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t85~0.base_11| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t85~0.base_11|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t85~0.base_11| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t85~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t85~0.base_11|) |v_ULTIMATE.start_main_~#t85~0.offset_10| 2)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t85~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t85~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t85~0.base=|v_ULTIMATE.start_main_~#t85~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t85~0.offset=|v_ULTIMATE.start_main_~#t85~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t85~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t85~0.offset] because there is no mapped edge [2019-12-07 13:02:55,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In837486089 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In837486089 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In837486089 |P0Thread1of1ForFork1_#t~ite5_Out837486089|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out837486089|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In837486089, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In837486089} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out837486089|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In837486089, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In837486089} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 13:02:55,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In-1118645975 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1118645975 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1118645975 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1118645975 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1118645975 |P0Thread1of1ForFork1_#t~ite6_Out-1118645975|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1118645975|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1118645975, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1118645975, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1118645975, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1118645975} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1118645975, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1118645975|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1118645975, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1118645975, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1118645975} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 13:02:55,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In763969568 256))) (.cse1 (= ~z$r_buff0_thd1~0_In763969568 ~z$r_buff0_thd1~0_Out763969568)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In763969568 256)))) (or (and .cse0 .cse1) (and (not .cse0) (= ~z$r_buff0_thd1~0_Out763969568 0) (not .cse2)) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In763969568, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In763969568} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In763969568, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out763969568|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out763969568} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:02:55,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd1~0_In983047931 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In983047931 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In983047931 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In983047931 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out983047931| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite8_Out983047931| ~z$r_buff1_thd1~0_In983047931)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In983047931, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In983047931, ~z$w_buff1_used~0=~z$w_buff1_used~0_In983047931, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In983047931} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out983047931|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In983047931, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In983047931, ~z$w_buff1_used~0=~z$w_buff1_used~0_In983047931, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In983047931} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:02:55,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L754-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~z$r_buff1_thd1~0_78 |v_P0Thread1of1ForFork1_#t~ite8_34|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_33|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_78, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:02:55,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L775-->L775-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-894198023 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-894198023 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-894198023 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-894198023 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-894198023| 0)) (and (= ~z$w_buff1_used~0_In-894198023 |P1Thread1of1ForFork2_#t~ite12_Out-894198023|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-894198023, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-894198023, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-894198023, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-894198023} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-894198023, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-894198023, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-894198023, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-894198023|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-894198023} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 13:02:55,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In945926978 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In945926978 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In945926978 |P1Thread1of1ForFork2_#t~ite13_Out945926978|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out945926978|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In945926978, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In945926978} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In945926978, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out945926978|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In945926978} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 13:02:55,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2017540559 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In2017540559 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In2017540559 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In2017540559 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out2017540559| ~z$r_buff1_thd2~0_In2017540559)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out2017540559| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2017540559, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2017540559, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2017540559, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2017540559} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2017540559, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2017540559, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2017540559, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out2017540559|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2017540559} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 13:02:55,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L777-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= v_~z$r_buff1_thd2~0_132 |v_P1Thread1of1ForFork2_#t~ite14_34|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 13:02:55,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L801-->L801-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1601866341 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out1601866341| ~z$w_buff1_used~0_In1601866341) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1601866341 256) 0))) (or (= (mod ~z$w_buff0_used~0_In1601866341 256) 0) (and (= (mod ~z$w_buff1_used~0_In1601866341 256) 0) .cse0) (and (= 0 (mod ~z$r_buff1_thd3~0_In1601866341 256)) .cse0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out1601866341| |P2Thread1of1ForFork0_#t~ite30_Out1601866341|)) (and (= |P2Thread1of1ForFork0_#t~ite29_In1601866341| |P2Thread1of1ForFork0_#t~ite29_Out1601866341|) (not .cse1) (= ~z$w_buff1_used~0_In1601866341 |P2Thread1of1ForFork0_#t~ite30_Out1601866341|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1601866341, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1601866341, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1601866341, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1601866341, ~weak$$choice2~0=~weak$$choice2~0_In1601866341, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1601866341|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1601866341, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1601866341, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1601866341, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1601866341, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1601866341|, ~weak$$choice2~0=~weak$$choice2~0_In1601866341, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1601866341|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 13:02:55,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~z$r_buff0_thd3~0_58 v_~z$r_buff0_thd3~0_59)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 13:02:55,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L805-->L809: Formula: (and (= v_~z~0_56 v_~z$mem_tmp~0_5) (= 0 v_~z$flush_delayed~0_11) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 13:02:55,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-2-->L809-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1486254705 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1486254705 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In1486254705 |P2Thread1of1ForFork0_#t~ite38_Out1486254705|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out1486254705| ~z$w_buff1~0_In1486254705) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1486254705, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1486254705, ~z$w_buff1~0=~z$w_buff1~0_In1486254705, ~z~0=~z~0_In1486254705} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1486254705|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1486254705, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1486254705, ~z$w_buff1~0=~z$w_buff1~0_In1486254705, ~z~0=~z~0_In1486254705} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 13:02:55,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-4-->L810: Formula: (= v_~z~0_38 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_11|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-07 13:02:55,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1785112907 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1785112907 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1785112907 |P2Thread1of1ForFork0_#t~ite40_Out1785112907|)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out1785112907| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1785112907, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1785112907} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1785112907, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1785112907|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1785112907} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 13:02:55,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In354528158 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In354528158 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In354528158 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In354528158 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out354528158| ~z$w_buff1_used~0_In354528158) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out354528158|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In354528158, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In354528158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In354528158, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In354528158} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In354528158, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In354528158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In354528158, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In354528158, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out354528158|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 13:02:55,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1644705752 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1644705752 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1644705752|) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1644705752| ~z$r_buff0_thd3~0_In1644705752)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1644705752, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1644705752} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1644705752, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1644705752, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1644705752|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 13:02:55,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-873220375 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-873220375 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-873220375 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-873220375 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-873220375| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-873220375 |P2Thread1of1ForFork0_#t~ite43_Out-873220375|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-873220375, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-873220375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-873220375, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-873220375} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-873220375|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-873220375, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-873220375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-873220375, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-873220375} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 13:02:55,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L813-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_188 |v_P2Thread1of1ForFork0_#t~ite43_32|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 13:02:55,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_14) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:02:55,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L842-2-->L842-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1137635811 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1137635811 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out1137635811| |ULTIMATE.start_main_#t~ite47_Out1137635811|))) (or (and (not .cse0) (= ~z$w_buff1~0_In1137635811 |ULTIMATE.start_main_#t~ite47_Out1137635811|) (not .cse1) .cse2) (and (= ~z~0_In1137635811 |ULTIMATE.start_main_#t~ite47_Out1137635811|) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1137635811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1137635811, ~z$w_buff1~0=~z$w_buff1~0_In1137635811, ~z~0=~z~0_In1137635811} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1137635811, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1137635811|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1137635811, ~z$w_buff1~0=~z$w_buff1~0_In1137635811, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1137635811|, ~z~0=~z~0_In1137635811} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 13:02:55,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1363610684 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1363610684 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-1363610684| ~z$w_buff0_used~0_In-1363610684) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-1363610684| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1363610684, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1363610684} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1363610684, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1363610684, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1363610684|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 13:02:55,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In158161187 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In158161187 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In158161187 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In158161187 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out158161187| ~z$w_buff1_used~0_In158161187) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite50_Out158161187| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In158161187, ~z$w_buff0_used~0=~z$w_buff0_used~0_In158161187, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In158161187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In158161187} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out158161187|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In158161187, ~z$w_buff0_used~0=~z$w_buff0_used~0_In158161187, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In158161187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In158161187} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 13:02:55,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L845-->L845-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1606206846 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1606206846 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-1606206846| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1606206846 |ULTIMATE.start_main_#t~ite51_Out-1606206846|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1606206846, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1606206846} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1606206846, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1606206846|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1606206846} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 13:02:55,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L846-->L846-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-213643817 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-213643817 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-213643817 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-213643817 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-213643817| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out-213643817| ~z$r_buff1_thd0~0_In-213643817)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-213643817, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-213643817, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-213643817, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-213643817} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-213643817|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-213643817, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-213643817, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-213643817, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-213643817} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 13:02:55,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_~z$r_buff1_thd0~0_155 |v_ULTIMATE.start_main_#t~ite52_46|) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_33 0) (= 0 v_~__unbuffered_p0_EAX~0_114) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_46|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_45|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_155, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:02:55,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:02:55 BasicIcfg [2019-12-07 13:02:55,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:02:55,295 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:02:55,295 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:02:55,295 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:02:55,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:00:21" (3/4) ... [2019-12-07 13:02:55,297 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:02:55,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t83~0.offset_23|) (= v_~z$r_buff0_thd2~0_185 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t83~0.base_32| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t83~0.base_32|) |v_ULTIMATE.start_main_~#t83~0.offset_23| 0)) |v_#memory_int_21|) (= 0 v_~x~0_134) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t83~0.base_32|) (= v_~z$w_buff0_used~0_784 0) (= v_~__unbuffered_p1_EBX~0_36 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t83~0.base_32| 1)) (= v_~z$w_buff1_used~0_442 0) (= |v_#NULL.offset_7| 0) (= v_~z~0_178 0) (= v_~z$r_buff1_thd0~0_195 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t83~0.base_32| 4) |v_#length_23|) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~z$read_delayed~0_6 0) (= v_~y~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~__unbuffered_cnt~0_87) (= v_~weak$$choice2~0_133 0) (= v_~z$r_buff0_thd1~0_306 0) (= 0 v_~z$flush_delayed~0_26) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff0_thd3~0_400) (= v_~z$w_buff1~0_222 0) (= 0 v_~__unbuffered_p0_EAX~0_142) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~z$r_buff1_thd3~0_306) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$r_buff1_thd1~0_175 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t83~0.base_32|)) (= v_~z$r_buff1_thd2~0_185 0) (= v_~z$w_buff0~0_312 0) (= v_~z$r_buff0_thd0~0_204 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t83~0.base=|v_ULTIMATE.start_main_~#t83~0.base_32|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_42|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_54|, ULTIMATE.start_main_~#t85~0.offset=|v_ULTIMATE.start_main_~#t85~0.offset_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_34|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_142, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_442, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_175, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_400, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~x~0=v_~x~0_134, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_222, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_62|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t84~0.base=|v_ULTIMATE.start_main_~#t84~0.base_29|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ULTIMATE.start_main_~#t84~0.offset=|v_ULTIMATE.start_main_~#t84~0.offset_22|, ~y~0=v_~y~0_24, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_185, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_36, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_24|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_784, ~z$w_buff0~0=v_~z$w_buff0~0_312, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ULTIMATE.start_main_~#t85~0.base=|v_ULTIMATE.start_main_~#t85~0.base_16|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t83~0.offset=|v_ULTIMATE.start_main_~#t83~0.offset_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_133, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_306} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t83~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t85~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t84~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t84~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t85~0.base, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t83~0.offset, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:02:55,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L750: Formula: (and (= ~z$r_buff1_thd2~0_Out-889577135 ~z$r_buff0_thd2~0_In-889577135) (= ~z$r_buff0_thd0~0_In-889577135 ~z$r_buff1_thd0~0_Out-889577135) (= ~z$r_buff0_thd1~0_In-889577135 ~z$r_buff1_thd1~0_Out-889577135) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-889577135 0)) (= ~z$r_buff1_thd3~0_Out-889577135 ~z$r_buff0_thd3~0_In-889577135) (= ~x~0_In-889577135 ~__unbuffered_p0_EAX~0_Out-889577135) (= 1 ~z$r_buff0_thd1~0_Out-889577135)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-889577135, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-889577135, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-889577135, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-889577135, ~x~0=~x~0_In-889577135, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-889577135} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-889577135, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-889577135, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-889577135, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-889577135, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-889577135, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-889577135, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-889577135, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-889577135, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-889577135, ~x~0=~x~0_In-889577135, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-889577135} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:02:55,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t84~0.offset_10| 0) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t84~0.base_11| 1)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t84~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t84~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t84~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t84~0.base_11| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t84~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t84~0.base_11|) |v_ULTIMATE.start_main_~#t84~0.offset_10| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t84~0.base=|v_ULTIMATE.start_main_~#t84~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t84~0.offset=|v_ULTIMATE.start_main_~#t84~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t84~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t84~0.offset] because there is no mapped edge [2019-12-07 13:02:55,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L773-2-->L773-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out1552853930| |P1Thread1of1ForFork2_#t~ite10_Out1552853930|)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1552853930 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1552853930 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out1552853930| ~z$w_buff1~0_In1552853930)) (and .cse1 (or .cse0 .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out1552853930| ~z~0_In1552853930)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1552853930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1552853930, ~z$w_buff1~0=~z$w_buff1~0_In1552853930, ~z~0=~z~0_In1552853930} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1552853930|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1552853930, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1552853930|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1552853930, ~z$w_buff1~0=~z$w_buff1~0_In1552853930, ~z~0=~z~0_In1552853930} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 13:02:55,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1647272888 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1647272888 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out1647272888| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1647272888| ~z$w_buff0_used~0_In1647272888) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1647272888, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1647272888} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1647272888, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1647272888|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1647272888} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 13:02:55,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L834-1-->L836: Formula: (and (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t85~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t85~0.base_11| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t85~0.base_11|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t85~0.base_11| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t85~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t85~0.base_11|) |v_ULTIMATE.start_main_~#t85~0.offset_10| 2)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t85~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t85~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t85~0.base=|v_ULTIMATE.start_main_~#t85~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t85~0.offset=|v_ULTIMATE.start_main_~#t85~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t85~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t85~0.offset] because there is no mapped edge [2019-12-07 13:02:55,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In837486089 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In837486089 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In837486089 |P0Thread1of1ForFork1_#t~ite5_Out837486089|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out837486089|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In837486089, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In837486089} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out837486089|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In837486089, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In837486089} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 13:02:55,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In-1118645975 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1118645975 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1118645975 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1118645975 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1118645975 |P0Thread1of1ForFork1_#t~ite6_Out-1118645975|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1118645975|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1118645975, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1118645975, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1118645975, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1118645975} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1118645975, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1118645975|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1118645975, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1118645975, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1118645975} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 13:02:55,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In763969568 256))) (.cse1 (= ~z$r_buff0_thd1~0_In763969568 ~z$r_buff0_thd1~0_Out763969568)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In763969568 256)))) (or (and .cse0 .cse1) (and (not .cse0) (= ~z$r_buff0_thd1~0_Out763969568 0) (not .cse2)) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In763969568, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In763969568} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In763969568, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out763969568|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out763969568} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:02:55,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd1~0_In983047931 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In983047931 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In983047931 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In983047931 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out983047931| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite8_Out983047931| ~z$r_buff1_thd1~0_In983047931)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In983047931, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In983047931, ~z$w_buff1_used~0=~z$w_buff1_used~0_In983047931, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In983047931} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out983047931|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In983047931, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In983047931, ~z$w_buff1_used~0=~z$w_buff1_used~0_In983047931, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In983047931} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:02:55,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L754-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~z$r_buff1_thd1~0_78 |v_P0Thread1of1ForFork1_#t~ite8_34|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_33|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_78, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:02:55,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L775-->L775-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-894198023 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-894198023 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-894198023 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-894198023 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-894198023| 0)) (and (= ~z$w_buff1_used~0_In-894198023 |P1Thread1of1ForFork2_#t~ite12_Out-894198023|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-894198023, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-894198023, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-894198023, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-894198023} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-894198023, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-894198023, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-894198023, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-894198023|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-894198023} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 13:02:55,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In945926978 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In945926978 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In945926978 |P1Thread1of1ForFork2_#t~ite13_Out945926978|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out945926978|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In945926978, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In945926978} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In945926978, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out945926978|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In945926978} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 13:02:55,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2017540559 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In2017540559 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In2017540559 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In2017540559 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out2017540559| ~z$r_buff1_thd2~0_In2017540559)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out2017540559| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2017540559, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2017540559, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2017540559, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2017540559} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2017540559, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2017540559, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2017540559, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out2017540559|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2017540559} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 13:02:55,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L777-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= v_~z$r_buff1_thd2~0_132 |v_P1Thread1of1ForFork2_#t~ite14_34|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 13:02:55,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L801-->L801-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1601866341 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out1601866341| ~z$w_buff1_used~0_In1601866341) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1601866341 256) 0))) (or (= (mod ~z$w_buff0_used~0_In1601866341 256) 0) (and (= (mod ~z$w_buff1_used~0_In1601866341 256) 0) .cse0) (and (= 0 (mod ~z$r_buff1_thd3~0_In1601866341 256)) .cse0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out1601866341| |P2Thread1of1ForFork0_#t~ite30_Out1601866341|)) (and (= |P2Thread1of1ForFork0_#t~ite29_In1601866341| |P2Thread1of1ForFork0_#t~ite29_Out1601866341|) (not .cse1) (= ~z$w_buff1_used~0_In1601866341 |P2Thread1of1ForFork0_#t~ite30_Out1601866341|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1601866341, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1601866341, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1601866341, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1601866341, ~weak$$choice2~0=~weak$$choice2~0_In1601866341, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1601866341|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1601866341, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1601866341, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1601866341, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1601866341, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1601866341|, ~weak$$choice2~0=~weak$$choice2~0_In1601866341, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1601866341|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 13:02:55,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~z$r_buff0_thd3~0_58 v_~z$r_buff0_thd3~0_59)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 13:02:55,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L805-->L809: Formula: (and (= v_~z~0_56 v_~z$mem_tmp~0_5) (= 0 v_~z$flush_delayed~0_11) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 13:02:55,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-2-->L809-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1486254705 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1486254705 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In1486254705 |P2Thread1of1ForFork0_#t~ite38_Out1486254705|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out1486254705| ~z$w_buff1~0_In1486254705) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1486254705, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1486254705, ~z$w_buff1~0=~z$w_buff1~0_In1486254705, ~z~0=~z~0_In1486254705} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1486254705|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1486254705, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1486254705, ~z$w_buff1~0=~z$w_buff1~0_In1486254705, ~z~0=~z~0_In1486254705} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 13:02:55,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-4-->L810: Formula: (= v_~z~0_38 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_11|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-07 13:02:55,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1785112907 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1785112907 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1785112907 |P2Thread1of1ForFork0_#t~ite40_Out1785112907|)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out1785112907| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1785112907, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1785112907} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1785112907, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1785112907|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1785112907} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 13:02:55,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In354528158 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In354528158 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In354528158 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In354528158 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out354528158| ~z$w_buff1_used~0_In354528158) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out354528158|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In354528158, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In354528158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In354528158, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In354528158} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In354528158, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In354528158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In354528158, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In354528158, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out354528158|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 13:02:55,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1644705752 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1644705752 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1644705752|) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1644705752| ~z$r_buff0_thd3~0_In1644705752)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1644705752, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1644705752} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1644705752, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1644705752, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1644705752|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 13:02:55,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-873220375 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-873220375 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-873220375 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-873220375 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-873220375| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-873220375 |P2Thread1of1ForFork0_#t~ite43_Out-873220375|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-873220375, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-873220375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-873220375, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-873220375} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-873220375|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-873220375, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-873220375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-873220375, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-873220375} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 13:02:55,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L813-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_188 |v_P2Thread1of1ForFork0_#t~ite43_32|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 13:02:55,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_14) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:02:55,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L842-2-->L842-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1137635811 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1137635811 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out1137635811| |ULTIMATE.start_main_#t~ite47_Out1137635811|))) (or (and (not .cse0) (= ~z$w_buff1~0_In1137635811 |ULTIMATE.start_main_#t~ite47_Out1137635811|) (not .cse1) .cse2) (and (= ~z~0_In1137635811 |ULTIMATE.start_main_#t~ite47_Out1137635811|) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1137635811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1137635811, ~z$w_buff1~0=~z$w_buff1~0_In1137635811, ~z~0=~z~0_In1137635811} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1137635811, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1137635811|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1137635811, ~z$w_buff1~0=~z$w_buff1~0_In1137635811, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1137635811|, ~z~0=~z~0_In1137635811} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 13:02:55,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1363610684 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1363610684 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-1363610684| ~z$w_buff0_used~0_In-1363610684) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-1363610684| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1363610684, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1363610684} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1363610684, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1363610684, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1363610684|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 13:02:55,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In158161187 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In158161187 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In158161187 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In158161187 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out158161187| ~z$w_buff1_used~0_In158161187) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite50_Out158161187| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In158161187, ~z$w_buff0_used~0=~z$w_buff0_used~0_In158161187, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In158161187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In158161187} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out158161187|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In158161187, ~z$w_buff0_used~0=~z$w_buff0_used~0_In158161187, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In158161187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In158161187} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 13:02:55,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L845-->L845-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1606206846 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1606206846 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-1606206846| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1606206846 |ULTIMATE.start_main_#t~ite51_Out-1606206846|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1606206846, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1606206846} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1606206846, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1606206846|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1606206846} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 13:02:55,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L846-->L846-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-213643817 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-213643817 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-213643817 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-213643817 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-213643817| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out-213643817| ~z$r_buff1_thd0~0_In-213643817)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-213643817, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-213643817, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-213643817, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-213643817} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-213643817|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-213643817, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-213643817, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-213643817, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-213643817} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 13:02:55,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_~z$r_buff1_thd0~0_155 |v_ULTIMATE.start_main_#t~ite52_46|) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_33 0) (= 0 v_~__unbuffered_p0_EAX~0_114) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_46|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_45|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_155, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:02:55,367 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f3d3d572-4ed3-4e79-81bb-f5b837c8aae0/bin/utaipan/witness.graphml [2019-12-07 13:02:55,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:02:55,369 INFO L168 Benchmark]: Toolchain (without parser) took 154882.06 ms. Allocated memory was 1.0 GB in the beginning and 8.4 GB in the end (delta: 7.4 GB). Free memory was 937.3 MB in the beginning and 5.1 GB in the end (delta: -4.2 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-12-07 13:02:55,369 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 956.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:02:55,369 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 937.3 MB in the beginning and 1.1 GB in the end (delta: -138.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:02:55,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.23 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 13:02:55,370 INFO L168 Benchmark]: Boogie Preprocessor took 25.36 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 13:02:55,370 INFO L168 Benchmark]: RCFGBuilder took 414.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.9 MB). Peak memory consumption was 60.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:02:55,370 INFO L168 Benchmark]: TraceAbstraction took 153946.69 ms. Allocated memory was 1.1 GB in the beginning and 8.4 GB in the end (delta: 7.3 GB). Free memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: -4.1 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-12-07 13:02:55,370 INFO L168 Benchmark]: Witness Printer took 73.00 ms. Allocated memory is still 8.4 GB. Free memory was 5.1 GB in the beginning and 5.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:02:55,372 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 956.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 381.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 937.3 MB in the beginning and 1.1 GB in the end (delta: -138.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.23 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 25.36 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 414.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.9 MB). Peak memory consumption was 60.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 153946.69 ms. Allocated memory was 1.1 GB in the beginning and 8.4 GB in the end (delta: 7.3 GB). Free memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: -4.1 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 73.00 ms. Allocated memory is still 8.4 GB. Free memory was 5.1 GB in the beginning and 5.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 178 ProgramPointsBefore, 95 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 35 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 29 ChoiceCompositions, 7593 VarBasedMoverChecksPositive, 373 VarBasedMoverChecksNegative, 200 SemBasedMoverChecksPositive, 268 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 132619 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t83, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$w_buff1 = z$w_buff0 [L736] 1 z$w_buff0 = 1 [L737] 1 z$w_buff1_used = z$w_buff0_used [L738] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t84, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = x [L770] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L773] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L836] FCALL, FORK 0 pthread_create(&t85, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 y = 1 [L790] 3 __unbuffered_p2_EAX = y [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L775] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L798] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 153.7s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 33.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7599 SDtfs, 8211 SDslu, 25588 SDs, 0 SdLazy, 14965 SolverSat, 285 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 38 SyntacticMatches, 14 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238804occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 97.5s AutomataMinimizationTime, 32 MinimizatonAttempts, 439007 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1342 NumberOfCodeBlocks, 1342 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1243 ConstructedInterpolants, 0 QuantifiedInterpolants, 413837 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...