./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix001_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e0575808-6cc2-4219-8304-2136c8a9a344/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e0575808-6cc2-4219-8304-2136c8a9a344/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e0575808-6cc2-4219-8304-2136c8a9a344/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e0575808-6cc2-4219-8304-2136c8a9a344/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix001_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e0575808-6cc2-4219-8304-2136c8a9a344/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e0575808-6cc2-4219-8304-2136c8a9a344/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d76b2739a75a6ffb0cf570947cabe53fcc20404 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 15:42:16,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:42:16,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:42:16,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:42:16,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:42:16,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:42:16,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:42:16,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:42:16,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:42:16,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:42:16,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:42:16,970 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:42:16,970 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:42:16,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:42:16,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:42:16,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:42:16,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:42:16,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:42:16,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:42:16,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:42:16,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:42:16,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:42:16,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:42:16,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:42:16,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:42:16,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:42:16,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:42:16,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:42:16,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:42:16,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:42:16,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:42:16,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:42:16,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:42:16,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:42:16,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:42:16,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:42:16,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:42:16,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:42:16,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:42:16,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:42:16,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:42:16,987 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e0575808-6cc2-4219-8304-2136c8a9a344/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 15:42:16,997 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:42:16,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:42:16,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:42:16,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:42:16,998 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:42:16,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:42:16,998 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:42:16,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:42:16,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:42:16,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:42:16,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:42:16,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:42:16,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:42:16,999 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:42:16,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:42:16,999 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:42:16,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:42:16,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:42:17,000 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:42:17,000 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:42:17,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:42:17,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:42:17,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:42:17,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:42:17,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:42:17,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:42:17,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:42:17,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:42:17,001 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:42:17,001 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_e0575808-6cc2-4219-8304-2136c8a9a344/bin/uautomizer 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 -> Automizer 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 -> 6d76b2739a75a6ffb0cf570947cabe53fcc20404 [2019-12-07 15:42:17,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:42:17,113 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:42:17,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:42:17,116 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:42:17,116 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:42:17,117 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e0575808-6cc2-4219-8304-2136c8a9a344/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix001_pso.oepc.i [2019-12-07 15:42:17,155 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e0575808-6cc2-4219-8304-2136c8a9a344/bin/uautomizer/data/013f89c58/e909be5f70d6472689281f0ff7e2bd69/FLAGdcaa8946a [2019-12-07 15:42:17,680 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:42:17,680 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e0575808-6cc2-4219-8304-2136c8a9a344/sv-benchmarks/c/pthread-wmm/mix001_pso.oepc.i [2019-12-07 15:42:17,694 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e0575808-6cc2-4219-8304-2136c8a9a344/bin/uautomizer/data/013f89c58/e909be5f70d6472689281f0ff7e2bd69/FLAGdcaa8946a [2019-12-07 15:42:18,187 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e0575808-6cc2-4219-8304-2136c8a9a344/bin/uautomizer/data/013f89c58/e909be5f70d6472689281f0ff7e2bd69 [2019-12-07 15:42:18,190 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:42:18,191 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:42:18,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:42:18,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:42:18,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:42:18,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:42:18" (1/1) ... [2019-12-07 15:42:18,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227d51b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:42:18, skipping insertion in model container [2019-12-07 15:42:18,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:42:18" (1/1) ... [2019-12-07 15:42:18,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:42:18,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:42:18,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:42:18,488 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:42:18,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:42:18,582 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:42:18,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:42:18 WrapperNode [2019-12-07 15:42:18,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:42:18,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:42:18,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:42:18,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:42:18,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:42:18" (1/1) ... [2019-12-07 15:42:18,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:42:18" (1/1) ... [2019-12-07 15:42:18,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:42:18,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:42:18,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:42:18,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:42:18,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:42:18" (1/1) ... [2019-12-07 15:42:18,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:42:18" (1/1) ... [2019-12-07 15:42:18,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:42:18" (1/1) ... [2019-12-07 15:42:18,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:42:18" (1/1) ... [2019-12-07 15:42:18,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:42:18" (1/1) ... [2019-12-07 15:42:18,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:42:18" (1/1) ... [2019-12-07 15:42:18,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:42:18" (1/1) ... [2019-12-07 15:42:18,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:42:18,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:42:18,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:42:18,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:42:18,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:42:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e0575808-6cc2-4219-8304-2136c8a9a344/bin/uautomizer/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 15:42:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:42:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 15:42:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:42:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:42:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 15:42:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 15:42:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 15:42:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 15:42:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 15:42:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 15:42:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 15:42:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:42:18,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:42:18,703 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 15:42:19,132 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:42:19,132 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 15:42:19,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:42:19 BoogieIcfgContainer [2019-12-07 15:42:19,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:42:19,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:42:19,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:42:19,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:42:19,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:42:18" (1/3) ... [2019-12-07 15:42:19,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d26a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:42:19, skipping insertion in model container [2019-12-07 15:42:19,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:42:18" (2/3) ... [2019-12-07 15:42:19,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d26a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:42:19, skipping insertion in model container [2019-12-07 15:42:19,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:42:19" (3/3) ... [2019-12-07 15:42:19,138 INFO L109 eAbstractionObserver]: Analyzing ICFG mix001_pso.oepc.i [2019-12-07 15:42:19,144 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 15:42:19,144 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:42:19,149 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 15:42:19,150 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 15:42:19,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,179 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,179 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,179 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,180 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,180 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,200 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,200 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,205 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,205 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:42:19,227 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 15:42:19,240 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:42:19,241 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:42:19,241 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:42:19,241 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:42:19,241 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:42:19,241 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:42:19,241 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:42:19,241 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:42:19,255 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 279 transitions [2019-12-07 15:42:19,256 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 221 places, 279 transitions [2019-12-07 15:42:19,343 INFO L134 PetriNetUnfolder]: 68/276 cut-off events. [2019-12-07 15:42:19,343 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:42:19,360 INFO L76 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 276 events. 68/276 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1181 event pairs. 9/215 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. [2019-12-07 15:42:19,398 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 221 places, 279 transitions [2019-12-07 15:42:19,457 INFO L134 PetriNetUnfolder]: 68/276 cut-off events. [2019-12-07 15:42:19,457 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:42:19,470 INFO L76 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 276 events. 68/276 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1181 event pairs. 9/215 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. [2019-12-07 15:42:19,503 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 37778 [2019-12-07 15:42:19,504 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 15:42:23,409 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 15:42:23,532 INFO L206 etLargeBlockEncoding]: Checked pairs total: 225551 [2019-12-07 15:42:23,532 INFO L214 etLargeBlockEncoding]: Total number of compositions: 125 [2019-12-07 15:42:23,535 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132 places, 156 transitions [2019-12-07 15:44:37,903 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 403202 states. [2019-12-07 15:44:37,905 INFO L276 IsEmpty]: Start isEmpty. Operand 403202 states. [2019-12-07 15:44:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 15:44:37,909 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:37,909 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 15:44:37,909 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 15:44:37,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:37,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1208360, now seen corresponding path program 1 times [2019-12-07 15:44:37,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:37,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524107302] [2019-12-07 15:44:37,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:38,064 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 15:44:38,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524107302] [2019-12-07 15:44:38,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:38,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:44:38,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074127617] [2019-12-07 15:44:38,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:44:38,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:38,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:44:38,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:44:38,078 INFO L87 Difference]: Start difference. First operand 403202 states. Second operand 3 states. [2019-12-07 15:44:40,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:40,180 INFO L93 Difference]: Finished difference Result 402288 states and 1820874 transitions. [2019-12-07 15:44:40,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:44:40,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 15:44:40,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:41,447 INFO L225 Difference]: With dead ends: 402288 [2019-12-07 15:44:41,447 INFO L226 Difference]: Without dead ends: 374780 [2019-12-07 15:44:41,448 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 15:45:31,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374780 states. [2019-12-07 15:45:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374780 to 374780. [2019-12-07 15:45:36,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374780 states. [2019-12-07 15:45:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374780 states to 374780 states and 1695294 transitions. [2019-12-07 15:45:42,706 INFO L78 Accepts]: Start accepts. Automaton has 374780 states and 1695294 transitions. Word has length 3 [2019-12-07 15:45:42,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:42,706 INFO L462 AbstractCegarLoop]: Abstraction has 374780 states and 1695294 transitions. [2019-12-07 15:45:42,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:45:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 374780 states and 1695294 transitions. [2019-12-07 15:45:42,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 15:45:42,710 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:42,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:42,710 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 15:45:42,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:42,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1508535638, now seen corresponding path program 1 times [2019-12-07 15:45:42,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:42,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848873790] [2019-12-07 15:45:42,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:42,791 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 15:45:42,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848873790] [2019-12-07 15:45:42,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:42,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:45:42,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471168579] [2019-12-07 15:45:42,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:42,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:42,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:42,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:42,793 INFO L87 Difference]: Start difference. First operand 374780 states and 1695294 transitions. Second operand 4 states. [2019-12-07 15:45:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:45,882 INFO L93 Difference]: Finished difference Result 602900 states and 2616168 transitions. [2019-12-07 15:45:45,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:45:45,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 15:45:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:48,533 INFO L225 Difference]: With dead ends: 602900 [2019-12-07 15:45:48,534 INFO L226 Difference]: Without dead ends: 602851 [2019-12-07 15:45:48,534 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 15:46:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602851 states. [2019-12-07 15:46:54,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602851 to 583909. [2019-12-07 15:46:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583909 states. [2019-12-07 15:46:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583909 states to 583909 states and 2548359 transitions. [2019-12-07 15:46:57,563 INFO L78 Accepts]: Start accepts. Automaton has 583909 states and 2548359 transitions. Word has length 11 [2019-12-07 15:46:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:46:57,564 INFO L462 AbstractCegarLoop]: Abstraction has 583909 states and 2548359 transitions. [2019-12-07 15:46:57,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:46:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 583909 states and 2548359 transitions. [2019-12-07 15:46:57,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 15:46:57,568 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:46:57,568 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:46:57,568 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 15:46:57,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:46:57,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1223814159, now seen corresponding path program 1 times [2019-12-07 15:46:57,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:46:57,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223429840] [2019-12-07 15:46:57,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:46:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:46:57,610 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 15:46:57,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223429840] [2019-12-07 15:46:57,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:46:57,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:46:57,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58356126] [2019-12-07 15:46:57,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:46:57,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:46:57,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:46:57,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:46:57,612 INFO L87 Difference]: Start difference. First operand 583909 states and 2548359 transitions. Second operand 3 states. [2019-12-07 15:46:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:46:57,983 INFO L93 Difference]: Finished difference Result 103702 states and 356229 transitions. [2019-12-07 15:46:57,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:46:57,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 15:46:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:46:58,197 INFO L225 Difference]: With dead ends: 103702 [2019-12-07 15:46:58,197 INFO L226 Difference]: Without dead ends: 103702 [2019-12-07 15:46:58,198 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 15:47:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103702 states. [2019-12-07 15:47:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103702 to 103702. [2019-12-07 15:47:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103702 states. [2019-12-07 15:47:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103702 states to 103702 states and 356229 transitions. [2019-12-07 15:47:01,397 INFO L78 Accepts]: Start accepts. Automaton has 103702 states and 356229 transitions. Word has length 13 [2019-12-07 15:47:01,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:01,397 INFO L462 AbstractCegarLoop]: Abstraction has 103702 states and 356229 transitions. [2019-12-07 15:47:01,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:47:01,397 INFO L276 IsEmpty]: Start isEmpty. Operand 103702 states and 356229 transitions. [2019-12-07 15:47:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 15:47:01,401 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:01,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:01,401 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 15:47:01,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:01,401 INFO L82 PathProgramCache]: Analyzing trace with hash -916687726, now seen corresponding path program 1 times [2019-12-07 15:47:01,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:01,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789151609] [2019-12-07 15:47:01,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:01,450 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 15:47:01,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789151609] [2019-12-07 15:47:01,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:01,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:47:01,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856884258] [2019-12-07 15:47:01,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:47:01,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:01,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:47:01,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:47:01,451 INFO L87 Difference]: Start difference. First operand 103702 states and 356229 transitions. Second operand 4 states. [2019-12-07 15:47:02,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:02,765 INFO L93 Difference]: Finished difference Result 127732 states and 434128 transitions. [2019-12-07 15:47:02,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:47:02,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 15:47:02,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:02,980 INFO L225 Difference]: With dead ends: 127732 [2019-12-07 15:47:02,980 INFO L226 Difference]: Without dead ends: 127732 [2019-12-07 15:47:02,981 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 15:47:04,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127732 states. [2019-12-07 15:47:07,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127732 to 116712. [2019-12-07 15:47:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116712 states. [2019-12-07 15:47:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116712 states to 116712 states and 398411 transitions. [2019-12-07 15:47:08,134 INFO L78 Accepts]: Start accepts. Automaton has 116712 states and 398411 transitions. Word has length 16 [2019-12-07 15:47:08,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:08,135 INFO L462 AbstractCegarLoop]: Abstraction has 116712 states and 398411 transitions. [2019-12-07 15:47:08,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:47:08,135 INFO L276 IsEmpty]: Start isEmpty. Operand 116712 states and 398411 transitions. [2019-12-07 15:47:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 15:47:08,139 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:08,139 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:08,139 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 15:47:08,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:08,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1647479818, now seen corresponding path program 1 times [2019-12-07 15:47:08,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:08,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295757226] [2019-12-07 15:47:08,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:08,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295757226] [2019-12-07 15:47:08,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:08,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:47:08,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111378638] [2019-12-07 15:47:08,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:47:08,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:08,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:47:08,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:47:08,165 INFO L87 Difference]: Start difference. First operand 116712 states and 398411 transitions. Second operand 3 states. [2019-12-07 15:47:08,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:08,884 INFO L93 Difference]: Finished difference Result 210026 states and 690671 transitions. [2019-12-07 15:47:08,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:47:08,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 15:47:08,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:09,284 INFO L225 Difference]: With dead ends: 210026 [2019-12-07 15:47:09,285 INFO L226 Difference]: Without dead ends: 210026 [2019-12-07 15:47:09,285 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 15:47:11,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210026 states. [2019-12-07 15:47:13,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210026 to 183115. [2019-12-07 15:47:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183115 states. [2019-12-07 15:47:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183115 states to 183115 states and 609068 transitions. [2019-12-07 15:47:13,616 INFO L78 Accepts]: Start accepts. Automaton has 183115 states and 609068 transitions. Word has length 17 [2019-12-07 15:47:13,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:13,616 INFO L462 AbstractCegarLoop]: Abstraction has 183115 states and 609068 transitions. [2019-12-07 15:47:13,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:47:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 183115 states and 609068 transitions. [2019-12-07 15:47:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 15:47:13,622 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:13,622 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 15:47:13,623 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 15:47:13,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:13,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1643087279, now seen corresponding path program 1 times [2019-12-07 15:47:13,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:13,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825518208] [2019-12-07 15:47:13,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:13,665 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 15:47:13,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825518208] [2019-12-07 15:47:13,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:13,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:47:13,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011677740] [2019-12-07 15:47:13,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:47:13,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:13,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:47:13,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:47:13,667 INFO L87 Difference]: Start difference. First operand 183115 states and 609068 transitions. Second operand 4 states. [2019-12-07 15:47:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:14,620 INFO L93 Difference]: Finished difference Result 219397 states and 723024 transitions. [2019-12-07 15:47:14,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:47:14,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 15:47:14,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:15,403 INFO L225 Difference]: With dead ends: 219397 [2019-12-07 15:47:15,404 INFO L226 Difference]: Without dead ends: 219397 [2019-12-07 15:47:15,404 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 15:47:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219397 states. [2019-12-07 15:47:19,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219397 to 185575. [2019-12-07 15:47:19,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185575 states. [2019-12-07 15:47:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185575 states to 185575 states and 617073 transitions. [2019-12-07 15:47:19,841 INFO L78 Accepts]: Start accepts. Automaton has 185575 states and 617073 transitions. Word has length 19 [2019-12-07 15:47:19,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:19,841 INFO L462 AbstractCegarLoop]: Abstraction has 185575 states and 617073 transitions. [2019-12-07 15:47:19,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:47:19,841 INFO L276 IsEmpty]: Start isEmpty. Operand 185575 states and 617073 transitions. [2019-12-07 15:47:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 15:47:19,852 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:19,852 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 15:47:19,853 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 15:47:19,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:19,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1548493996, now seen corresponding path program 1 times [2019-12-07 15:47:19,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:19,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865654406] [2019-12-07 15:47:19,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:19,906 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 15:47:19,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865654406] [2019-12-07 15:47:19,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:19,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:47:19,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712977328] [2019-12-07 15:47:19,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:47:19,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:19,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:47:19,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:47:19,907 INFO L87 Difference]: Start difference. First operand 185575 states and 617073 transitions. Second operand 5 states. [2019-12-07 15:47:21,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:21,467 INFO L93 Difference]: Finished difference Result 267676 states and 871289 transitions. [2019-12-07 15:47:21,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:47:21,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 15:47:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:21,964 INFO L225 Difference]: With dead ends: 267676 [2019-12-07 15:47:21,964 INFO L226 Difference]: Without dead ends: 267669 [2019-12-07 15:47:21,965 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 15:47:24,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267669 states. [2019-12-07 15:47:29,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267669 to 194753. [2019-12-07 15:47:29,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194753 states. [2019-12-07 15:47:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194753 states to 194753 states and 645601 transitions. [2019-12-07 15:47:29,927 INFO L78 Accepts]: Start accepts. Automaton has 194753 states and 645601 transitions. Word has length 22 [2019-12-07 15:47:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:29,927 INFO L462 AbstractCegarLoop]: Abstraction has 194753 states and 645601 transitions. [2019-12-07 15:47:29,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:47:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 194753 states and 645601 transitions. [2019-12-07 15:47:29,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 15:47:29,946 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:29,947 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:29,947 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 15:47:29,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:29,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2026021676, now seen corresponding path program 1 times [2019-12-07 15:47:29,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:29,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988403801] [2019-12-07 15:47:29,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:29,980 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 15:47:29,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988403801] [2019-12-07 15:47:29,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:29,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:47:29,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79270283] [2019-12-07 15:47:29,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:47:29,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:29,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:47:29,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:47:29,981 INFO L87 Difference]: Start difference. First operand 194753 states and 645601 transitions. Second operand 4 states. [2019-12-07 15:47:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:30,290 INFO L93 Difference]: Finished difference Result 94935 states and 305750 transitions. [2019-12-07 15:47:30,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:47:30,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 15:47:30,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:30,439 INFO L225 Difference]: With dead ends: 94935 [2019-12-07 15:47:30,439 INFO L226 Difference]: Without dead ends: 94935 [2019-12-07 15:47:30,439 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 15:47:31,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94935 states. [2019-12-07 15:47:32,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94935 to 93310. [2019-12-07 15:47:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93310 states. [2019-12-07 15:47:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93310 states to 93310 states and 301110 transitions. [2019-12-07 15:47:32,409 INFO L78 Accepts]: Start accepts. Automaton has 93310 states and 301110 transitions. Word has length 25 [2019-12-07 15:47:32,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:32,409 INFO L462 AbstractCegarLoop]: Abstraction has 93310 states and 301110 transitions. [2019-12-07 15:47:32,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:47:32,409 INFO L276 IsEmpty]: Start isEmpty. Operand 93310 states and 301110 transitions. [2019-12-07 15:47:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 15:47:32,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:32,429 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:32,429 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 15:47:32,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:32,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1060201481, now seen corresponding path program 1 times [2019-12-07 15:47:32,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:32,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873603845] [2019-12-07 15:47:32,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:32,479 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 15:47:32,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873603845] [2019-12-07 15:47:32,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:32,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:47:32,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881610901] [2019-12-07 15:47:32,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:47:32,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:32,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:47:32,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:47:32,481 INFO L87 Difference]: Start difference. First operand 93310 states and 301110 transitions. Second operand 5 states. [2019-12-07 15:47:33,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:33,320 INFO L93 Difference]: Finished difference Result 130947 states and 413748 transitions. [2019-12-07 15:47:33,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:47:33,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 15:47:33,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:33,531 INFO L225 Difference]: With dead ends: 130947 [2019-12-07 15:47:33,531 INFO L226 Difference]: Without dead ends: 130947 [2019-12-07 15:47:33,531 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 15:47:34,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130947 states. [2019-12-07 15:47:35,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130947 to 87639. [2019-12-07 15:47:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87639 states. [2019-12-07 15:47:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87639 states to 87639 states and 283011 transitions. [2019-12-07 15:47:35,876 INFO L78 Accepts]: Start accepts. Automaton has 87639 states and 283011 transitions. Word has length 25 [2019-12-07 15:47:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:35,876 INFO L462 AbstractCegarLoop]: Abstraction has 87639 states and 283011 transitions. [2019-12-07 15:47:35,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:47:35,876 INFO L276 IsEmpty]: Start isEmpty. Operand 87639 states and 283011 transitions. [2019-12-07 15:47:35,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 15:47:35,909 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:35,910 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 15:47:35,910 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 15:47:35,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:35,910 INFO L82 PathProgramCache]: Analyzing trace with hash 814643528, now seen corresponding path program 1 times [2019-12-07 15:47:35,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:35,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450124312] [2019-12-07 15:47:35,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:35,957 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 15:47:35,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450124312] [2019-12-07 15:47:35,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:35,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:47:35,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709944558] [2019-12-07 15:47:35,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:47:35,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:35,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:47:35,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:47:35,958 INFO L87 Difference]: Start difference. First operand 87639 states and 283011 transitions. Second operand 5 states. [2019-12-07 15:47:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:36,612 INFO L93 Difference]: Finished difference Result 113659 states and 361253 transitions. [2019-12-07 15:47:36,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:47:36,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 15:47:36,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:36,797 INFO L225 Difference]: With dead ends: 113659 [2019-12-07 15:47:36,797 INFO L226 Difference]: Without dead ends: 113659 [2019-12-07 15:47:36,797 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 15:47:37,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113659 states. [2019-12-07 15:47:38,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113659 to 108034. [2019-12-07 15:47:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108034 states. [2019-12-07 15:47:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108034 states to 108034 states and 345940 transitions. [2019-12-07 15:47:39,053 INFO L78 Accepts]: Start accepts. Automaton has 108034 states and 345940 transitions. Word has length 29 [2019-12-07 15:47:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:39,054 INFO L462 AbstractCegarLoop]: Abstraction has 108034 states and 345940 transitions. [2019-12-07 15:47:39,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:47:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 108034 states and 345940 transitions. [2019-12-07 15:47:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 15:47:39,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:39,098 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] [2019-12-07 15:47:39,099 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 15:47:39,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:39,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2042888681, now seen corresponding path program 1 times [2019-12-07 15:47:39,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:39,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727280525] [2019-12-07 15:47:39,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:39,119 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 15:47:39,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727280525] [2019-12-07 15:47:39,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:39,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:47:39,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402551269] [2019-12-07 15:47:39,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:47:39,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:39,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:47:39,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:47:39,121 INFO L87 Difference]: Start difference. First operand 108034 states and 345940 transitions. Second operand 3 states. [2019-12-07 15:47:39,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:39,602 INFO L93 Difference]: Finished difference Result 123667 states and 378958 transitions. [2019-12-07 15:47:39,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:47:39,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 15:47:39,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:39,793 INFO L225 Difference]: With dead ends: 123667 [2019-12-07 15:47:39,793 INFO L226 Difference]: Without dead ends: 123667 [2019-12-07 15:47:39,793 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 15:47:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123667 states. [2019-12-07 15:47:42,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123667 to 112358. [2019-12-07 15:47:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112358 states. [2019-12-07 15:47:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112358 states to 112358 states and 346497 transitions. [2019-12-07 15:47:42,246 INFO L78 Accepts]: Start accepts. Automaton has 112358 states and 346497 transitions. Word has length 32 [2019-12-07 15:47:42,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:42,246 INFO L462 AbstractCegarLoop]: Abstraction has 112358 states and 346497 transitions. [2019-12-07 15:47:42,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:47:42,247 INFO L276 IsEmpty]: Start isEmpty. Operand 112358 states and 346497 transitions. [2019-12-07 15:47:42,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 15:47:42,307 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:42,307 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:42,308 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 15:47:42,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:42,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2061286546, now seen corresponding path program 1 times [2019-12-07 15:47:42,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:42,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221839889] [2019-12-07 15:47:42,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:42,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 15:47:42,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221839889] [2019-12-07 15:47:42,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:42,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:47:42,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759265968] [2019-12-07 15:47:42,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:47:42,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:42,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:47:42,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:47:42,379 INFO L87 Difference]: Start difference. First operand 112358 states and 346497 transitions. Second operand 6 states. [2019-12-07 15:47:43,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:43,358 INFO L93 Difference]: Finished difference Result 136035 states and 413213 transitions. [2019-12-07 15:47:43,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 15:47:43,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-07 15:47:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:43,558 INFO L225 Difference]: With dead ends: 136035 [2019-12-07 15:47:43,558 INFO L226 Difference]: Without dead ends: 136035 [2019-12-07 15:47:43,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 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 15:47:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136035 states. [2019-12-07 15:47:45,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136035 to 116902. [2019-12-07 15:47:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116902 states. [2019-12-07 15:47:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116902 states to 116902 states and 360150 transitions. [2019-12-07 15:47:46,083 INFO L78 Accepts]: Start accepts. Automaton has 116902 states and 360150 transitions. Word has length 35 [2019-12-07 15:47:46,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:46,083 INFO L462 AbstractCegarLoop]: Abstraction has 116902 states and 360150 transitions. [2019-12-07 15:47:46,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:47:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 116902 states and 360150 transitions. [2019-12-07 15:47:46,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 15:47:46,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:46,145 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:46,145 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 15:47:46,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:46,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1085985974, now seen corresponding path program 1 times [2019-12-07 15:47:46,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:46,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756771429] [2019-12-07 15:47:46,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:46,197 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 15:47:46,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756771429] [2019-12-07 15:47:46,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:46,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:47:46,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247901404] [2019-12-07 15:47:46,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:47:46,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:46,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:47:46,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:47:46,198 INFO L87 Difference]: Start difference. First operand 116902 states and 360150 transitions. Second operand 5 states. [2019-12-07 15:47:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:46,844 INFO L93 Difference]: Finished difference Result 133158 states and 405970 transitions. [2019-12-07 15:47:46,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:47:46,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 15:47:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:47,044 INFO L225 Difference]: With dead ends: 133158 [2019-12-07 15:47:47,045 INFO L226 Difference]: Without dead ends: 133158 [2019-12-07 15:47:47,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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 15:47:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133158 states. [2019-12-07 15:47:49,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133158 to 118030. [2019-12-07 15:47:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118030 states. [2019-12-07 15:47:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118030 states to 118030 states and 363338 transitions. [2019-12-07 15:47:49,485 INFO L78 Accepts]: Start accepts. Automaton has 118030 states and 363338 transitions. Word has length 35 [2019-12-07 15:47:49,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:49,485 INFO L462 AbstractCegarLoop]: Abstraction has 118030 states and 363338 transitions. [2019-12-07 15:47:49,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:47:49,485 INFO L276 IsEmpty]: Start isEmpty. Operand 118030 states and 363338 transitions. [2019-12-07 15:47:49,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 15:47:49,569 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:49,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:49,569 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 15:47:49,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:49,569 INFO L82 PathProgramCache]: Analyzing trace with hash -641253136, now seen corresponding path program 1 times [2019-12-07 15:47:49,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:49,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283468707] [2019-12-07 15:47:49,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:49,634 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 15:47:49,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283468707] [2019-12-07 15:47:49,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:49,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:47:49,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034863368] [2019-12-07 15:47:49,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:47:49,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:49,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:47:49,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:47:49,635 INFO L87 Difference]: Start difference. First operand 118030 states and 363338 transitions. Second operand 6 states. [2019-12-07 15:47:49,844 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-07 15:47:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:50,740 INFO L93 Difference]: Finished difference Result 146005 states and 442728 transitions. [2019-12-07 15:47:50,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 15:47:50,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 15:47:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:50,954 INFO L225 Difference]: With dead ends: 146005 [2019-12-07 15:47:50,954 INFO L226 Difference]: Without dead ends: 146005 [2019-12-07 15:47:50,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 15:47:51,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146005 states. [2019-12-07 15:47:53,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146005 to 99300. [2019-12-07 15:47:53,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99300 states. [2019-12-07 15:47:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99300 states to 99300 states and 308182 transitions. [2019-12-07 15:47:53,409 INFO L78 Accepts]: Start accepts. Automaton has 99300 states and 308182 transitions. Word has length 41 [2019-12-07 15:47:53,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:53,409 INFO L462 AbstractCegarLoop]: Abstraction has 99300 states and 308182 transitions. [2019-12-07 15:47:53,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:47:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 99300 states and 308182 transitions. [2019-12-07 15:47:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 15:47:53,512 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:53,512 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] [2019-12-07 15:47:53,512 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 15:47:53,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:53,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1848993228, now seen corresponding path program 1 times [2019-12-07 15:47:53,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:53,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399790788] [2019-12-07 15:47:53,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:53,565 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 15:47:53,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399790788] [2019-12-07 15:47:53,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:53,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:47:53,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115001867] [2019-12-07 15:47:53,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:47:53,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:53,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:47:53,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:47:53,566 INFO L87 Difference]: Start difference. First operand 99300 states and 308182 transitions. Second operand 5 states. [2019-12-07 15:47:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:53,828 INFO L93 Difference]: Finished difference Result 96477 states and 301813 transitions. [2019-12-07 15:47:53,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:47:53,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-07 15:47:53,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:53,962 INFO L225 Difference]: With dead ends: 96477 [2019-12-07 15:47:53,962 INFO L226 Difference]: Without dead ends: 96477 [2019-12-07 15:47:53,962 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 15:47:54,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96477 states. [2019-12-07 15:47:55,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96477 to 94846. [2019-12-07 15:47:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94846 states. [2019-12-07 15:47:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94846 states to 94846 states and 297398 transitions. [2019-12-07 15:47:55,956 INFO L78 Accepts]: Start accepts. Automaton has 94846 states and 297398 transitions. Word has length 53 [2019-12-07 15:47:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:55,957 INFO L462 AbstractCegarLoop]: Abstraction has 94846 states and 297398 transitions. [2019-12-07 15:47:55,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:47:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 94846 states and 297398 transitions. [2019-12-07 15:47:56,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 15:47:56,066 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:56,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:56,066 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 15:47:56,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:56,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1919550551, now seen corresponding path program 1 times [2019-12-07 15:47:56,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:56,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338633129] [2019-12-07 15:47:56,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:56,126 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 15:47:56,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338633129] [2019-12-07 15:47:56,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:56,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:47:56,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454557957] [2019-12-07 15:47:56,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:47:56,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:56,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:47:56,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:47:56,127 INFO L87 Difference]: Start difference. First operand 94846 states and 297398 transitions. Second operand 3 states. [2019-12-07 15:47:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:56,389 INFO L93 Difference]: Finished difference Result 94846 states and 293291 transitions. [2019-12-07 15:47:56,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:47:56,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-12-07 15:47:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:56,526 INFO L225 Difference]: With dead ends: 94846 [2019-12-07 15:47:56,526 INFO L226 Difference]: Without dead ends: 94846 [2019-12-07 15:47:56,526 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 15:47:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94846 states. [2019-12-07 15:47:58,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94846 to 94846. [2019-12-07 15:47:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94846 states. [2019-12-07 15:47:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94846 states to 94846 states and 293291 transitions. [2019-12-07 15:47:58,470 INFO L78 Accepts]: Start accepts. Automaton has 94846 states and 293291 transitions. Word has length 81 [2019-12-07 15:47:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:58,470 INFO L462 AbstractCegarLoop]: Abstraction has 94846 states and 293291 transitions. [2019-12-07 15:47:58,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:47:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 94846 states and 293291 transitions. [2019-12-07 15:47:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 15:47:58,576 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:58,576 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:58,577 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 15:47:58,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:58,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1492575466, now seen corresponding path program 1 times [2019-12-07 15:47:58,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:58,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169904799] [2019-12-07 15:47:58,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:58,627 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 15:47:58,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169904799] [2019-12-07 15:47:58,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:58,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:47:58,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059625720] [2019-12-07 15:47:58,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:47:58,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:58,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:47:58,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:47:58,628 INFO L87 Difference]: Start difference. First operand 94846 states and 293291 transitions. Second operand 4 states. [2019-12-07 15:47:58,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:58,907 INFO L93 Difference]: Finished difference Result 93208 states and 287231 transitions. [2019-12-07 15:47:58,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:47:58,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-07 15:47:58,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:59,034 INFO L225 Difference]: With dead ends: 93208 [2019-12-07 15:47:59,034 INFO L226 Difference]: Without dead ends: 93208 [2019-12-07 15:47:59,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:47:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93208 states. [2019-12-07 15:48:00,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93208 to 93208. [2019-12-07 15:48:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93208 states. [2019-12-07 15:48:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93208 states to 93208 states and 287231 transitions. [2019-12-07 15:48:00,989 INFO L78 Accepts]: Start accepts. Automaton has 93208 states and 287231 transitions. Word has length 82 [2019-12-07 15:48:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:00,989 INFO L462 AbstractCegarLoop]: Abstraction has 93208 states and 287231 transitions. [2019-12-07 15:48:00,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:48:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 93208 states and 287231 transitions. [2019-12-07 15:48:01,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 15:48:01,084 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:01,085 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:01,085 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 15:48:01,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:01,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1659816432, now seen corresponding path program 1 times [2019-12-07 15:48:01,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:01,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818939118] [2019-12-07 15:48:01,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:01,150 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 15:48:01,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818939118] [2019-12-07 15:48:01,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:01,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:48:01,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236769060] [2019-12-07 15:48:01,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:48:01,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:01,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:48:01,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:48:01,152 INFO L87 Difference]: Start difference. First operand 93208 states and 287231 transitions. Second operand 5 states. [2019-12-07 15:48:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:01,763 INFO L93 Difference]: Finished difference Result 105019 states and 321091 transitions. [2019-12-07 15:48:01,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:48:01,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-12-07 15:48:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:01,919 INFO L225 Difference]: With dead ends: 105019 [2019-12-07 15:48:01,919 INFO L226 Difference]: Without dead ends: 105019 [2019-12-07 15:48:01,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:48:02,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105019 states. [2019-12-07 15:48:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105019 to 100091. [2019-12-07 15:48:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100091 states. [2019-12-07 15:48:04,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100091 states to 100091 states and 307367 transitions. [2019-12-07 15:48:04,191 INFO L78 Accepts]: Start accepts. Automaton has 100091 states and 307367 transitions. Word has length 83 [2019-12-07 15:48:04,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:04,192 INFO L462 AbstractCegarLoop]: Abstraction has 100091 states and 307367 transitions. [2019-12-07 15:48:04,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:48:04,192 INFO L276 IsEmpty]: Start isEmpty. Operand 100091 states and 307367 transitions. [2019-12-07 15:48:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 15:48:04,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:04,305 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:04,305 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 15:48:04,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:04,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1345105594, now seen corresponding path program 2 times [2019-12-07 15:48:04,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:04,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510244933] [2019-12-07 15:48:04,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:04,521 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 15:48:04,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510244933] [2019-12-07 15:48:04,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:04,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 15:48:04,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628949572] [2019-12-07 15:48:04,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 15:48:04,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:04,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 15:48:04,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:48:04,522 INFO L87 Difference]: Start difference. First operand 100091 states and 307367 transitions. Second operand 12 states. [2019-12-07 15:48:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:10,623 INFO L93 Difference]: Finished difference Result 257781 states and 779603 transitions. [2019-12-07 15:48:10,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-07 15:48:10,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2019-12-07 15:48:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:11,025 INFO L225 Difference]: With dead ends: 257781 [2019-12-07 15:48:11,025 INFO L226 Difference]: Without dead ends: 257781 [2019-12-07 15:48:11,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=501, Invalid=2361, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 15:48:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257781 states. [2019-12-07 15:48:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257781 to 163350. [2019-12-07 15:48:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163350 states. [2019-12-07 15:48:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163350 states to 163350 states and 501584 transitions. [2019-12-07 15:48:15,516 INFO L78 Accepts]: Start accepts. Automaton has 163350 states and 501584 transitions. Word has length 83 [2019-12-07 15:48:15,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:15,516 INFO L462 AbstractCegarLoop]: Abstraction has 163350 states and 501584 transitions. [2019-12-07 15:48:15,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 15:48:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 163350 states and 501584 transitions. [2019-12-07 15:48:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 15:48:15,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:15,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:48:15,715 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 15:48:15,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:15,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2100847430, now seen corresponding path program 3 times [2019-12-07 15:48:15,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:15,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096659132] [2019-12-07 15:48:15,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:15,764 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 15:48:15,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096659132] [2019-12-07 15:48:15,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:15,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:48:15,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227137629] [2019-12-07 15:48:15,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:15,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:15,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:15,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:15,766 INFO L87 Difference]: Start difference. First operand 163350 states and 501584 transitions. Second operand 3 states. [2019-12-07 15:48:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:16,186 INFO L93 Difference]: Finished difference Result 163350 states and 501583 transitions. [2019-12-07 15:48:16,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:16,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 15:48:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:16,421 INFO L225 Difference]: With dead ends: 163350 [2019-12-07 15:48:16,421 INFO L226 Difference]: Without dead ends: 163350 [2019-12-07 15:48:16,421 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 15:48:17,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163350 states. [2019-12-07 15:48:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163350 to 116417. [2019-12-07 15:48:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116417 states. [2019-12-07 15:48:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116417 states to 116417 states and 359624 transitions. [2019-12-07 15:48:19,345 INFO L78 Accepts]: Start accepts. Automaton has 116417 states and 359624 transitions. Word has length 83 [2019-12-07 15:48:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:19,346 INFO L462 AbstractCegarLoop]: Abstraction has 116417 states and 359624 transitions. [2019-12-07 15:48:19,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:19,346 INFO L276 IsEmpty]: Start isEmpty. Operand 116417 states and 359624 transitions. [2019-12-07 15:48:19,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 15:48:19,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:19,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:19,485 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 15:48:19,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:19,486 INFO L82 PathProgramCache]: Analyzing trace with hash -794092098, now seen corresponding path program 1 times [2019-12-07 15:48:19,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:19,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740932583] [2019-12-07 15:48:19,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:19,713 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 15:48:19,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740932583] [2019-12-07 15:48:19,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:19,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 15:48:19,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481955348] [2019-12-07 15:48:19,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 15:48:19,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:19,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 15:48:19,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:48:19,714 INFO L87 Difference]: Start difference. First operand 116417 states and 359624 transitions. Second operand 9 states. [2019-12-07 15:48:21,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:21,324 INFO L93 Difference]: Finished difference Result 258625 states and 797058 transitions. [2019-12-07 15:48:21,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 15:48:21,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-12-07 15:48:21,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:21,710 INFO L225 Difference]: With dead ends: 258625 [2019-12-07 15:48:21,710 INFO L226 Difference]: Without dead ends: 243474 [2019-12-07 15:48:21,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-12-07 15:48:23,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243474 states. [2019-12-07 15:48:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243474 to 174009. [2019-12-07 15:48:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174009 states. [2019-12-07 15:48:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174009 states to 174009 states and 540559 transitions. [2019-12-07 15:48:26,093 INFO L78 Accepts]: Start accepts. Automaton has 174009 states and 540559 transitions. Word has length 84 [2019-12-07 15:48:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:26,093 INFO L462 AbstractCegarLoop]: Abstraction has 174009 states and 540559 transitions. [2019-12-07 15:48:26,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 15:48:26,093 INFO L276 IsEmpty]: Start isEmpty. Operand 174009 states and 540559 transitions. [2019-12-07 15:48:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 15:48:26,314 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:26,314 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:26,315 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 15:48:26,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:26,315 INFO L82 PathProgramCache]: Analyzing trace with hash -322677456, now seen corresponding path program 2 times [2019-12-07 15:48:26,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:26,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35042706] [2019-12-07 15:48:26,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:26,462 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 15:48:26,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35042706] [2019-12-07 15:48:26,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:26,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 15:48:26,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075708796] [2019-12-07 15:48:26,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 15:48:26,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:26,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 15:48:26,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:48:26,464 INFO L87 Difference]: Start difference. First operand 174009 states and 540559 transitions. Second operand 10 states. [2019-12-07 15:48:28,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:28,318 INFO L93 Difference]: Finished difference Result 293333 states and 911514 transitions. [2019-12-07 15:48:28,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 15:48:28,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-12-07 15:48:28,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:28,347 INFO L225 Difference]: With dead ends: 293333 [2019-12-07 15:48:28,348 INFO L226 Difference]: Without dead ends: 24997 [2019-12-07 15:48:28,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-12-07 15:48:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24997 states. [2019-12-07 15:48:28,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24997 to 23669. [2019-12-07 15:48:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23669 states. [2019-12-07 15:48:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23669 states to 23669 states and 67422 transitions. [2019-12-07 15:48:28,686 INFO L78 Accepts]: Start accepts. Automaton has 23669 states and 67422 transitions. Word has length 84 [2019-12-07 15:48:28,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:28,687 INFO L462 AbstractCegarLoop]: Abstraction has 23669 states and 67422 transitions. [2019-12-07 15:48:28,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 15:48:28,687 INFO L276 IsEmpty]: Start isEmpty. Operand 23669 states and 67422 transitions. [2019-12-07 15:48:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 15:48:28,707 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:28,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:28,707 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 15:48:28,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:28,707 INFO L82 PathProgramCache]: Analyzing trace with hash -161042748, now seen corresponding path program 3 times [2019-12-07 15:48:28,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:28,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677521725] [2019-12-07 15:48:28,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:28,775 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 15:48:28,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677521725] [2019-12-07 15:48:28,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:28,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:28,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655274747] [2019-12-07 15:48:28,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:48:28,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:28,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:48:28,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:48:28,777 INFO L87 Difference]: Start difference. First operand 23669 states and 67422 transitions. Second operand 4 states. [2019-12-07 15:48:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:28,866 INFO L93 Difference]: Finished difference Result 33358 states and 96571 transitions. [2019-12-07 15:48:28,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:48:28,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-07 15:48:28,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:28,899 INFO L225 Difference]: With dead ends: 33358 [2019-12-07 15:48:28,899 INFO L226 Difference]: Without dead ends: 28569 [2019-12-07 15:48:28,899 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 15:48:29,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28569 states. [2019-12-07 15:48:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28569 to 20884. [2019-12-07 15:48:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20884 states. [2019-12-07 15:48:29,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20884 states to 20884 states and 61256 transitions. [2019-12-07 15:48:29,243 INFO L78 Accepts]: Start accepts. Automaton has 20884 states and 61256 transitions. Word has length 84 [2019-12-07 15:48:29,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:29,243 INFO L462 AbstractCegarLoop]: Abstraction has 20884 states and 61256 transitions. [2019-12-07 15:48:29,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:48:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand 20884 states and 61256 transitions. [2019-12-07 15:48:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 15:48:29,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:29,260 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:29,260 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 15:48:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:29,260 INFO L82 PathProgramCache]: Analyzing trace with hash -475759864, now seen corresponding path program 4 times [2019-12-07 15:48:29,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:29,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361268139] [2019-12-07 15:48:29,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:29,366 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 15:48:29,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361268139] [2019-12-07 15:48:29,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:29,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:48:29,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324316545] [2019-12-07 15:48:29,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:48:29,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:29,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:48:29,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:48:29,368 INFO L87 Difference]: Start difference. First operand 20884 states and 61256 transitions. Second operand 7 states. [2019-12-07 15:48:29,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:29,565 INFO L93 Difference]: Finished difference Result 40074 states and 118074 transitions. [2019-12-07 15:48:29,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:48:29,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-12-07 15:48:29,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:29,597 INFO L225 Difference]: With dead ends: 40074 [2019-12-07 15:48:29,597 INFO L226 Difference]: Without dead ends: 29035 [2019-12-07 15:48:29,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:48:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29035 states. [2019-12-07 15:48:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29035 to 20947. [2019-12-07 15:48:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20947 states. [2019-12-07 15:48:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20947 states to 20947 states and 61366 transitions. [2019-12-07 15:48:29,973 INFO L78 Accepts]: Start accepts. Automaton has 20947 states and 61366 transitions. Word has length 84 [2019-12-07 15:48:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:29,973 INFO L462 AbstractCegarLoop]: Abstraction has 20947 states and 61366 transitions. [2019-12-07 15:48:29,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:48:29,973 INFO L276 IsEmpty]: Start isEmpty. Operand 20947 states and 61366 transitions. [2019-12-07 15:48:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 15:48:29,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:29,989 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:29,989 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 15:48:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1293841268, now seen corresponding path program 1 times [2019-12-07 15:48:29,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:29,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952480462] [2019-12-07 15:48:29,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:30,079 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 15:48:30,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952480462] [2019-12-07 15:48:30,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:30,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 15:48:30,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271259790] [2019-12-07 15:48:30,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 15:48:30,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:30,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 15:48:30,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:48:30,080 INFO L87 Difference]: Start difference. First operand 20947 states and 61366 transitions. Second operand 8 states. [2019-12-07 15:48:30,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:30,518 INFO L93 Difference]: Finished difference Result 57245 states and 167176 transitions. [2019-12-07 15:48:30,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 15:48:30,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-12-07 15:48:30,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:30,568 INFO L225 Difference]: With dead ends: 57245 [2019-12-07 15:48:30,568 INFO L226 Difference]: Without dead ends: 46605 [2019-12-07 15:48:30,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-07 15:48:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46605 states. [2019-12-07 15:48:31,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46605 to 25518. [2019-12-07 15:48:31,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25518 states. [2019-12-07 15:48:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25518 states to 25518 states and 74805 transitions. [2019-12-07 15:48:31,084 INFO L78 Accepts]: Start accepts. Automaton has 25518 states and 74805 transitions. Word has length 85 [2019-12-07 15:48:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:31,084 INFO L462 AbstractCegarLoop]: Abstraction has 25518 states and 74805 transitions. [2019-12-07 15:48:31,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 15:48:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 25518 states and 74805 transitions. [2019-12-07 15:48:31,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 15:48:31,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:31,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:31,108 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 15:48:31,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:31,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1557957342, now seen corresponding path program 2 times [2019-12-07 15:48:31,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:31,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959795666] [2019-12-07 15:48:31,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:31,183 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 15:48:31,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959795666] [2019-12-07 15:48:31,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:31,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:48:31,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921257105] [2019-12-07 15:48:31,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:48:31,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:31,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:48:31,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:48:31,184 INFO L87 Difference]: Start difference. First operand 25518 states and 74805 transitions. Second operand 5 states. [2019-12-07 15:48:31,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:31,277 INFO L93 Difference]: Finished difference Result 36643 states and 108236 transitions. [2019-12-07 15:48:31,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:48:31,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-12-07 15:48:31,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:31,290 INFO L225 Difference]: With dead ends: 36643 [2019-12-07 15:48:31,290 INFO L226 Difference]: Without dead ends: 12292 [2019-12-07 15:48:31,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:48:31,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12292 states. [2019-12-07 15:48:31,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12292 to 12292. [2019-12-07 15:48:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12292 states. [2019-12-07 15:48:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12292 states to 12292 states and 36544 transitions. [2019-12-07 15:48:31,469 INFO L78 Accepts]: Start accepts. Automaton has 12292 states and 36544 transitions. Word has length 85 [2019-12-07 15:48:31,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:31,469 INFO L462 AbstractCegarLoop]: Abstraction has 12292 states and 36544 transitions. [2019-12-07 15:48:31,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:48:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 12292 states and 36544 transitions. [2019-12-07 15:48:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 15:48:31,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:31,480 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:31,480 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 15:48:31,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:31,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1547855032, now seen corresponding path program 3 times [2019-12-07 15:48:31,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:31,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303258484] [2019-12-07 15:48:31,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:31,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:31,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303258484] [2019-12-07 15:48:31,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:31,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 15:48:31,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553013417] [2019-12-07 15:48:31,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 15:48:31,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:31,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 15:48:31,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-07 15:48:31,880 INFO L87 Difference]: Start difference. First operand 12292 states and 36544 transitions. Second operand 17 states. [2019-12-07 15:48:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:36,295 INFO L93 Difference]: Finished difference Result 24602 states and 71640 transitions. [2019-12-07 15:48:36,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-07 15:48:36,296 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-12-07 15:48:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:36,327 INFO L225 Difference]: With dead ends: 24602 [2019-12-07 15:48:36,327 INFO L226 Difference]: Without dead ends: 18878 [2019-12-07 15:48:36,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=484, Invalid=3298, Unknown=0, NotChecked=0, Total=3782 [2019-12-07 15:48:36,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18878 states. [2019-12-07 15:48:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18878 to 12703. [2019-12-07 15:48:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12703 states. [2019-12-07 15:48:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12703 states to 12703 states and 37646 transitions. [2019-12-07 15:48:36,573 INFO L78 Accepts]: Start accepts. Automaton has 12703 states and 37646 transitions. Word has length 85 [2019-12-07 15:48:36,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:36,573 INFO L462 AbstractCegarLoop]: Abstraction has 12703 states and 37646 transitions. [2019-12-07 15:48:36,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 15:48:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand 12703 states and 37646 transitions. [2019-12-07 15:48:36,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 15:48:36,584 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:36,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:36,584 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 15:48:36,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:36,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1395365960, now seen corresponding path program 4 times [2019-12-07 15:48:36,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:36,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155591880] [2019-12-07 15:48:36,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:36,972 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 15:48:36,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155591880] [2019-12-07 15:48:36,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:36,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 15:48:36,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776650828] [2019-12-07 15:48:36,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 15:48:36,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:36,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 15:48:36,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-07 15:48:36,973 INFO L87 Difference]: Start difference. First operand 12703 states and 37646 transitions. Second operand 17 states. [2019-12-07 15:48:40,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:40,710 INFO L93 Difference]: Finished difference Result 26351 states and 76187 transitions. [2019-12-07 15:48:40,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-07 15:48:40,710 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-12-07 15:48:40,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:40,728 INFO L225 Difference]: With dead ends: 26351 [2019-12-07 15:48:40,729 INFO L226 Difference]: Without dead ends: 19465 [2019-12-07 15:48:40,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1762 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=703, Invalid=4997, Unknown=0, NotChecked=0, Total=5700 [2019-12-07 15:48:40,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19465 states. [2019-12-07 15:48:40,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19465 to 12709. [2019-12-07 15:48:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12709 states. [2019-12-07 15:48:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12709 states to 12709 states and 37654 transitions. [2019-12-07 15:48:40,959 INFO L78 Accepts]: Start accepts. Automaton has 12709 states and 37654 transitions. Word has length 85 [2019-12-07 15:48:40,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:40,959 INFO L462 AbstractCegarLoop]: Abstraction has 12709 states and 37654 transitions. [2019-12-07 15:48:40,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 15:48:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 12709 states and 37654 transitions. [2019-12-07 15:48:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 15:48:40,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:40,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:40,970 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 15:48:40,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:40,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1339358590, now seen corresponding path program 5 times [2019-12-07 15:48:40,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:40,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137806472] [2019-12-07 15:48:40,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:41,805 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 15:48:41,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137806472] [2019-12-07 15:48:41,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:41,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-07 15:48:41,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116258630] [2019-12-07 15:48:41,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 15:48:41,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:41,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 15:48:41,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2019-12-07 15:48:41,806 INFO L87 Difference]: Start difference. First operand 12709 states and 37654 transitions. Second operand 24 states. [2019-12-07 15:48:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:49,050 INFO L93 Difference]: Finished difference Result 21529 states and 62774 transitions. [2019-12-07 15:48:49,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-07 15:48:49,051 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-12-07 15:48:49,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:49,067 INFO L225 Difference]: With dead ends: 21529 [2019-12-07 15:48:49,067 INFO L226 Difference]: Without dead ends: 16573 [2019-12-07 15:48:49,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=569, Invalid=4981, Unknown=0, NotChecked=0, Total=5550 [2019-12-07 15:48:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16573 states. [2019-12-07 15:48:49,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16573 to 14229. [2019-12-07 15:48:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14229 states. [2019-12-07 15:48:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14229 states to 14229 states and 42036 transitions. [2019-12-07 15:48:49,292 INFO L78 Accepts]: Start accepts. Automaton has 14229 states and 42036 transitions. Word has length 85 [2019-12-07 15:48:49,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:49,293 INFO L462 AbstractCegarLoop]: Abstraction has 14229 states and 42036 transitions. [2019-12-07 15:48:49,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 15:48:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 14229 states and 42036 transitions. [2019-12-07 15:48:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 15:48:49,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:49,305 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:49,305 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 15:48:49,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:49,306 INFO L82 PathProgramCache]: Analyzing trace with hash 616017622, now seen corresponding path program 6 times [2019-12-07 15:48:49,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:49,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733684912] [2019-12-07 15:48:49,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:49,890 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 15:48:49,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733684912] [2019-12-07 15:48:49,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:49,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-07 15:48:49,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513895246] [2019-12-07 15:48:49,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 15:48:49,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:49,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 15:48:49,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2019-12-07 15:48:49,891 INFO L87 Difference]: Start difference. First operand 14229 states and 42036 transitions. Second operand 23 states. [2019-12-07 15:48:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:54,443 INFO L93 Difference]: Finished difference Result 21590 states and 62978 transitions. [2019-12-07 15:48:54,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-12-07 15:48:54,444 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2019-12-07 15:48:54,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:54,460 INFO L225 Difference]: With dead ends: 21590 [2019-12-07 15:48:54,460 INFO L226 Difference]: Without dead ends: 18350 [2019-12-07 15:48:54,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1846 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=665, Invalid=5977, Unknown=0, NotChecked=0, Total=6642 [2019-12-07 15:48:54,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18350 states. [2019-12-07 15:48:54,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18350 to 14190. [2019-12-07 15:48:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14190 states. [2019-12-07 15:48:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14190 states to 14190 states and 41912 transitions. [2019-12-07 15:48:54,693 INFO L78 Accepts]: Start accepts. Automaton has 14190 states and 41912 transitions. Word has length 85 [2019-12-07 15:48:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:54,694 INFO L462 AbstractCegarLoop]: Abstraction has 14190 states and 41912 transitions. [2019-12-07 15:48:54,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 15:48:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 14190 states and 41912 transitions. [2019-12-07 15:48:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 15:48:54,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:54,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:54,706 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 15:48:54,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:54,706 INFO L82 PathProgramCache]: Analyzing trace with hash -729736504, now seen corresponding path program 7 times [2019-12-07 15:48:54,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:54,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368896227] [2019-12-07 15:48:54,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:54,899 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 15:48:54,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368896227] [2019-12-07 15:48:54,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:54,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 15:48:54,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008078042] [2019-12-07 15:48:54,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 15:48:54,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:54,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 15:48:54,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:48:54,900 INFO L87 Difference]: Start difference. First operand 14190 states and 41912 transitions. Second operand 12 states. [2019-12-07 15:48:55,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:55,953 INFO L93 Difference]: Finished difference Result 31004 states and 90153 transitions. [2019-12-07 15:48:55,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 15:48:55,954 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2019-12-07 15:48:55,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:55,973 INFO L225 Difference]: With dead ends: 31004 [2019-12-07 15:48:55,973 INFO L226 Difference]: Without dead ends: 18816 [2019-12-07 15:48:55,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 15:48:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18816 states. [2019-12-07 15:48:56,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18816 to 12758. [2019-12-07 15:48:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12758 states. [2019-12-07 15:48:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12758 states to 12758 states and 37362 transitions. [2019-12-07 15:48:56,204 INFO L78 Accepts]: Start accepts. Automaton has 12758 states and 37362 transitions. Word has length 85 [2019-12-07 15:48:56,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:56,204 INFO L462 AbstractCegarLoop]: Abstraction has 12758 states and 37362 transitions. [2019-12-07 15:48:56,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 15:48:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 12758 states and 37362 transitions. [2019-12-07 15:48:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 15:48:56,215 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:56,216 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:56,216 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 15:48:56,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:56,216 INFO L82 PathProgramCache]: Analyzing trace with hash 240182222, now seen corresponding path program 8 times [2019-12-07 15:48:56,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:56,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921931395] [2019-12-07 15:48:56,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:48:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:48:56,382 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:48:56,383 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:48:56,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1192] [1192] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= v_~z$w_buff1~0_529 0) (= v_~z$w_buff1_used~0_944 0) (= 0 v_~z$r_buff1_thd3~0_436) (= v_~z$r_buff0_thd0~0_142 0) (= v_~z$r_buff1_thd1~0_325 0) (= v_~z$read_delayed_var~0.offset_6 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t20~0.base_25| 4) |v_#length_25|) (= v_~__unbuffered_p2_EBX~0_44 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= 0 v_~__unbuffered_p0_EAX~0_55) (= v_~y~0_42 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~z$r_buff0_thd3~0_512) (= v_~z$r_buff0_thd1~0_505 0) (= v_~__unbuffered_p1_EBX~0_42 0) (= v_~z$read_delayed~0_6 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$w_buff0~0_877 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t20~0.base_25|)) (= 0 v_~__unbuffered_p2_EAX~0_63) (= v_~main$tmp_guard1~0_39 0) (= v_~z$read_delayed_var~0.base_6 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t20~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t20~0.base_25|) |v_ULTIMATE.start_main_~#t20~0.offset_19| 0))) (= 0 v_~z$mem_tmp~0_195) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t20~0.base_25| 1)) (= v_~z$r_buff0_thd2~0_124 0) (= 0 v_~weak$$choice0~0_186) (= |v_ULTIMATE.start_main_~#t20~0.offset_19| 0) (= v_~__unbuffered_p0_EBX~0_42 0) (= v_~z$r_buff1_thd0~0_242 0) (= v_~z$r_buff1_thd2~0_209 0) (= v_~x~0_20 0) (= 0 v_~__unbuffered_cnt~0_73) (= |v_#NULL.offset_5| 0) (= 0 v_~z$flush_delayed~0_215) (= v_~z$w_buff0_used~0_1543 0) (= v_~weak$$choice2~0_273 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t20~0.base_25|) (= 0 |v_#NULL.base_5|) (= v_~z~0_319 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t22~0.offset=|v_ULTIMATE.start_main_~#t22~0.offset_20|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_209, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t22~0.base=|v_ULTIMATE.start_main_~#t22~0.base_27|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_279|, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_145|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_142, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_63, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_44, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_42, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_10|, ULTIMATE.start_main_~#t21~0.offset=|v_ULTIMATE.start_main_~#t21~0.offset_20|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_944, ~z$flush_delayed~0=v_~z$flush_delayed~0_215, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_81|, ~weak$$choice0~0=v_~weak$$choice0~0_186, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_325, ~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_512, ULTIMATE.start_main_~#t20~0.offset=|v_ULTIMATE.start_main_~#t20~0.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, ~x~0=v_~x~0_20, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_529, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t20~0.base=|v_ULTIMATE.start_main_~#t20~0.base_25|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_29|, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_175|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_89|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_242, ~y~0=v_~y~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_124, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_42, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1543, ~z$w_buff0~0=v_~z$w_buff0~0_877, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_436, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t21~0.base=|v_ULTIMATE.start_main_~#t21~0.base_27|, ~z~0=v_~z~0_319, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_505} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t22~0.offset, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t22~0.base, ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite71, ~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, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet68, ULTIMATE.start_main_~#t21~0.offset, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite75, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t20~0.offset, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t20~0.base, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite70, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet67, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t21~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 15:48:56,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] P0ENTRY-->L5-3: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_11 |v_P0Thread1of1ForFork2_#in~arg.base_13|) (= v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_13 |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|) (= v_~z$w_buff0_used~0_151 v_~z$w_buff1_used~0_94) (= (ite (not (and (not (= 0 (mod v_~z$w_buff1_used~0_94 256))) (not (= (mod v_~z$w_buff0_used~0_150 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_13| v_P0Thread1of1ForFork2_~arg.offset_11) (= v_~z$w_buff0_used~0_150 1) (= v_~z$w_buff0~0_43 v_~z$w_buff1~0_36) (not (= 0 v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_13)) (= 1 v_~z$w_buff0~0_42)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_151, ~z$w_buff0~0=v_~z$w_buff0~0_43, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_150, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_94, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_11, ~z$w_buff1~0=v_~z$w_buff1~0_36, P0Thread1of1ForFork2___VERIFIER_assert_~expression=v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_13, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_11, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2_~arg.offset, ~z$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:48:56,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L851-1-->L853: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t21~0.base_13| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t21~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t21~0.base_13|) |v_ULTIMATE.start_main_~#t21~0.offset_11| 1)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t21~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t21~0.base_13|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t21~0.base_13|) 0) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t21~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t21~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t21~0.offset=|v_ULTIMATE.start_main_~#t21~0.offset_11|, ULTIMATE.start_main_~#t21~0.base=|v_ULTIMATE.start_main_~#t21~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet67, #valid, #memory_int, ULTIMATE.start_main_~#t21~0.offset, ULTIMATE.start_main_~#t21~0.base, #length] because there is no mapped edge [2019-12-07 15:48:56,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1123] [1123] L754-2-->L754-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1305351063 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1305351063 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite5_Out-1305351063| ~z$w_buff1~0_In-1305351063) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork2_#t~ite5_Out-1305351063| ~z$w_buff0~0_In-1305351063) (not .cse1) (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1305351063, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1305351063, ~z$w_buff1~0=~z$w_buff1~0_In-1305351063, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1305351063} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-1305351063, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1305351063, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-1305351063|, ~z$w_buff1~0=~z$w_buff1~0_In-1305351063, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1305351063} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 15:48:56,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1080] [1080] L754-4-->L755: Formula: (= v_~z~0_71 |v_P0Thread1of1ForFork2_#t~ite5_6|) InVars {P0Thread1of1ForFork2_#t~ite5=|v_P0Thread1of1ForFork2_#t~ite5_6|} OutVars{P0Thread1of1ForFork2_#t~ite5=|v_P0Thread1of1ForFork2_#t~ite5_5|, P0Thread1of1ForFork2_#t~ite6=|v_P0Thread1of1ForFork2_#t~ite6_5|, ~z~0=v_~z~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5, P0Thread1of1ForFork2_#t~ite6, ~z~0] because there is no mapped edge [2019-12-07 15:48:56,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1160] [1160] L853-1-->L855: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t22~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t22~0.base_11|) |v_ULTIMATE.start_main_~#t22~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t22~0.base_11| 4)) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t22~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t22~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t22~0.base_11| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t22~0.base_11|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t22~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t22~0.offset=|v_ULTIMATE.start_main_~#t22~0.offset_10|, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_6|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t22~0.base=|v_ULTIMATE.start_main_~#t22~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t22~0.offset, ULTIMATE.start_main_#t~nondet68, #valid, #memory_int, #length, ULTIMATE.start_main_~#t22~0.base] because there is no mapped edge [2019-12-07 15:48:56,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1094] [1094] L759-->L760: Formula: (and (not (= (mod v_~weak$$choice2~0_78 256) 0)) (= v_~z$r_buff0_thd1~0_166 v_~z$r_buff0_thd1~0_165)) InVars {~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_166, ~weak$$choice2~0=v_~weak$$choice2~0_78} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_165, ~weak$$choice2~0=v_~weak$$choice2~0_78, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, P0Thread1of1ForFork2_#t~ite19, ~z$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 15:48:56,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1128] [1128] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-2045255575 256)))) (or (and (= ~z~0_In-2045255575 |P0Thread1of1ForFork2_#t~ite25_Out-2045255575|) .cse0) (and (= ~z$mem_tmp~0_In-2045255575 |P0Thread1of1ForFork2_#t~ite25_Out-2045255575|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-2045255575, ~z$flush_delayed~0=~z$flush_delayed~0_In-2045255575, ~z~0=~z~0_In-2045255575} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-2045255575, P0Thread1of1ForFork2_#t~ite25=|P0Thread1of1ForFork2_#t~ite25_Out-2045255575|, ~z$flush_delayed~0=~z$flush_delayed~0_In-2045255575, ~z~0=~z~0_In-2045255575} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 15:48:56,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1106] [1106] L792-2-->L792-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2022632250 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-2022632250 256) 0)) (.cse2 (= |P1Thread1of1ForFork0_#t~ite32_Out-2022632250| |P1Thread1of1ForFork0_#t~ite33_Out-2022632250|))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite32_Out-2022632250| ~z$w_buff1~0_In-2022632250) (not .cse1) .cse2) (and (= |P1Thread1of1ForFork0_#t~ite32_Out-2022632250| ~z~0_In-2022632250) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2022632250, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2022632250, ~z$w_buff1~0=~z$w_buff1~0_In-2022632250, ~z~0=~z~0_In-2022632250} OutVars{P1Thread1of1ForFork0_#t~ite32=|P1Thread1of1ForFork0_#t~ite32_Out-2022632250|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2022632250, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2022632250, ~z$w_buff1~0=~z$w_buff1~0_In-2022632250, P1Thread1of1ForFork0_#t~ite33=|P1Thread1of1ForFork0_#t~ite33_Out-2022632250|, ~z~0=~z~0_In-2022632250} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite32, P1Thread1of1ForFork0_#t~ite33] because there is no mapped edge [2019-12-07 15:48:56,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1138] [1138] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In246990847 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In246990847 256)))) (or (and (= ~z$w_buff0_used~0_In246990847 |P0Thread1of1ForFork2_#t~ite28_Out246990847|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork2_#t~ite28_Out246990847|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In246990847, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In246990847} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In246990847, P0Thread1of1ForFork2_#t~ite28=|P0Thread1of1ForFork2_#t~ite28_Out246990847|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In246990847} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 15:48:56,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1114] [1114] L793-->L793-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-229746598 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-229746598 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite34_Out-229746598| ~z$w_buff0_used~0_In-229746598) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite34_Out-229746598|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-229746598, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-229746598} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-229746598, P1Thread1of1ForFork0_#t~ite34=|P1Thread1of1ForFork0_#t~ite34_Out-229746598|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-229746598} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 15:48:56,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1107] [1107] L794-->L794-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd2~0_In1121573542 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1121573542 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1121573542 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1121573542 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1121573542 |P1Thread1of1ForFork0_#t~ite35_Out1121573542|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite35_Out1121573542| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1121573542, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1121573542, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1121573542, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1121573542} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1121573542, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1121573542, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1121573542, P1Thread1of1ForFork0_#t~ite35=|P1Thread1of1ForFork0_#t~ite35_Out1121573542|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1121573542} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 15:48:56,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1126] [1126] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In239063337 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In239063337 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite36_Out239063337|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite36_Out239063337| ~z$r_buff0_thd2~0_In239063337)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In239063337, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In239063337} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In239063337, P1Thread1of1ForFork0_#t~ite36=|P1Thread1of1ForFork0_#t~ite36_Out239063337|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In239063337} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 15:48:56,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1139] [1139] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1138821736 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1138821736 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1138821736 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1138821736 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite29_Out-1138821736| ~z$w_buff1_used~0_In-1138821736)) (and (= |P0Thread1of1ForFork2_#t~ite29_Out-1138821736| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1138821736, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1138821736, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1138821736, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1138821736} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1138821736, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1138821736, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1138821736, P0Thread1of1ForFork2_#t~ite29=|P0Thread1of1ForFork2_#t~ite29_Out-1138821736|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1138821736} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 15:48:56,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1116] [1116] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In2958769 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In2958769 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2958769 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In2958769 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite37_Out2958769| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite37_Out2958769| ~z$r_buff1_thd2~0_In2958769) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2958769, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2958769, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2958769, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2958769} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2958769, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2958769, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2958769, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2958769, P1Thread1of1ForFork0_#t~ite37=|P1Thread1of1ForFork0_#t~ite37_Out2958769|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 15:48:56,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1143] [1143] L796-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= |v_P1Thread1of1ForFork0_#t~ite37_26| v_~z$r_buff1_thd2~0_68) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork0_#t~ite37=|v_P1Thread1of1ForFork0_#t~ite37_26|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, P1Thread1of1ForFork0_#t~ite37=|v_P1Thread1of1ForFork0_#t~ite37_25|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, P1Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 15:48:56,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1112] [1112] L772-->L773: Formula: (let ((.cse0 (= ~z$r_buff0_thd1~0_In-1711730 ~z$r_buff0_thd1~0_Out-1711730)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-1711730 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1711730 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-1711730)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1711730, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1711730} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1711730, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1711730, P0Thread1of1ForFork2_#t~ite30=|P0Thread1of1ForFork2_#t~ite30_Out-1711730|} AuxVars[] AssignedVars[~z$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 15:48:56,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1140] [1140] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In194095548 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In194095548 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In194095548 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In194095548 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite31_Out194095548| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In194095548 |P0Thread1of1ForFork2_#t~ite31_Out194095548|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In194095548, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In194095548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In194095548, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In194095548} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In194095548, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In194095548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In194095548, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In194095548, P0Thread1of1ForFork2_#t~ite31=|P0Thread1of1ForFork2_#t~ite31_Out194095548|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 15:48:56,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L773-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~z$r_buff1_thd1~0_269 |v_P0Thread1of1ForFork2_#t~ite31_30|) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P0Thread1of1ForFork2_#t~ite31=|v_P0Thread1of1ForFork2_#t~ite31_30|} OutVars{~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_269, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, P0Thread1of1ForFork2_#t~ite31=|v_P0Thread1of1ForFork2_#t~ite31_29|} AuxVars[] AssignedVars[~z$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 15:48:56,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1110] [1110] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1947991489 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite60_Out1947991489| ~z$mem_tmp~0_In1947991489) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite60_Out1947991489| ~z~0_In1947991489) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1947991489, ~z$flush_delayed~0=~z$flush_delayed~0_In1947991489, ~z~0=~z~0_In1947991489} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1947991489, P2Thread1of1ForFork1_#t~ite60=|P2Thread1of1ForFork1_#t~ite60_Out1947991489|, ~z$flush_delayed~0=~z$flush_delayed~0_In1947991489, ~z~0=~z~0_In1947991489} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 15:48:56,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1120] [1120] L828-2-->L828-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In61612233 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In61612233 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite61_Out61612233| ~z$w_buff1~0_In61612233)) (and (= ~z~0_In61612233 |P2Thread1of1ForFork1_#t~ite61_Out61612233|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In61612233, ~z$w_buff1_used~0=~z$w_buff1_used~0_In61612233, ~z$w_buff1~0=~z$w_buff1~0_In61612233, ~z~0=~z~0_In61612233} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In61612233, ~z$w_buff1_used~0=~z$w_buff1_used~0_In61612233, ~z$w_buff1~0=~z$w_buff1~0_In61612233, P2Thread1of1ForFork1_#t~ite61=|P2Thread1of1ForFork1_#t~ite61_Out61612233|, ~z~0=~z~0_In61612233} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite61] because there is no mapped edge [2019-12-07 15:48:56,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1099] [1099] L828-4-->L829: Formula: (= v_~z~0_114 |v_P2Thread1of1ForFork1_#t~ite61_6|) InVars {P2Thread1of1ForFork1_#t~ite61=|v_P2Thread1of1ForFork1_#t~ite61_6|} OutVars{P2Thread1of1ForFork1_#t~ite62=|v_P2Thread1of1ForFork1_#t~ite62_5|, ~z~0=v_~z~0_114, P2Thread1of1ForFork1_#t~ite61=|v_P2Thread1of1ForFork1_#t~ite61_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite62, ~z~0, P2Thread1of1ForFork1_#t~ite61] because there is no mapped edge [2019-12-07 15:48:56,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1111] [1111] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In10663709 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In10663709 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite63_Out10663709| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite63_Out10663709| ~z$w_buff0_used~0_In10663709)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In10663709, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In10663709} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In10663709, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In10663709, P2Thread1of1ForFork1_#t~ite63=|P2Thread1of1ForFork1_#t~ite63_Out10663709|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite63] because there is no mapped edge [2019-12-07 15:48:56,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1108] [1108] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In598480417 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In598480417 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In598480417 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In598480417 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In598480417 |P2Thread1of1ForFork1_#t~ite64_Out598480417|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite64_Out598480417|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In598480417, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In598480417, ~z$w_buff1_used~0=~z$w_buff1_used~0_In598480417, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In598480417} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In598480417, P2Thread1of1ForFork1_#t~ite64=|P2Thread1of1ForFork1_#t~ite64_Out598480417|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In598480417, ~z$w_buff1_used~0=~z$w_buff1_used~0_In598480417, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In598480417} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite64] because there is no mapped edge [2019-12-07 15:48:56,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1141] [1141] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-670749495 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-670749495 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite65_Out-670749495| ~z$r_buff0_thd3~0_In-670749495) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite65_Out-670749495| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-670749495, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-670749495} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-670749495, P2Thread1of1ForFork1_#t~ite65=|P2Thread1of1ForFork1_#t~ite65_Out-670749495|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-670749495} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite65] because there is no mapped edge [2019-12-07 15:48:56,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1130] [1130] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In253474579 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In253474579 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In253474579 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In253474579 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite66_Out253474579| ~z$r_buff1_thd3~0_In253474579) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite66_Out253474579| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In253474579, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In253474579, ~z$w_buff1_used~0=~z$w_buff1_used~0_In253474579, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In253474579} OutVars{P2Thread1of1ForFork1_#t~ite66=|P2Thread1of1ForFork1_#t~ite66_Out253474579|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In253474579, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In253474579, ~z$w_buff1_used~0=~z$w_buff1_used~0_In253474579, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In253474579} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite66] because there is no mapped edge [2019-12-07 15:48:56,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1155] [1155] L832-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~z$r_buff1_thd3~0_165 |v_P2Thread1of1ForFork1_#t~ite66_22|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite66=|v_P2Thread1of1ForFork1_#t~ite66_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork1_#t~ite66=|v_P2Thread1of1ForFork1_#t~ite66_21|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_165, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite66, P2Thread1of1ForFork1_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 15:48:56,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1079] [1079] L855-1-->L861: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_21) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet69, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 15:48:56,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1135] [1135] L861-2-->L861-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1574750392 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1574750392 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite70_Out1574750392| |ULTIMATE.start_main_#t~ite71_Out1574750392|))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite70_Out1574750392| ~z$w_buff1~0_In1574750392)) (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite70_Out1574750392| ~z~0_In1574750392)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1574750392, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1574750392, ~z$w_buff1~0=~z$w_buff1~0_In1574750392, ~z~0=~z~0_In1574750392} OutVars{ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out1574750392|, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out1574750392|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1574750392, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1574750392, ~z$w_buff1~0=~z$w_buff1~0_In1574750392, ~z~0=~z~0_In1574750392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite70] because there is no mapped edge [2019-12-07 15:48:56,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1129] [1129] L862-->L862-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1764497079 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1764497079 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1764497079 |ULTIMATE.start_main_#t~ite72_Out-1764497079|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite72_Out-1764497079| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1764497079, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1764497079} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1764497079, ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out-1764497079|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1764497079} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite72] because there is no mapped edge [2019-12-07 15:48:56,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1117] [1117] L863-->L863-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-298744234 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-298744234 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-298744234 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-298744234 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite73_Out-298744234|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-298744234 |ULTIMATE.start_main_#t~ite73_Out-298744234|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-298744234, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-298744234, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-298744234, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-298744234} OutVars{ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out-298744234|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-298744234, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-298744234, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-298744234, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-298744234} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73] because there is no mapped edge [2019-12-07 15:48:56,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1127] [1127] L864-->L864-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1046853714 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1046853714 256)))) (or (and (= ~z$r_buff0_thd0~0_In-1046853714 |ULTIMATE.start_main_#t~ite74_Out-1046853714|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite74_Out-1046853714|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1046853714, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1046853714} OutVars{ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out-1046853714|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1046853714, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1046853714} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite74] because there is no mapped edge [2019-12-07 15:48:56,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1119] [1119] L865-->L865-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1945406646 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1945406646 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1945406646 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1945406646 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite75_Out1945406646| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In1945406646 |ULTIMATE.start_main_#t~ite75_Out1945406646|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1945406646, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1945406646, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1945406646, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1945406646} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1945406646, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1945406646, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1945406646, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1945406646, ULTIMATE.start_main_#t~ite75=|ULTIMATE.start_main_#t~ite75_Out1945406646|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite75] because there is no mapped edge [2019-12-07 15:48:56,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1177] [1177] L865-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_17|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_17| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_24) (= 1 v_~__unbuffered_p2_EAX~0_47) (= v_~__unbuffered_p0_EBX~0_26 0) (= v_~__unbuffered_p2_EBX~0_28 0) (= 1 v_~__unbuffered_p0_EAX~0_33) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0)) 0 1)) (= v_~z$r_buff1_thd0~0_213 |v_ULTIMATE.start_main_#t~ite75_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_33, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_51|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_33, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_213, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_50|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_17|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite75, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:48:56,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:48:56 BasicIcfg [2019-12-07 15:48:56,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:48:56,481 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:48:56,481 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:48:56,482 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:48:56,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:42:19" (3/4) ... [2019-12-07 15:48:56,483 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 15:48:56,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1192] [1192] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= v_~z$w_buff1~0_529 0) (= v_~z$w_buff1_used~0_944 0) (= 0 v_~z$r_buff1_thd3~0_436) (= v_~z$r_buff0_thd0~0_142 0) (= v_~z$r_buff1_thd1~0_325 0) (= v_~z$read_delayed_var~0.offset_6 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t20~0.base_25| 4) |v_#length_25|) (= v_~__unbuffered_p2_EBX~0_44 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= 0 v_~__unbuffered_p0_EAX~0_55) (= v_~y~0_42 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~z$r_buff0_thd3~0_512) (= v_~z$r_buff0_thd1~0_505 0) (= v_~__unbuffered_p1_EBX~0_42 0) (= v_~z$read_delayed~0_6 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$w_buff0~0_877 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t20~0.base_25|)) (= 0 v_~__unbuffered_p2_EAX~0_63) (= v_~main$tmp_guard1~0_39 0) (= v_~z$read_delayed_var~0.base_6 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t20~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t20~0.base_25|) |v_ULTIMATE.start_main_~#t20~0.offset_19| 0))) (= 0 v_~z$mem_tmp~0_195) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t20~0.base_25| 1)) (= v_~z$r_buff0_thd2~0_124 0) (= 0 v_~weak$$choice0~0_186) (= |v_ULTIMATE.start_main_~#t20~0.offset_19| 0) (= v_~__unbuffered_p0_EBX~0_42 0) (= v_~z$r_buff1_thd0~0_242 0) (= v_~z$r_buff1_thd2~0_209 0) (= v_~x~0_20 0) (= 0 v_~__unbuffered_cnt~0_73) (= |v_#NULL.offset_5| 0) (= 0 v_~z$flush_delayed~0_215) (= v_~z$w_buff0_used~0_1543 0) (= v_~weak$$choice2~0_273 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t20~0.base_25|) (= 0 |v_#NULL.base_5|) (= v_~z~0_319 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t22~0.offset=|v_ULTIMATE.start_main_~#t22~0.offset_20|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_209, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t22~0.base=|v_ULTIMATE.start_main_~#t22~0.base_27|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_279|, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_145|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_142, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_63, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_44, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_42, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_10|, ULTIMATE.start_main_~#t21~0.offset=|v_ULTIMATE.start_main_~#t21~0.offset_20|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_944, ~z$flush_delayed~0=v_~z$flush_delayed~0_215, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_81|, ~weak$$choice0~0=v_~weak$$choice0~0_186, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_325, ~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_512, ULTIMATE.start_main_~#t20~0.offset=|v_ULTIMATE.start_main_~#t20~0.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, ~x~0=v_~x~0_20, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_529, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t20~0.base=|v_ULTIMATE.start_main_~#t20~0.base_25|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_29|, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_175|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_89|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_242, ~y~0=v_~y~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_124, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_42, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1543, ~z$w_buff0~0=v_~z$w_buff0~0_877, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_436, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t21~0.base=|v_ULTIMATE.start_main_~#t21~0.base_27|, ~z~0=v_~z~0_319, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_505} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t22~0.offset, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t22~0.base, ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite71, ~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, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet68, ULTIMATE.start_main_~#t21~0.offset, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite75, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t20~0.offset, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t20~0.base, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite70, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet67, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t21~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 15:48:56,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] P0ENTRY-->L5-3: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_11 |v_P0Thread1of1ForFork2_#in~arg.base_13|) (= v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_13 |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|) (= v_~z$w_buff0_used~0_151 v_~z$w_buff1_used~0_94) (= (ite (not (and (not (= 0 (mod v_~z$w_buff1_used~0_94 256))) (not (= (mod v_~z$w_buff0_used~0_150 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_13| v_P0Thread1of1ForFork2_~arg.offset_11) (= v_~z$w_buff0_used~0_150 1) (= v_~z$w_buff0~0_43 v_~z$w_buff1~0_36) (not (= 0 v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_13)) (= 1 v_~z$w_buff0~0_42)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_151, ~z$w_buff0~0=v_~z$w_buff0~0_43, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_150, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_94, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_11, ~z$w_buff1~0=v_~z$w_buff1~0_36, P0Thread1of1ForFork2___VERIFIER_assert_~expression=v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_13, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_11, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2_~arg.offset, ~z$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:48:56,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L851-1-->L853: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t21~0.base_13| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t21~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t21~0.base_13|) |v_ULTIMATE.start_main_~#t21~0.offset_11| 1)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t21~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t21~0.base_13|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t21~0.base_13|) 0) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t21~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t21~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t21~0.offset=|v_ULTIMATE.start_main_~#t21~0.offset_11|, ULTIMATE.start_main_~#t21~0.base=|v_ULTIMATE.start_main_~#t21~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet67, #valid, #memory_int, ULTIMATE.start_main_~#t21~0.offset, ULTIMATE.start_main_~#t21~0.base, #length] because there is no mapped edge [2019-12-07 15:48:56,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1123] [1123] L754-2-->L754-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1305351063 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1305351063 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite5_Out-1305351063| ~z$w_buff1~0_In-1305351063) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork2_#t~ite5_Out-1305351063| ~z$w_buff0~0_In-1305351063) (not .cse1) (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1305351063, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1305351063, ~z$w_buff1~0=~z$w_buff1~0_In-1305351063, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1305351063} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-1305351063, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1305351063, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-1305351063|, ~z$w_buff1~0=~z$w_buff1~0_In-1305351063, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1305351063} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 15:48:56,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1080] [1080] L754-4-->L755: Formula: (= v_~z~0_71 |v_P0Thread1of1ForFork2_#t~ite5_6|) InVars {P0Thread1of1ForFork2_#t~ite5=|v_P0Thread1of1ForFork2_#t~ite5_6|} OutVars{P0Thread1of1ForFork2_#t~ite5=|v_P0Thread1of1ForFork2_#t~ite5_5|, P0Thread1of1ForFork2_#t~ite6=|v_P0Thread1of1ForFork2_#t~ite6_5|, ~z~0=v_~z~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5, P0Thread1of1ForFork2_#t~ite6, ~z~0] because there is no mapped edge [2019-12-07 15:48:56,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1160] [1160] L853-1-->L855: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t22~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t22~0.base_11|) |v_ULTIMATE.start_main_~#t22~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t22~0.base_11| 4)) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t22~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t22~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t22~0.base_11| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t22~0.base_11|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t22~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t22~0.offset=|v_ULTIMATE.start_main_~#t22~0.offset_10|, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_6|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t22~0.base=|v_ULTIMATE.start_main_~#t22~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t22~0.offset, ULTIMATE.start_main_#t~nondet68, #valid, #memory_int, #length, ULTIMATE.start_main_~#t22~0.base] because there is no mapped edge [2019-12-07 15:48:56,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1094] [1094] L759-->L760: Formula: (and (not (= (mod v_~weak$$choice2~0_78 256) 0)) (= v_~z$r_buff0_thd1~0_166 v_~z$r_buff0_thd1~0_165)) InVars {~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_166, ~weak$$choice2~0=v_~weak$$choice2~0_78} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_165, ~weak$$choice2~0=v_~weak$$choice2~0_78, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, P0Thread1of1ForFork2_#t~ite19, ~z$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 15:48:56,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1128] [1128] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-2045255575 256)))) (or (and (= ~z~0_In-2045255575 |P0Thread1of1ForFork2_#t~ite25_Out-2045255575|) .cse0) (and (= ~z$mem_tmp~0_In-2045255575 |P0Thread1of1ForFork2_#t~ite25_Out-2045255575|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-2045255575, ~z$flush_delayed~0=~z$flush_delayed~0_In-2045255575, ~z~0=~z~0_In-2045255575} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-2045255575, P0Thread1of1ForFork2_#t~ite25=|P0Thread1of1ForFork2_#t~ite25_Out-2045255575|, ~z$flush_delayed~0=~z$flush_delayed~0_In-2045255575, ~z~0=~z~0_In-2045255575} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 15:48:56,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1106] [1106] L792-2-->L792-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2022632250 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-2022632250 256) 0)) (.cse2 (= |P1Thread1of1ForFork0_#t~ite32_Out-2022632250| |P1Thread1of1ForFork0_#t~ite33_Out-2022632250|))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite32_Out-2022632250| ~z$w_buff1~0_In-2022632250) (not .cse1) .cse2) (and (= |P1Thread1of1ForFork0_#t~ite32_Out-2022632250| ~z~0_In-2022632250) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2022632250, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2022632250, ~z$w_buff1~0=~z$w_buff1~0_In-2022632250, ~z~0=~z~0_In-2022632250} OutVars{P1Thread1of1ForFork0_#t~ite32=|P1Thread1of1ForFork0_#t~ite32_Out-2022632250|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2022632250, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2022632250, ~z$w_buff1~0=~z$w_buff1~0_In-2022632250, P1Thread1of1ForFork0_#t~ite33=|P1Thread1of1ForFork0_#t~ite33_Out-2022632250|, ~z~0=~z~0_In-2022632250} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite32, P1Thread1of1ForFork0_#t~ite33] because there is no mapped edge [2019-12-07 15:48:56,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1138] [1138] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In246990847 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In246990847 256)))) (or (and (= ~z$w_buff0_used~0_In246990847 |P0Thread1of1ForFork2_#t~ite28_Out246990847|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork2_#t~ite28_Out246990847|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In246990847, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In246990847} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In246990847, P0Thread1of1ForFork2_#t~ite28=|P0Thread1of1ForFork2_#t~ite28_Out246990847|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In246990847} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 15:48:56,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1114] [1114] L793-->L793-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-229746598 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-229746598 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite34_Out-229746598| ~z$w_buff0_used~0_In-229746598) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite34_Out-229746598|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-229746598, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-229746598} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-229746598, P1Thread1of1ForFork0_#t~ite34=|P1Thread1of1ForFork0_#t~ite34_Out-229746598|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-229746598} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 15:48:56,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1107] [1107] L794-->L794-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd2~0_In1121573542 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1121573542 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1121573542 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1121573542 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1121573542 |P1Thread1of1ForFork0_#t~ite35_Out1121573542|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite35_Out1121573542| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1121573542, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1121573542, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1121573542, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1121573542} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1121573542, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1121573542, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1121573542, P1Thread1of1ForFork0_#t~ite35=|P1Thread1of1ForFork0_#t~ite35_Out1121573542|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1121573542} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 15:48:56,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1126] [1126] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In239063337 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In239063337 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite36_Out239063337|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite36_Out239063337| ~z$r_buff0_thd2~0_In239063337)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In239063337, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In239063337} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In239063337, P1Thread1of1ForFork0_#t~ite36=|P1Thread1of1ForFork0_#t~ite36_Out239063337|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In239063337} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 15:48:56,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1139] [1139] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1138821736 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1138821736 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1138821736 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1138821736 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite29_Out-1138821736| ~z$w_buff1_used~0_In-1138821736)) (and (= |P0Thread1of1ForFork2_#t~ite29_Out-1138821736| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1138821736, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1138821736, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1138821736, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1138821736} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1138821736, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1138821736, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1138821736, P0Thread1of1ForFork2_#t~ite29=|P0Thread1of1ForFork2_#t~ite29_Out-1138821736|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1138821736} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 15:48:56,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1116] [1116] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In2958769 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In2958769 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2958769 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In2958769 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite37_Out2958769| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite37_Out2958769| ~z$r_buff1_thd2~0_In2958769) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2958769, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2958769, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2958769, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2958769} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2958769, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2958769, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2958769, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2958769, P1Thread1of1ForFork0_#t~ite37=|P1Thread1of1ForFork0_#t~ite37_Out2958769|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 15:48:56,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1143] [1143] L796-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= |v_P1Thread1of1ForFork0_#t~ite37_26| v_~z$r_buff1_thd2~0_68) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork0_#t~ite37=|v_P1Thread1of1ForFork0_#t~ite37_26|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, P1Thread1of1ForFork0_#t~ite37=|v_P1Thread1of1ForFork0_#t~ite37_25|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, P1Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 15:48:56,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1112] [1112] L772-->L773: Formula: (let ((.cse0 (= ~z$r_buff0_thd1~0_In-1711730 ~z$r_buff0_thd1~0_Out-1711730)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-1711730 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1711730 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-1711730)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1711730, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1711730} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1711730, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1711730, P0Thread1of1ForFork2_#t~ite30=|P0Thread1of1ForFork2_#t~ite30_Out-1711730|} AuxVars[] AssignedVars[~z$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 15:48:56,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1140] [1140] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In194095548 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In194095548 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In194095548 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In194095548 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite31_Out194095548| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In194095548 |P0Thread1of1ForFork2_#t~ite31_Out194095548|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In194095548, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In194095548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In194095548, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In194095548} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In194095548, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In194095548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In194095548, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In194095548, P0Thread1of1ForFork2_#t~ite31=|P0Thread1of1ForFork2_#t~ite31_Out194095548|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 15:48:56,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L773-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~z$r_buff1_thd1~0_269 |v_P0Thread1of1ForFork2_#t~ite31_30|) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P0Thread1of1ForFork2_#t~ite31=|v_P0Thread1of1ForFork2_#t~ite31_30|} OutVars{~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_269, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, P0Thread1of1ForFork2_#t~ite31=|v_P0Thread1of1ForFork2_#t~ite31_29|} AuxVars[] AssignedVars[~z$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 15:48:56,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1110] [1110] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1947991489 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite60_Out1947991489| ~z$mem_tmp~0_In1947991489) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite60_Out1947991489| ~z~0_In1947991489) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1947991489, ~z$flush_delayed~0=~z$flush_delayed~0_In1947991489, ~z~0=~z~0_In1947991489} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1947991489, P2Thread1of1ForFork1_#t~ite60=|P2Thread1of1ForFork1_#t~ite60_Out1947991489|, ~z$flush_delayed~0=~z$flush_delayed~0_In1947991489, ~z~0=~z~0_In1947991489} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 15:48:56,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1120] [1120] L828-2-->L828-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In61612233 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In61612233 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite61_Out61612233| ~z$w_buff1~0_In61612233)) (and (= ~z~0_In61612233 |P2Thread1of1ForFork1_#t~ite61_Out61612233|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In61612233, ~z$w_buff1_used~0=~z$w_buff1_used~0_In61612233, ~z$w_buff1~0=~z$w_buff1~0_In61612233, ~z~0=~z~0_In61612233} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In61612233, ~z$w_buff1_used~0=~z$w_buff1_used~0_In61612233, ~z$w_buff1~0=~z$w_buff1~0_In61612233, P2Thread1of1ForFork1_#t~ite61=|P2Thread1of1ForFork1_#t~ite61_Out61612233|, ~z~0=~z~0_In61612233} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite61] because there is no mapped edge [2019-12-07 15:48:56,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1099] [1099] L828-4-->L829: Formula: (= v_~z~0_114 |v_P2Thread1of1ForFork1_#t~ite61_6|) InVars {P2Thread1of1ForFork1_#t~ite61=|v_P2Thread1of1ForFork1_#t~ite61_6|} OutVars{P2Thread1of1ForFork1_#t~ite62=|v_P2Thread1of1ForFork1_#t~ite62_5|, ~z~0=v_~z~0_114, P2Thread1of1ForFork1_#t~ite61=|v_P2Thread1of1ForFork1_#t~ite61_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite62, ~z~0, P2Thread1of1ForFork1_#t~ite61] because there is no mapped edge [2019-12-07 15:48:56,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1111] [1111] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In10663709 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In10663709 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite63_Out10663709| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite63_Out10663709| ~z$w_buff0_used~0_In10663709)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In10663709, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In10663709} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In10663709, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In10663709, P2Thread1of1ForFork1_#t~ite63=|P2Thread1of1ForFork1_#t~ite63_Out10663709|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite63] because there is no mapped edge [2019-12-07 15:48:56,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1108] [1108] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In598480417 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In598480417 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In598480417 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In598480417 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In598480417 |P2Thread1of1ForFork1_#t~ite64_Out598480417|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite64_Out598480417|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In598480417, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In598480417, ~z$w_buff1_used~0=~z$w_buff1_used~0_In598480417, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In598480417} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In598480417, P2Thread1of1ForFork1_#t~ite64=|P2Thread1of1ForFork1_#t~ite64_Out598480417|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In598480417, ~z$w_buff1_used~0=~z$w_buff1_used~0_In598480417, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In598480417} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite64] because there is no mapped edge [2019-12-07 15:48:56,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1141] [1141] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-670749495 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-670749495 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite65_Out-670749495| ~z$r_buff0_thd3~0_In-670749495) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite65_Out-670749495| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-670749495, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-670749495} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-670749495, P2Thread1of1ForFork1_#t~ite65=|P2Thread1of1ForFork1_#t~ite65_Out-670749495|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-670749495} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite65] because there is no mapped edge [2019-12-07 15:48:56,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1130] [1130] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In253474579 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In253474579 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In253474579 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In253474579 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite66_Out253474579| ~z$r_buff1_thd3~0_In253474579) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite66_Out253474579| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In253474579, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In253474579, ~z$w_buff1_used~0=~z$w_buff1_used~0_In253474579, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In253474579} OutVars{P2Thread1of1ForFork1_#t~ite66=|P2Thread1of1ForFork1_#t~ite66_Out253474579|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In253474579, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In253474579, ~z$w_buff1_used~0=~z$w_buff1_used~0_In253474579, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In253474579} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite66] because there is no mapped edge [2019-12-07 15:48:56,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1155] [1155] L832-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~z$r_buff1_thd3~0_165 |v_P2Thread1of1ForFork1_#t~ite66_22|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite66=|v_P2Thread1of1ForFork1_#t~ite66_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork1_#t~ite66=|v_P2Thread1of1ForFork1_#t~ite66_21|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_165, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite66, P2Thread1of1ForFork1_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 15:48:56,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1079] [1079] L855-1-->L861: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_21) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet69, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 15:48:56,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1135] [1135] L861-2-->L861-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1574750392 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1574750392 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite70_Out1574750392| |ULTIMATE.start_main_#t~ite71_Out1574750392|))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite70_Out1574750392| ~z$w_buff1~0_In1574750392)) (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite70_Out1574750392| ~z~0_In1574750392)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1574750392, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1574750392, ~z$w_buff1~0=~z$w_buff1~0_In1574750392, ~z~0=~z~0_In1574750392} OutVars{ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out1574750392|, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out1574750392|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1574750392, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1574750392, ~z$w_buff1~0=~z$w_buff1~0_In1574750392, ~z~0=~z~0_In1574750392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite70] because there is no mapped edge [2019-12-07 15:48:56,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1129] [1129] L862-->L862-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1764497079 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1764497079 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1764497079 |ULTIMATE.start_main_#t~ite72_Out-1764497079|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite72_Out-1764497079| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1764497079, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1764497079} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1764497079, ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out-1764497079|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1764497079} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite72] because there is no mapped edge [2019-12-07 15:48:56,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1117] [1117] L863-->L863-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-298744234 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-298744234 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-298744234 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-298744234 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite73_Out-298744234|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-298744234 |ULTIMATE.start_main_#t~ite73_Out-298744234|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-298744234, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-298744234, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-298744234, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-298744234} OutVars{ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out-298744234|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-298744234, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-298744234, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-298744234, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-298744234} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73] because there is no mapped edge [2019-12-07 15:48:56,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1127] [1127] L864-->L864-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1046853714 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1046853714 256)))) (or (and (= ~z$r_buff0_thd0~0_In-1046853714 |ULTIMATE.start_main_#t~ite74_Out-1046853714|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite74_Out-1046853714|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1046853714, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1046853714} OutVars{ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out-1046853714|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1046853714, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1046853714} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite74] because there is no mapped edge [2019-12-07 15:48:56,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1119] [1119] L865-->L865-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1945406646 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1945406646 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1945406646 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1945406646 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite75_Out1945406646| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In1945406646 |ULTIMATE.start_main_#t~ite75_Out1945406646|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1945406646, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1945406646, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1945406646, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1945406646} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1945406646, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1945406646, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1945406646, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1945406646, ULTIMATE.start_main_#t~ite75=|ULTIMATE.start_main_#t~ite75_Out1945406646|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite75] because there is no mapped edge [2019-12-07 15:48:56,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1177] [1177] L865-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_17|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_17| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_24) (= 1 v_~__unbuffered_p2_EAX~0_47) (= v_~__unbuffered_p0_EBX~0_26 0) (= v_~__unbuffered_p2_EBX~0_28 0) (= 1 v_~__unbuffered_p0_EAX~0_33) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0)) 0 1)) (= v_~z$r_buff1_thd0~0_213 |v_ULTIMATE.start_main_#t~ite75_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_33, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_51|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_33, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_213, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_50|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_17|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite75, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:48:56,569 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e0575808-6cc2-4219-8304-2136c8a9a344/bin/uautomizer/witness.graphml [2019-12-07 15:48:56,569 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:48:56,570 INFO L168 Benchmark]: Toolchain (without parser) took 398379.96 ms. Allocated memory was 1.0 GB in the beginning and 8.6 GB in the end (delta: 7.6 GB). Free memory was 938.1 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. [2019-12-07 15:48:56,571 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:48:56,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -120.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:48:56,571 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:48:56,571 INFO L168 Benchmark]: Boogie Preprocessor took 29.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:48:56,571 INFO L168 Benchmark]: RCFGBuilder took 476.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 987.6 MB in the end (delta: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:48:56,572 INFO L168 Benchmark]: TraceAbstraction took 397347.69 ms. Allocated memory was 1.1 GB in the beginning and 8.6 GB in the end (delta: 7.5 GB). Free memory was 987.6 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 4.8 GB. Max. memory is 11.5 GB. [2019-12-07 15:48:56,572 INFO L168 Benchmark]: Witness Printer took 87.96 ms. Allocated memory is still 8.6 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:48:56,573 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 391.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -120.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 476.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 987.6 MB in the end (delta: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 397347.69 ms. Allocated memory was 1.1 GB in the beginning and 8.6 GB in the end (delta: 7.5 GB). Free memory was 987.6 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 4.8 GB. Max. memory is 11.5 GB. * Witness Printer took 87.96 ms. Allocated memory is still 8.6 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 221 ProgramPointsBefore, 132 ProgramPointsAfterwards, 279 TransitionsBefore, 156 TransitionsAfterwards, 37778 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 50 ConcurrentYvCompositions, 38 ChoiceCompositions, 12307 VarBasedMoverChecksPositive, 423 VarBasedMoverChecksNegative, 108 SemBasedMoverChecksPositive, 448 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 225551 CheckedPairsTotal, 125 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L851] FCALL, FORK 0 pthread_create(&t20, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L743] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L744] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L745] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L746] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L747] 1 z$r_buff0_thd1 = (_Bool)1 [L750] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L751] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L752] 1 z$flush_delayed = weak$$choice2 [L753] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=2, weak$$choice2=7, x=0, y=0, z=0, z$flush_delayed=7, 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] [L853] FCALL, FORK 0 pthread_create(&t21, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=2, weak$$choice2=7, x=0, y=0, z=0, z$flush_delayed=7, 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] [L754] 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=2, weak$$choice2=7, x=0, y=0, z=0, z$flush_delayed=7, 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] [L855] FCALL, FORK 0 pthread_create(&t22, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __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=2, weak$$choice2=7, x=0, y=0, z=1, z$flush_delayed=7, 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] [L755] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __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=2, weak$$choice2=7, x=0, y=0, z=1, z$flush_delayed=7, 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] [L755] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L756] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __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=2, weak$$choice2=7, x=0, y=0, z=1, z$flush_delayed=7, 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] [L756] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L757] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __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=2, weak$$choice2=7, x=0, y=0, z=1, z$flush_delayed=7, 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] [L757] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L758] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __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=2, weak$$choice2=7, x=0, y=0, z=1, z$flush_delayed=7, 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] [L758] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 1 weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __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=2, weak$$choice2=7, x=0, y=0, z=1, z$flush_delayed=7, 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] [L760] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __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=2, weak$$choice2=7, x=0, y=0, z=1, z$flush_delayed=7, 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] [L762] 1 z = z$flush_delayed ? z$mem_tmp : z [L763] 1 z$flush_delayed = (_Bool)0 [L766] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __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=2, weak$$choice2=7, 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] [L769] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __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=2, weak$$choice2=7, 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] [L783] 2 x = 1 [L786] 2 __unbuffered_p1_EAX = x [L789] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=7, 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] [L792] 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=1, __unbuffered_p0_EBX=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=2, weak$$choice2=7, 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] [L769] 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) [L792] 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) [L793] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L794] 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 [L795] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L770] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L806] 3 y = 1 [L809] 3 __unbuffered_p2_EAX = y [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L816] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L771] 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 [L816] 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) [L817] 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=1, __unbuffered_p0_EBX=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=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L817] 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)) [L818] 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=1, __unbuffered_p0_EBX=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=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L818] 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)) [L819] 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=1, __unbuffered_p0_EBX=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=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=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] [L819] 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)) [L820] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L820] 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)) [L821] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] 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=1, __unbuffered_p0_EBX=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=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L822] 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)) [L823] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=3, 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] [L828] 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=1, __unbuffered_p0_EBX=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=3, 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] [L829] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L830] 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 [L831] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L861] 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=1, __unbuffered_p0_EBX=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=3, 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] [L861] 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) [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] 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 [L864] 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, 212 locations, 2 error locations. Result: UNSAFE, OverallTime: 397.1s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 57.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11181 SDtfs, 15809 SDslu, 40552 SDs, 0 SdLazy, 31332 SolverSat, 747 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 598 GetRequests, 60 SyntacticMatches, 27 SemanticMatches, 511 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7345 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=583909occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 194.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 587513 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1804 NumberOfCodeBlocks, 1804 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1688 ConstructedInterpolants, 0 QuantifiedInterpolants, 1265799 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...