./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix009_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f0be493a-945e-4826-8329-641eb9a04f5c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f0be493a-945e-4826-8329-641eb9a04f5c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f0be493a-945e-4826-8329-641eb9a04f5c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f0be493a-945e-4826-8329-641eb9a04f5c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f0be493a-945e-4826-8329-641eb9a04f5c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f0be493a-945e-4826-8329-641eb9a04f5c/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 e4336846228c37865706e98397140a73ec7d90c3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 18:09:32,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:09:32,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:09:32,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:09:32,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:09:32,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:09:32,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:09:32,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:09:32,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:09:32,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:09:32,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:09:32,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:09:32,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:09:32,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:09:32,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:09:32,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:09:32,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:09:32,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:09:32,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:09:32,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:09:32,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:09:32,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:09:32,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:09:32,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:09:32,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:09:32,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:09:32,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:09:32,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:09:32,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:09:32,900 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:09:32,900 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:09:32,901 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:09:32,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:09:32,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:09:32,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:09:32,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:09:32,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:09:32,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:09:32,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:09:32,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:09:32,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:09:32,905 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f0be493a-945e-4826-8329-641eb9a04f5c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:09:32,914 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:09:32,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:09:32,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:09:32,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:09:32,915 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:09:32,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:09:32,915 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:09:32,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:09:32,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:09:32,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:09:32,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:09:32,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:09:32,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:09:32,916 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:09:32,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:09:32,917 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:09:32,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:09:32,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:09:32,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:09:32,917 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:09:32,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:09:32,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:09:32,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:09:32,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:09:32,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:09:32,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:09:32,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:09:32,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:09:32,918 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:09:32,919 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_f0be493a-945e-4826-8329-641eb9a04f5c/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 -> e4336846228c37865706e98397140a73ec7d90c3 [2019-12-07 18:09:33,023 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:09:33,032 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:09:33,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:09:33,036 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:09:33,036 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:09:33,037 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f0be493a-945e-4826-8329-641eb9a04f5c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix009_rmo.oepc.i [2019-12-07 18:09:33,077 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f0be493a-945e-4826-8329-641eb9a04f5c/bin/uautomizer/data/fd48e140d/c715e9a0e2734bc597630444c87eabef/FLAGc3b7b0945 [2019-12-07 18:09:33,561 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:09:33,562 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f0be493a-945e-4826-8329-641eb9a04f5c/sv-benchmarks/c/pthread-wmm/mix009_rmo.oepc.i [2019-12-07 18:09:33,572 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f0be493a-945e-4826-8329-641eb9a04f5c/bin/uautomizer/data/fd48e140d/c715e9a0e2734bc597630444c87eabef/FLAGc3b7b0945 [2019-12-07 18:09:33,581 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f0be493a-945e-4826-8329-641eb9a04f5c/bin/uautomizer/data/fd48e140d/c715e9a0e2734bc597630444c87eabef [2019-12-07 18:09:33,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:09:33,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:09:33,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:09:33,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:09:33,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:09:33,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:09:33" (1/1) ... [2019-12-07 18:09:33,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:33, skipping insertion in model container [2019-12-07 18:09:33,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:09:33" (1/1) ... [2019-12-07 18:09:33,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:09:33,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:09:33,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:09:33,913 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:09:33,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:09:34,012 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:09:34,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:34 WrapperNode [2019-12-07 18:09:34,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:09:34,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:09:34,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:09:34,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:09:34,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:34" (1/1) ... [2019-12-07 18:09:34,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:34" (1/1) ... [2019-12-07 18:09:34,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:09:34,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:09:34,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:09:34,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:09:34,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:34" (1/1) ... [2019-12-07 18:09:34,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:34" (1/1) ... [2019-12-07 18:09:34,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:34" (1/1) ... [2019-12-07 18:09:34,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:34" (1/1) ... [2019-12-07 18:09:34,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:34" (1/1) ... [2019-12-07 18:09:34,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:34" (1/1) ... [2019-12-07 18:09:34,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:34" (1/1) ... [2019-12-07 18:09:34,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:09:34,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:09:34,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:09:34,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:09:34,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f0be493a-945e-4826-8329-641eb9a04f5c/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 18:09:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:09:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:09:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:09:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:09:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:09:34,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:09:34,134 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:09:34,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:09:34,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:09:34,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:09:34,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:09:34,135 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 18:09:34,461 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:09:34,461 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:09:34,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:09:34 BoogieIcfgContainer [2019-12-07 18:09:34,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:09:34,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:09:34,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:09:34,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:09:34,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:09:33" (1/3) ... [2019-12-07 18:09:34,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44adee91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:09:34, skipping insertion in model container [2019-12-07 18:09:34,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:34" (2/3) ... [2019-12-07 18:09:34,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44adee91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:09:34, skipping insertion in model container [2019-12-07 18:09:34,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:09:34" (3/3) ... [2019-12-07 18:09:34,467 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_rmo.oepc.i [2019-12-07 18:09:34,473 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:09:34,473 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:09:34,478 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:09:34,478 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:09:34,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,506 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,506 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:34,529 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 18:09:34,542 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:09:34,542 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:09:34,542 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:09:34,542 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:09:34,542 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:09:34,542 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:09:34,542 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:09:34,542 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:09:34,553 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 184 transitions [2019-12-07 18:09:34,554 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-12-07 18:09:34,601 INFO L134 PetriNetUnfolder]: 41/182 cut-off events. [2019-12-07 18:09:34,601 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:09:34,609 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 559 event pairs. 6/145 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 18:09:34,622 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-12-07 18:09:34,646 INFO L134 PetriNetUnfolder]: 41/182 cut-off events. [2019-12-07 18:09:34,647 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:09:34,650 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 559 event pairs. 6/145 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 18:09:34,661 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 18:09:34,662 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:09:37,513 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 18:09:37,617 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54623 [2019-12-07 18:09:37,617 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-07 18:09:37,620 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 88 transitions [2019-12-07 18:09:37,925 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 18:09:37,926 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 18:09:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 18:09:37,930 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:37,930 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 18:09:37,931 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:37,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:37,935 INFO L82 PathProgramCache]: Analyzing trace with hash 798193, now seen corresponding path program 1 times [2019-12-07 18:09:37,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:37,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747245762] [2019-12-07 18:09:37,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:38,075 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 18:09:38,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747245762] [2019-12-07 18:09:38,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:38,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:09:38,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993573842] [2019-12-07 18:09:38,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:09:38,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:38,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:09:38,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:09:38,091 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 18:09:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:38,292 INFO L93 Difference]: Finished difference Result 8466 states and 27782 transitions. [2019-12-07 18:09:38,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:09:38,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 18:09:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:38,356 INFO L225 Difference]: With dead ends: 8466 [2019-12-07 18:09:38,356 INFO L226 Difference]: Without dead ends: 7974 [2019-12-07 18:09:38,357 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 18:09:38,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2019-12-07 18:09:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 7974. [2019-12-07 18:09:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2019-12-07 18:09:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 26121 transitions. [2019-12-07 18:09:38,636 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 26121 transitions. Word has length 3 [2019-12-07 18:09:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:38,636 INFO L462 AbstractCegarLoop]: Abstraction has 7974 states and 26121 transitions. [2019-12-07 18:09:38,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:09:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 26121 transitions. [2019-12-07 18:09:38,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:09:38,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:38,640 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:38,640 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:38,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:38,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1209832272, now seen corresponding path program 1 times [2019-12-07 18:09:38,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:38,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054315793] [2019-12-07 18:09:38,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:38,708 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 18:09:38,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054315793] [2019-12-07 18:09:38,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:38,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:09:38,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148342844] [2019-12-07 18:09:38,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:09:38,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:38,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:09:38,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:09:38,711 INFO L87 Difference]: Start difference. First operand 7974 states and 26121 transitions. Second operand 3 states. [2019-12-07 18:09:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:38,733 INFO L93 Difference]: Finished difference Result 1283 states and 2944 transitions. [2019-12-07 18:09:38,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:09:38,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 18:09:38,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:38,741 INFO L225 Difference]: With dead ends: 1283 [2019-12-07 18:09:38,741 INFO L226 Difference]: Without dead ends: 1283 [2019-12-07 18:09:38,742 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 18:09:38,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-12-07 18:09:38,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-12-07 18:09:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-12-07 18:09:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2944 transitions. [2019-12-07 18:09:38,762 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2944 transitions. Word has length 11 [2019-12-07 18:09:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:38,762 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 2944 transitions. [2019-12-07 18:09:38,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:09:38,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2944 transitions. [2019-12-07 18:09:38,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:09:38,764 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:38,764 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:38,765 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:38,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:38,765 INFO L82 PathProgramCache]: Analyzing trace with hash 768793875, now seen corresponding path program 1 times [2019-12-07 18:09:38,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:38,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080691307] [2019-12-07 18:09:38,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:38,850 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 18:09:38,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080691307] [2019-12-07 18:09:38,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:38,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:09:38,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111046934] [2019-12-07 18:09:38,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:09:38,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:38,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:09:38,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:09:38,851 INFO L87 Difference]: Start difference. First operand 1283 states and 2944 transitions. Second operand 5 states. [2019-12-07 18:09:39,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:39,043 INFO L93 Difference]: Finished difference Result 1902 states and 4249 transitions. [2019-12-07 18:09:39,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:09:39,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 18:09:39,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:39,055 INFO L225 Difference]: With dead ends: 1902 [2019-12-07 18:09:39,055 INFO L226 Difference]: Without dead ends: 1902 [2019-12-07 18:09:39,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:09:39,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2019-12-07 18:09:39,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1604. [2019-12-07 18:09:39,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-12-07 18:09:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3640 transitions. [2019-12-07 18:09:39,096 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3640 transitions. Word has length 14 [2019-12-07 18:09:39,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:39,096 INFO L462 AbstractCegarLoop]: Abstraction has 1604 states and 3640 transitions. [2019-12-07 18:09:39,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:09:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3640 transitions. [2019-12-07 18:09:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:09:39,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:39,100 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 18:09:39,100 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:39,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:39,100 INFO L82 PathProgramCache]: Analyzing trace with hash -845336479, now seen corresponding path program 1 times [2019-12-07 18:09:39,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:39,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711017875] [2019-12-07 18:09:39,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:39,187 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 18:09:39,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711017875] [2019-12-07 18:09:39,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:39,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:09:39,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27663847] [2019-12-07 18:09:39,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:09:39,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:39,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:09:39,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:09:39,188 INFO L87 Difference]: Start difference. First operand 1604 states and 3640 transitions. Second operand 6 states. [2019-12-07 18:09:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:39,440 INFO L93 Difference]: Finished difference Result 2385 states and 5172 transitions. [2019-12-07 18:09:39,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:09:39,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 18:09:39,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:39,450 INFO L225 Difference]: With dead ends: 2385 [2019-12-07 18:09:39,451 INFO L226 Difference]: Without dead ends: 2385 [2019-12-07 18:09:39,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:09:39,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2019-12-07 18:09:39,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1725. [2019-12-07 18:09:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2019-12-07 18:09:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3880 transitions. [2019-12-07 18:09:39,479 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3880 transitions. Word has length 25 [2019-12-07 18:09:39,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:39,480 INFO L462 AbstractCegarLoop]: Abstraction has 1725 states and 3880 transitions. [2019-12-07 18:09:39,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:09:39,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3880 transitions. [2019-12-07 18:09:39,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:09:39,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:39,481 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] [2019-12-07 18:09:39,482 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:39,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:39,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1948393738, now seen corresponding path program 1 times [2019-12-07 18:09:39,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:39,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764777877] [2019-12-07 18:09:39,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:39,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:39,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764777877] [2019-12-07 18:09:39,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:39,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:09:39,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224565602] [2019-12-07 18:09:39,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:09:39,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:39,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:09:39,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:09:39,540 INFO L87 Difference]: Start difference. First operand 1725 states and 3880 transitions. Second operand 5 states. [2019-12-07 18:09:39,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:39,818 INFO L93 Difference]: Finished difference Result 2513 states and 5538 transitions. [2019-12-07 18:09:39,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:09:39,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 18:09:39,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:39,829 INFO L225 Difference]: With dead ends: 2513 [2019-12-07 18:09:39,830 INFO L226 Difference]: Without dead ends: 2513 [2019-12-07 18:09:39,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:09:39,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2019-12-07 18:09:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2218. [2019-12-07 18:09:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2019-12-07 18:09:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 4956 transitions. [2019-12-07 18:09:39,859 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 4956 transitions. Word has length 26 [2019-12-07 18:09:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:39,859 INFO L462 AbstractCegarLoop]: Abstraction has 2218 states and 4956 transitions. [2019-12-07 18:09:39,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:09:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 4956 transitions. [2019-12-07 18:09:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:09:39,861 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:39,862 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:39,862 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:39,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:39,862 INFO L82 PathProgramCache]: Analyzing trace with hash -53278191, now seen corresponding path program 1 times [2019-12-07 18:09:39,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:39,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87679360] [2019-12-07 18:09:39,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:39,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87679360] [2019-12-07 18:09:39,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:39,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:09:39,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145427532] [2019-12-07 18:09:39,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:09:39,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:39,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:09:39,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:09:39,947 INFO L87 Difference]: Start difference. First operand 2218 states and 4956 transitions. Second operand 4 states. [2019-12-07 18:09:39,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:39,964 INFO L93 Difference]: Finished difference Result 2217 states and 4954 transitions. [2019-12-07 18:09:39,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:09:39,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 18:09:39,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:39,973 INFO L225 Difference]: With dead ends: 2217 [2019-12-07 18:09:39,973 INFO L226 Difference]: Without dead ends: 2217 [2019-12-07 18:09:39,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:09:39,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2019-12-07 18:09:40,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2217. [2019-12-07 18:09:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2217 states. [2019-12-07 18:09:40,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 4954 transitions. [2019-12-07 18:09:40,012 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 4954 transitions. Word has length 27 [2019-12-07 18:09:40,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:40,013 INFO L462 AbstractCegarLoop]: Abstraction has 2217 states and 4954 transitions. [2019-12-07 18:09:40,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:09:40,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 4954 transitions. [2019-12-07 18:09:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:09:40,016 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:40,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:40,016 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:40,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:40,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1337227567, now seen corresponding path program 1 times [2019-12-07 18:09:40,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:40,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333557425] [2019-12-07 18:09:40,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:40,058 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 18:09:40,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333557425] [2019-12-07 18:09:40,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:40,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:09:40,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869263075] [2019-12-07 18:09:40,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:09:40,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:40,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:09:40,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:09:40,059 INFO L87 Difference]: Start difference. First operand 2217 states and 4954 transitions. Second operand 4 states. [2019-12-07 18:09:40,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:40,074 INFO L93 Difference]: Finished difference Result 1233 states and 2633 transitions. [2019-12-07 18:09:40,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:09:40,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 18:09:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:40,078 INFO L225 Difference]: With dead ends: 1233 [2019-12-07 18:09:40,078 INFO L226 Difference]: Without dead ends: 1233 [2019-12-07 18:09:40,078 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 18:09:40,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2019-12-07 18:09:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1144. [2019-12-07 18:09:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2019-12-07 18:09:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 2469 transitions. [2019-12-07 18:09:40,095 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 2469 transitions. Word has length 28 [2019-12-07 18:09:40,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:40,095 INFO L462 AbstractCegarLoop]: Abstraction has 1144 states and 2469 transitions. [2019-12-07 18:09:40,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:09:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 2469 transitions. [2019-12-07 18:09:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 18:09:40,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:40,098 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:40,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:40,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2075557978, now seen corresponding path program 1 times [2019-12-07 18:09:40,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:40,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114210829] [2019-12-07 18:09:40,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:40,125 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 18:09:40,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114210829] [2019-12-07 18:09:40,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:40,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:09:40,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007601161] [2019-12-07 18:09:40,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:09:40,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:40,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:09:40,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:09:40,126 INFO L87 Difference]: Start difference. First operand 1144 states and 2469 transitions. Second operand 3 states. [2019-12-07 18:09:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:40,162 INFO L93 Difference]: Finished difference Result 1748 states and 3666 transitions. [2019-12-07 18:09:40,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:09:40,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 18:09:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:40,164 INFO L225 Difference]: With dead ends: 1748 [2019-12-07 18:09:40,164 INFO L226 Difference]: Without dead ends: 1748 [2019-12-07 18:09:40,165 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 18:09:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-12-07 18:09:40,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1269. [2019-12-07 18:09:40,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1269 states. [2019-12-07 18:09:40,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2718 transitions. [2019-12-07 18:09:40,182 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2718 transitions. Word has length 51 [2019-12-07 18:09:40,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:40,182 INFO L462 AbstractCegarLoop]: Abstraction has 1269 states and 2718 transitions. [2019-12-07 18:09:40,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:09:40,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2718 transitions. [2019-12-07 18:09:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 18:09:40,184 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:40,184 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] [2019-12-07 18:09:40,184 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:40,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:40,185 INFO L82 PathProgramCache]: Analyzing trace with hash -175297467, now seen corresponding path program 1 times [2019-12-07 18:09:40,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:40,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917869283] [2019-12-07 18:09:40,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:40,256 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 18:09:40,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917869283] [2019-12-07 18:09:40,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:40,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:09:40,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561602365] [2019-12-07 18:09:40,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:09:40,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:40,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:09:40,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:09:40,257 INFO L87 Difference]: Start difference. First operand 1269 states and 2718 transitions. Second operand 7 states. [2019-12-07 18:09:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:40,753 INFO L93 Difference]: Finished difference Result 1848 states and 3839 transitions. [2019-12-07 18:09:40,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:09:40,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-07 18:09:40,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:40,756 INFO L225 Difference]: With dead ends: 1848 [2019-12-07 18:09:40,756 INFO L226 Difference]: Without dead ends: 1848 [2019-12-07 18:09:40,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:09:40,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2019-12-07 18:09:40,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1301. [2019-12-07 18:09:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2019-12-07 18:09:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 2776 transitions. [2019-12-07 18:09:40,774 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 2776 transitions. Word has length 51 [2019-12-07 18:09:40,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:40,774 INFO L462 AbstractCegarLoop]: Abstraction has 1301 states and 2776 transitions. [2019-12-07 18:09:40,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:09:40,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 2776 transitions. [2019-12-07 18:09:40,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 18:09:40,776 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:40,776 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] [2019-12-07 18:09:40,776 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:40,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:40,776 INFO L82 PathProgramCache]: Analyzing trace with hash -2037363857, now seen corresponding path program 2 times [2019-12-07 18:09:40,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:40,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815485547] [2019-12-07 18:09:40,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:40,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815485547] [2019-12-07 18:09:40,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:40,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:09:40,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519594029] [2019-12-07 18:09:40,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:09:40,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:40,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:09:40,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:09:40,835 INFO L87 Difference]: Start difference. First operand 1301 states and 2776 transitions. Second operand 5 states. [2019-12-07 18:09:40,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:40,989 INFO L93 Difference]: Finished difference Result 1448 states and 3045 transitions. [2019-12-07 18:09:40,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:09:40,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 18:09:40,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:40,991 INFO L225 Difference]: With dead ends: 1448 [2019-12-07 18:09:40,991 INFO L226 Difference]: Without dead ends: 1448 [2019-12-07 18:09:40,992 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 18:09:40,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2019-12-07 18:09:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1311. [2019-12-07 18:09:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-12-07 18:09:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 2798 transitions. [2019-12-07 18:09:41,008 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 2798 transitions. Word has length 51 [2019-12-07 18:09:41,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:41,009 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 2798 transitions. [2019-12-07 18:09:41,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:09:41,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 2798 transitions. [2019-12-07 18:09:41,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 18:09:41,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:41,011 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] [2019-12-07 18:09:41,011 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:41,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:41,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1151208547, now seen corresponding path program 3 times [2019-12-07 18:09:41,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:41,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453917911] [2019-12-07 18:09:41,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:41,073 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 18:09:41,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453917911] [2019-12-07 18:09:41,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:41,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:09:41,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64689721] [2019-12-07 18:09:41,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:09:41,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:41,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:09:41,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:09:41,074 INFO L87 Difference]: Start difference. First operand 1311 states and 2798 transitions. Second operand 3 states. [2019-12-07 18:09:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:41,086 INFO L93 Difference]: Finished difference Result 1310 states and 2796 transitions. [2019-12-07 18:09:41,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:09:41,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 18:09:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:41,088 INFO L225 Difference]: With dead ends: 1310 [2019-12-07 18:09:41,088 INFO L226 Difference]: Without dead ends: 1310 [2019-12-07 18:09:41,088 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 18:09:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2019-12-07 18:09:41,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1097. [2019-12-07 18:09:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-12-07 18:09:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 2386 transitions. [2019-12-07 18:09:41,102 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 2386 transitions. Word has length 51 [2019-12-07 18:09:41,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:41,102 INFO L462 AbstractCegarLoop]: Abstraction has 1097 states and 2386 transitions. [2019-12-07 18:09:41,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:09:41,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 2386 transitions. [2019-12-07 18:09:41,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:09:41,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:41,104 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] [2019-12-07 18:09:41,104 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:41,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:41,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1483615416, now seen corresponding path program 1 times [2019-12-07 18:09:41,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:41,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768465291] [2019-12-07 18:09:41,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:41,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768465291] [2019-12-07 18:09:41,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:41,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 18:09:41,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407152857] [2019-12-07 18:09:41,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:09:41,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:41,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:09:41,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:09:41,444 INFO L87 Difference]: Start difference. First operand 1097 states and 2386 transitions. Second operand 16 states. [2019-12-07 18:09:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:42,480 INFO L93 Difference]: Finished difference Result 1504 states and 3143 transitions. [2019-12-07 18:09:42,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 18:09:42,480 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2019-12-07 18:09:42,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:42,482 INFO L225 Difference]: With dead ends: 1504 [2019-12-07 18:09:42,482 INFO L226 Difference]: Without dead ends: 1149 [2019-12-07 18:09:42,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:09:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2019-12-07 18:09:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1113. [2019-12-07 18:09:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-12-07 18:09:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 2418 transitions. [2019-12-07 18:09:42,498 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 2418 transitions. Word has length 52 [2019-12-07 18:09:42,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:42,498 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 2418 transitions. [2019-12-07 18:09:42,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:09:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 2418 transitions. [2019-12-07 18:09:42,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:09:42,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:42,500 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] [2019-12-07 18:09:42,501 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:42,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:42,501 INFO L82 PathProgramCache]: Analyzing trace with hash -428389348, now seen corresponding path program 1 times [2019-12-07 18:09:42,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:42,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552998087] [2019-12-07 18:09:42,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:42,528 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 18:09:42,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552998087] [2019-12-07 18:09:42,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:42,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:09:42,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149354711] [2019-12-07 18:09:42,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:09:42,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:42,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:09:42,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:09:42,529 INFO L87 Difference]: Start difference. First operand 1113 states and 2418 transitions. Second operand 3 states. [2019-12-07 18:09:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:42,556 INFO L93 Difference]: Finished difference Result 1424 states and 2975 transitions. [2019-12-07 18:09:42,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:09:42,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 18:09:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:42,558 INFO L225 Difference]: With dead ends: 1424 [2019-12-07 18:09:42,558 INFO L226 Difference]: Without dead ends: 1424 [2019-12-07 18:09:42,559 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 18:09:42,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2019-12-07 18:09:42,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1113. [2019-12-07 18:09:42,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-12-07 18:09:42,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 2338 transitions. [2019-12-07 18:09:42,573 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 2338 transitions. Word has length 52 [2019-12-07 18:09:42,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:42,573 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 2338 transitions. [2019-12-07 18:09:42,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:09:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 2338 transitions. [2019-12-07 18:09:42,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:09:42,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:42,575 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] [2019-12-07 18:09:42,575 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:42,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:42,575 INFO L82 PathProgramCache]: Analyzing trace with hash 529376956, now seen corresponding path program 2 times [2019-12-07 18:09:42,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:42,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180395310] [2019-12-07 18:09:42,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:42,645 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 18:09:42,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180395310] [2019-12-07 18:09:42,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:42,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:09:42,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949784561] [2019-12-07 18:09:42,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:09:42,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:42,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:09:42,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:09:42,646 INFO L87 Difference]: Start difference. First operand 1113 states and 2338 transitions. Second operand 5 states. [2019-12-07 18:09:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:42,693 INFO L93 Difference]: Finished difference Result 1363 states and 2863 transitions. [2019-12-07 18:09:42,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:09:42,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-07 18:09:42,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:42,695 INFO L225 Difference]: With dead ends: 1363 [2019-12-07 18:09:42,695 INFO L226 Difference]: Without dead ends: 1363 [2019-12-07 18:09:42,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 18:09:42,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-12-07 18:09:42,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1017. [2019-12-07 18:09:42,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1017 states. [2019-12-07 18:09:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 2162 transitions. [2019-12-07 18:09:42,708 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 2162 transitions. Word has length 52 [2019-12-07 18:09:42,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:42,708 INFO L462 AbstractCegarLoop]: Abstraction has 1017 states and 2162 transitions. [2019-12-07 18:09:42,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:09:42,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 2162 transitions. [2019-12-07 18:09:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:09:42,709 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:42,710 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 18:09:42,710 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:42,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:42,710 INFO L82 PathProgramCache]: Analyzing trace with hash -97117523, now seen corresponding path program 1 times [2019-12-07 18:09:42,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:42,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402180611] [2019-12-07 18:09:42,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:42,755 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 18:09:42,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402180611] [2019-12-07 18:09:42,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:42,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:09:42,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13886686] [2019-12-07 18:09:42,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:09:42,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:42,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:09:42,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:09:42,756 INFO L87 Difference]: Start difference. First operand 1017 states and 2162 transitions. Second operand 5 states. [2019-12-07 18:09:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:42,914 INFO L93 Difference]: Finished difference Result 1796 states and 3803 transitions. [2019-12-07 18:09:42,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:09:42,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-07 18:09:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:42,916 INFO L225 Difference]: With dead ends: 1796 [2019-12-07 18:09:42,916 INFO L226 Difference]: Without dead ends: 1796 [2019-12-07 18:09:42,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:09:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2019-12-07 18:09:42,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1082. [2019-12-07 18:09:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2019-12-07 18:09:42,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 2325 transitions. [2019-12-07 18:09:42,931 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 2325 transitions. Word has length 53 [2019-12-07 18:09:42,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:42,932 INFO L462 AbstractCegarLoop]: Abstraction has 1082 states and 2325 transitions. [2019-12-07 18:09:42,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:09:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 2325 transitions. [2019-12-07 18:09:42,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:09:42,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:42,933 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 18:09:42,933 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:42,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:42,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1821255754, now seen corresponding path program 1 times [2019-12-07 18:09:42,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:42,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942945951] [2019-12-07 18:09:42,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:43,003 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 18:09:43,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942945951] [2019-12-07 18:09:43,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:43,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:09:43,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981997888] [2019-12-07 18:09:43,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:09:43,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:43,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:09:43,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:09:43,004 INFO L87 Difference]: Start difference. First operand 1082 states and 2325 transitions. Second operand 7 states. [2019-12-07 18:09:43,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:43,187 INFO L93 Difference]: Finished difference Result 3027 states and 6333 transitions. [2019-12-07 18:09:43,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:09:43,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 18:09:43,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:43,189 INFO L225 Difference]: With dead ends: 3027 [2019-12-07 18:09:43,189 INFO L226 Difference]: Without dead ends: 2047 [2019-12-07 18:09:43,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:09:43,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2019-12-07 18:09:43,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1138. [2019-12-07 18:09:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-12-07 18:09:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 2441 transitions. [2019-12-07 18:09:43,203 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 2441 transitions. Word has length 53 [2019-12-07 18:09:43,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:43,203 INFO L462 AbstractCegarLoop]: Abstraction has 1138 states and 2441 transitions. [2019-12-07 18:09:43,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:09:43,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 2441 transitions. [2019-12-07 18:09:43,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:09:43,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:43,204 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 18:09:43,204 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:43,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:43,204 INFO L82 PathProgramCache]: Analyzing trace with hash -690859281, now seen corresponding path program 1 times [2019-12-07 18:09:43,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:43,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165748525] [2019-12-07 18:09:43,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:09:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:09:43,271 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:09:43,271 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:09:43,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L809: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_136 0) (= 0 v_~z$flush_delayed~0_34) (= v_~z$w_buff1~0_283 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t249~0.base_34|) (= v_~z~0_158 0) (= v_~z$read_delayed~0_8 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t249~0.base_34| 4) |v_#length_19|) (= v_~z$w_buff0~0_493 0) (= 0 |v_ULTIMATE.start_main_~#t249~0.offset_22|) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$mem_tmp~0_24 0) (= v_~z$w_buff1_used~0_485 0) (= 0 v_~__unbuffered_p0_EAX~0_136) (= (select .cse0 |v_ULTIMATE.start_main_~#t249~0.base_34|) 0) (= v_~z$r_buff1_thd1~0_163 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x~0_115) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t249~0.base_34| 1)) (= v_~main$tmp_guard0~0_20 0) (= v_~z$r_buff1_thd2~0_305 0) (= v_~z$r_buff1_thd0~0_183 0) (= 0 v_~weak$$choice0~0_22) (= v_~z$r_buff0_thd1~0_272 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t249~0.base_34| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t249~0.base_34|) |v_ULTIMATE.start_main_~#t249~0.offset_22| 0)) |v_#memory_int_15|) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff0_used~0_741 0) (= 0 v_~__unbuffered_cnt~0_48) (= v_~weak$$choice2~0_119 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_114 0) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_163 0) (= v_~z$r_buff0_thd2~0_362 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_305, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_283, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t250~0.base=|v_ULTIMATE.start_main_~#t250~0.base_31|, ULTIMATE.start_main_~#t250~0.offset=|v_ULTIMATE.start_main_~#t250~0.offset_21|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_163, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_183, #length=|v_#length_19|, ~y~0=v_~y~0_114, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_362, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_741, ~z$w_buff0~0=v_~z$w_buff0~0_493, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_485, ULTIMATE.start_main_~#t249~0.base=|v_ULTIMATE.start_main_~#t249~0.base_34|, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_29|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ULTIMATE.start_main_~#t249~0.offset=|v_ULTIMATE.start_main_~#t249~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_57|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_158, ~weak$$choice2~0=v_~weak$$choice2~0_119, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_272, ~x~0=v_~x~0_115} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t250~0.base, ULTIMATE.start_main_~#t250~0.offset, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t249~0.base, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t249~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 18:09:43,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L4-->L750: Formula: (and (= ~__unbuffered_p0_EBX~0_Out-1063884376 ~y~0_In-1063884376) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1063884376 0)) (= ~z$r_buff0_thd0~0_In-1063884376 ~z$r_buff1_thd0~0_Out-1063884376) (= ~__unbuffered_p0_EAX~0_Out-1063884376 ~x~0_Out-1063884376) (= ~z$r_buff0_thd2~0_In-1063884376 ~z$r_buff1_thd2~0_Out-1063884376) (= ~z$r_buff1_thd1~0_Out-1063884376 ~z$r_buff0_thd1~0_In-1063884376) (= 1 ~z$r_buff0_thd1~0_Out-1063884376) (= 1 ~x~0_Out-1063884376)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1063884376, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1063884376, ~y~0=~y~0_In-1063884376, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1063884376, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1063884376} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1063884376, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1063884376, ~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out-1063884376, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1063884376, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1063884376, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1063884376, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1063884376, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1063884376, ~y~0=~y~0_In-1063884376, ~x~0=~x~0_Out-1063884376, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1063884376} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 18:09:43,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L809-1-->L811: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t250~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t250~0.base_12|) |v_ULTIMATE.start_main_~#t250~0.offset_11| 1))) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t250~0.base_12| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t250~0.base_12|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t250~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t250~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t250~0.offset_11| 0) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t250~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t250~0.offset=|v_ULTIMATE.start_main_~#t250~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t250~0.base=|v_ULTIMATE.start_main_~#t250~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t250~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t250~0.base] because there is no mapped edge [2019-12-07 18:09:43,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L777-->L777-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-184590326 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-184590326| ~z$w_buff0_used~0_In-184590326) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-184590326| |P1Thread1of1ForFork1_#t~ite20_Out-184590326|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-184590326 256)))) (or (= (mod ~z$w_buff0_used~0_In-184590326 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-184590326 256)) .cse1) (and (= 0 (mod ~z$r_buff1_thd2~0_In-184590326 256)) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out-184590326| |P1Thread1of1ForFork1_#t~ite21_Out-184590326|) (= |P1Thread1of1ForFork1_#t~ite20_Out-184590326| ~z$w_buff0_used~0_In-184590326)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-184590326, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-184590326|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-184590326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-184590326, ~weak$$choice2~0=~weak$$choice2~0_In-184590326, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-184590326} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-184590326, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-184590326|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-184590326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-184590326, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-184590326|, ~weak$$choice2~0=~weak$$choice2~0_In-184590326, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-184590326} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 18:09:43,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L779-->L780: Formula: (and (= v_~z$r_buff0_thd2~0_119 v_~z$r_buff0_thd2~0_120) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_120} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_119, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 18:09:43,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L780-->L780-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In923703384 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In923703384 256) 0))) (or (and (= (mod ~z$r_buff1_thd2~0_In923703384 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In923703384 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In923703384 256)) .cse0))) .cse1 (= ~z$r_buff1_thd2~0_In923703384 |P1Thread1of1ForFork1_#t~ite29_Out923703384|) (= |P1Thread1of1ForFork1_#t~ite30_Out923703384| |P1Thread1of1ForFork1_#t~ite29_Out923703384|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In923703384| |P1Thread1of1ForFork1_#t~ite29_Out923703384|) (= ~z$r_buff1_thd2~0_In923703384 |P1Thread1of1ForFork1_#t~ite30_Out923703384|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In923703384|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In923703384, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In923703384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In923703384, ~weak$$choice2~0=~weak$$choice2~0_In923703384, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In923703384} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out923703384|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out923703384|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In923703384, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In923703384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In923703384, ~weak$$choice2~0=~weak$$choice2~0_In923703384, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In923703384} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 18:09:43,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-->L786: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~z~0_49 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 18:09:43,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L786-2-->L786-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out727062667| |P1Thread1of1ForFork1_#t~ite32_Out727062667|)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In727062667 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In727062667 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In727062667 |P1Thread1of1ForFork1_#t~ite32_Out727062667|)) (and (= ~z$w_buff1~0_In727062667 |P1Thread1of1ForFork1_#t~ite32_Out727062667|) .cse0 (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In727062667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In727062667, ~z$w_buff1~0=~z$w_buff1~0_In727062667, ~z~0=~z~0_In727062667} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In727062667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In727062667, ~z$w_buff1~0=~z$w_buff1~0_In727062667, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out727062667|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out727062667|, ~z~0=~z~0_In727062667} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 18:09:43,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-842453031 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-842453031 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-842453031| ~z$w_buff0_used~0_In-842453031)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-842453031| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-842453031, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-842453031} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-842453031, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-842453031|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-842453031} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 18:09:43,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In484035181 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In484035181 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In484035181 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In484035181 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out484035181| ~z$w_buff1_used~0_In484035181) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out484035181| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In484035181, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In484035181, ~z$w_buff1_used~0=~z$w_buff1_used~0_In484035181, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In484035181} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In484035181, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In484035181, ~z$w_buff1_used~0=~z$w_buff1_used~0_In484035181, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out484035181|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In484035181} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 18:09:43,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2116953019 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In2116953019 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In2116953019 |P1Thread1of1ForFork1_#t~ite36_Out2116953019|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out2116953019| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2116953019, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2116953019} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2116953019, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2116953019, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out2116953019|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 18:09:43,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In830889001 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In830889001 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In830889001 |P0Thread1of1ForFork0_#t~ite5_Out830889001|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out830889001|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In830889001, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In830889001} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out830889001|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In830889001, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In830889001} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 18:09:43,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L752-->L752-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1959829211 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1959829211 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1959829211 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1959829211 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1959829211| ~z$w_buff1_used~0_In-1959829211) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1959829211| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1959829211, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1959829211, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1959829211, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1959829211} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1959829211|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1959829211, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1959829211, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1959829211, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1959829211} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 18:09:43,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1549378966 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1549378966 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1549378966 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1549378966 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out-1549378966| ~z$r_buff1_thd2~0_In-1549378966) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-1549378966| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1549378966, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1549378966, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1549378966, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1549378966} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1549378966, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1549378966, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1549378966, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1549378966, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1549378966|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:09:43,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L790-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_131 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:09:43,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In622040662 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In622040662 256) 0)) (.cse2 (= ~z$r_buff0_thd1~0_Out622040662 ~z$r_buff0_thd1~0_In622040662))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out622040662 0) (not .cse1)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In622040662, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In622040662} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In622040662, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out622040662|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out622040662} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:09:43,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1700664728 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1700664728 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In1700664728 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1700664728 256) 0))) (or (and (= ~z$r_buff1_thd1~0_In1700664728 |P0Thread1of1ForFork0_#t~ite8_Out1700664728|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1700664728|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1700664728, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1700664728, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1700664728, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1700664728} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1700664728, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1700664728|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1700664728, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1700664728, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1700664728} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 18:09:43,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L754-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~z$r_buff1_thd1~0_65 |v_P0Thread1of1ForFork0_#t~ite8_22|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_65, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:09:43,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L811-1-->L817: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 18:09:43,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L817-2-->L817-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1136023944 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1136023944 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1136023944 |ULTIMATE.start_main_#t~ite40_Out-1136023944|)) (and (= ~z~0_In-1136023944 |ULTIMATE.start_main_#t~ite40_Out-1136023944|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1136023944, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1136023944, ~z$w_buff1~0=~z$w_buff1~0_In-1136023944, ~z~0=~z~0_In-1136023944} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1136023944|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1136023944, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1136023944, ~z$w_buff1~0=~z$w_buff1~0_In-1136023944, ~z~0=~z~0_In-1136023944} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 18:09:43,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L817-4-->L818: Formula: (= v_~z~0_42 |v_ULTIMATE.start_main_#t~ite40_16|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z~0=v_~z~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-07 18:09:43,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1584788100 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1584788100 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1584788100| ~z$w_buff0_used~0_In-1584788100)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-1584788100| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1584788100, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1584788100} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1584788100, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1584788100, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1584788100|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:09:43,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L819-->L819-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In2119692275 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In2119692275 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2119692275 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In2119692275 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out2119692275| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out2119692275| ~z$w_buff1_used~0_In2119692275)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2119692275, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2119692275, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2119692275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2119692275} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2119692275, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2119692275, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2119692275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2119692275, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2119692275|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 18:09:43,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1081612133 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1081612133 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1081612133| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1081612133| ~z$r_buff0_thd0~0_In-1081612133)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1081612133, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1081612133} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1081612133, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1081612133, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1081612133|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 18:09:43,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In99278551 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In99278551 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In99278551 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In99278551 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out99278551| ~z$r_buff1_thd0~0_In99278551) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out99278551|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In99278551, ~z$w_buff0_used~0=~z$w_buff0_used~0_In99278551, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In99278551, ~z$w_buff1_used~0=~z$w_buff1_used~0_In99278551} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In99278551, ~z$w_buff0_used~0=~z$w_buff0_used~0_In99278551, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In99278551, ~z$w_buff1_used~0=~z$w_buff1_used~0_In99278551, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out99278551|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 18:09:43,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L821-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~z$r_buff1_thd0~0_161 |v_ULTIMATE.start_main_#t~ite45_31|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_116 0) (= 1 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p0_EAX~0_116) (= v_~__unbuffered_p1_EBX~0_22 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_161, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:09:43,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:09:43 BasicIcfg [2019-12-07 18:09:43,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:09:43,320 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:09:43,320 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:09:43,321 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:09:43,321 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:09:34" (3/4) ... [2019-12-07 18:09:43,323 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:09:43,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L809: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_136 0) (= 0 v_~z$flush_delayed~0_34) (= v_~z$w_buff1~0_283 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t249~0.base_34|) (= v_~z~0_158 0) (= v_~z$read_delayed~0_8 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t249~0.base_34| 4) |v_#length_19|) (= v_~z$w_buff0~0_493 0) (= 0 |v_ULTIMATE.start_main_~#t249~0.offset_22|) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$mem_tmp~0_24 0) (= v_~z$w_buff1_used~0_485 0) (= 0 v_~__unbuffered_p0_EAX~0_136) (= (select .cse0 |v_ULTIMATE.start_main_~#t249~0.base_34|) 0) (= v_~z$r_buff1_thd1~0_163 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x~0_115) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t249~0.base_34| 1)) (= v_~main$tmp_guard0~0_20 0) (= v_~z$r_buff1_thd2~0_305 0) (= v_~z$r_buff1_thd0~0_183 0) (= 0 v_~weak$$choice0~0_22) (= v_~z$r_buff0_thd1~0_272 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t249~0.base_34| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t249~0.base_34|) |v_ULTIMATE.start_main_~#t249~0.offset_22| 0)) |v_#memory_int_15|) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff0_used~0_741 0) (= 0 v_~__unbuffered_cnt~0_48) (= v_~weak$$choice2~0_119 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_114 0) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_163 0) (= v_~z$r_buff0_thd2~0_362 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_305, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_283, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t250~0.base=|v_ULTIMATE.start_main_~#t250~0.base_31|, ULTIMATE.start_main_~#t250~0.offset=|v_ULTIMATE.start_main_~#t250~0.offset_21|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_163, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_183, #length=|v_#length_19|, ~y~0=v_~y~0_114, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_362, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_741, ~z$w_buff0~0=v_~z$w_buff0~0_493, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_485, ULTIMATE.start_main_~#t249~0.base=|v_ULTIMATE.start_main_~#t249~0.base_34|, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_29|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ULTIMATE.start_main_~#t249~0.offset=|v_ULTIMATE.start_main_~#t249~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_57|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_158, ~weak$$choice2~0=v_~weak$$choice2~0_119, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_272, ~x~0=v_~x~0_115} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t250~0.base, ULTIMATE.start_main_~#t250~0.offset, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t249~0.base, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t249~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 18:09:43,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L4-->L750: Formula: (and (= ~__unbuffered_p0_EBX~0_Out-1063884376 ~y~0_In-1063884376) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1063884376 0)) (= ~z$r_buff0_thd0~0_In-1063884376 ~z$r_buff1_thd0~0_Out-1063884376) (= ~__unbuffered_p0_EAX~0_Out-1063884376 ~x~0_Out-1063884376) (= ~z$r_buff0_thd2~0_In-1063884376 ~z$r_buff1_thd2~0_Out-1063884376) (= ~z$r_buff1_thd1~0_Out-1063884376 ~z$r_buff0_thd1~0_In-1063884376) (= 1 ~z$r_buff0_thd1~0_Out-1063884376) (= 1 ~x~0_Out-1063884376)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1063884376, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1063884376, ~y~0=~y~0_In-1063884376, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1063884376, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1063884376} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1063884376, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1063884376, ~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out-1063884376, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1063884376, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1063884376, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1063884376, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1063884376, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1063884376, ~y~0=~y~0_In-1063884376, ~x~0=~x~0_Out-1063884376, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1063884376} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 18:09:43,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L809-1-->L811: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t250~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t250~0.base_12|) |v_ULTIMATE.start_main_~#t250~0.offset_11| 1))) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t250~0.base_12| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t250~0.base_12|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t250~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t250~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t250~0.offset_11| 0) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t250~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t250~0.offset=|v_ULTIMATE.start_main_~#t250~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t250~0.base=|v_ULTIMATE.start_main_~#t250~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t250~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t250~0.base] because there is no mapped edge [2019-12-07 18:09:43,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L777-->L777-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-184590326 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-184590326| ~z$w_buff0_used~0_In-184590326) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-184590326| |P1Thread1of1ForFork1_#t~ite20_Out-184590326|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-184590326 256)))) (or (= (mod ~z$w_buff0_used~0_In-184590326 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-184590326 256)) .cse1) (and (= 0 (mod ~z$r_buff1_thd2~0_In-184590326 256)) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out-184590326| |P1Thread1of1ForFork1_#t~ite21_Out-184590326|) (= |P1Thread1of1ForFork1_#t~ite20_Out-184590326| ~z$w_buff0_used~0_In-184590326)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-184590326, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-184590326|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-184590326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-184590326, ~weak$$choice2~0=~weak$$choice2~0_In-184590326, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-184590326} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-184590326, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-184590326|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-184590326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-184590326, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-184590326|, ~weak$$choice2~0=~weak$$choice2~0_In-184590326, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-184590326} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 18:09:43,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L779-->L780: Formula: (and (= v_~z$r_buff0_thd2~0_119 v_~z$r_buff0_thd2~0_120) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_120} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_119, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 18:09:43,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L780-->L780-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In923703384 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In923703384 256) 0))) (or (and (= (mod ~z$r_buff1_thd2~0_In923703384 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In923703384 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In923703384 256)) .cse0))) .cse1 (= ~z$r_buff1_thd2~0_In923703384 |P1Thread1of1ForFork1_#t~ite29_Out923703384|) (= |P1Thread1of1ForFork1_#t~ite30_Out923703384| |P1Thread1of1ForFork1_#t~ite29_Out923703384|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In923703384| |P1Thread1of1ForFork1_#t~ite29_Out923703384|) (= ~z$r_buff1_thd2~0_In923703384 |P1Thread1of1ForFork1_#t~ite30_Out923703384|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In923703384|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In923703384, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In923703384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In923703384, ~weak$$choice2~0=~weak$$choice2~0_In923703384, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In923703384} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out923703384|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out923703384|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In923703384, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In923703384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In923703384, ~weak$$choice2~0=~weak$$choice2~0_In923703384, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In923703384} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 18:09:43,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-->L786: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~z~0_49 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 18:09:43,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L786-2-->L786-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out727062667| |P1Thread1of1ForFork1_#t~ite32_Out727062667|)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In727062667 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In727062667 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In727062667 |P1Thread1of1ForFork1_#t~ite32_Out727062667|)) (and (= ~z$w_buff1~0_In727062667 |P1Thread1of1ForFork1_#t~ite32_Out727062667|) .cse0 (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In727062667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In727062667, ~z$w_buff1~0=~z$w_buff1~0_In727062667, ~z~0=~z~0_In727062667} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In727062667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In727062667, ~z$w_buff1~0=~z$w_buff1~0_In727062667, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out727062667|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out727062667|, ~z~0=~z~0_In727062667} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 18:09:43,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-842453031 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-842453031 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-842453031| ~z$w_buff0_used~0_In-842453031)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-842453031| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-842453031, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-842453031} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-842453031, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-842453031|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-842453031} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 18:09:43,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In484035181 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In484035181 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In484035181 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In484035181 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out484035181| ~z$w_buff1_used~0_In484035181) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out484035181| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In484035181, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In484035181, ~z$w_buff1_used~0=~z$w_buff1_used~0_In484035181, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In484035181} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In484035181, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In484035181, ~z$w_buff1_used~0=~z$w_buff1_used~0_In484035181, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out484035181|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In484035181} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 18:09:43,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2116953019 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In2116953019 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In2116953019 |P1Thread1of1ForFork1_#t~ite36_Out2116953019|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out2116953019| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2116953019, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2116953019} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2116953019, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2116953019, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out2116953019|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 18:09:43,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In830889001 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In830889001 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In830889001 |P0Thread1of1ForFork0_#t~ite5_Out830889001|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out830889001|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In830889001, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In830889001} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out830889001|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In830889001, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In830889001} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 18:09:43,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L752-->L752-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1959829211 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1959829211 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1959829211 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1959829211 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1959829211| ~z$w_buff1_used~0_In-1959829211) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1959829211| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1959829211, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1959829211, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1959829211, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1959829211} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1959829211|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1959829211, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1959829211, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1959829211, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1959829211} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 18:09:43,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1549378966 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1549378966 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1549378966 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1549378966 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out-1549378966| ~z$r_buff1_thd2~0_In-1549378966) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-1549378966| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1549378966, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1549378966, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1549378966, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1549378966} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1549378966, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1549378966, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1549378966, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1549378966, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1549378966|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:09:43,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L790-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_131 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:09:43,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In622040662 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In622040662 256) 0)) (.cse2 (= ~z$r_buff0_thd1~0_Out622040662 ~z$r_buff0_thd1~0_In622040662))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out622040662 0) (not .cse1)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In622040662, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In622040662} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In622040662, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out622040662|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out622040662} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:09:43,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1700664728 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1700664728 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In1700664728 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1700664728 256) 0))) (or (and (= ~z$r_buff1_thd1~0_In1700664728 |P0Thread1of1ForFork0_#t~ite8_Out1700664728|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1700664728|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1700664728, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1700664728, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1700664728, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1700664728} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1700664728, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1700664728|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1700664728, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1700664728, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1700664728} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 18:09:43,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L754-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~z$r_buff1_thd1~0_65 |v_P0Thread1of1ForFork0_#t~ite8_22|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_65, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:09:43,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L811-1-->L817: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 18:09:43,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L817-2-->L817-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1136023944 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1136023944 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1136023944 |ULTIMATE.start_main_#t~ite40_Out-1136023944|)) (and (= ~z~0_In-1136023944 |ULTIMATE.start_main_#t~ite40_Out-1136023944|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1136023944, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1136023944, ~z$w_buff1~0=~z$w_buff1~0_In-1136023944, ~z~0=~z~0_In-1136023944} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1136023944|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1136023944, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1136023944, ~z$w_buff1~0=~z$w_buff1~0_In-1136023944, ~z~0=~z~0_In-1136023944} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 18:09:43,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L817-4-->L818: Formula: (= v_~z~0_42 |v_ULTIMATE.start_main_#t~ite40_16|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z~0=v_~z~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-07 18:09:43,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1584788100 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1584788100 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1584788100| ~z$w_buff0_used~0_In-1584788100)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-1584788100| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1584788100, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1584788100} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1584788100, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1584788100, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1584788100|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:09:43,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L819-->L819-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In2119692275 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In2119692275 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2119692275 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In2119692275 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out2119692275| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out2119692275| ~z$w_buff1_used~0_In2119692275)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2119692275, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2119692275, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2119692275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2119692275} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2119692275, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2119692275, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2119692275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2119692275, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2119692275|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 18:09:43,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1081612133 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1081612133 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1081612133| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1081612133| ~z$r_buff0_thd0~0_In-1081612133)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1081612133, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1081612133} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1081612133, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1081612133, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1081612133|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 18:09:43,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In99278551 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In99278551 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In99278551 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In99278551 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out99278551| ~z$r_buff1_thd0~0_In99278551) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out99278551|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In99278551, ~z$w_buff0_used~0=~z$w_buff0_used~0_In99278551, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In99278551, ~z$w_buff1_used~0=~z$w_buff1_used~0_In99278551} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In99278551, ~z$w_buff0_used~0=~z$w_buff0_used~0_In99278551, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In99278551, ~z$w_buff1_used~0=~z$w_buff1_used~0_In99278551, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out99278551|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 18:09:43,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L821-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~z$r_buff1_thd0~0_161 |v_ULTIMATE.start_main_#t~ite45_31|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_116 0) (= 1 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p0_EAX~0_116) (= v_~__unbuffered_p1_EBX~0_22 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_161, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:09:43,377 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f0be493a-945e-4826-8329-641eb9a04f5c/bin/uautomizer/witness.graphml [2019-12-07 18:09:43,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:09:43,378 INFO L168 Benchmark]: Toolchain (without parser) took 9795.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.1 MB). Free memory was 939.4 MB in the beginning and 916.7 MB in the end (delta: 22.7 MB). Peak memory consumption was 327.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:09:43,379 INFO L168 Benchmark]: CDTParser took 0.19 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 18:09:43,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 429.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -130.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:09:43,379 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.74 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 18:09:43,380 INFO L168 Benchmark]: Boogie Preprocessor took 31.67 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 18:09:43,380 INFO L168 Benchmark]: RCFGBuilder took 377.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:09:43,380 INFO L168 Benchmark]: TraceAbstraction took 8857.22 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 202.9 MB). Free memory was 1.0 GB in the beginning and 939.0 MB in the end (delta: 74.8 MB). Peak memory consumption was 277.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:09:43,380 INFO L168 Benchmark]: Witness Printer took 57.12 ms. Allocated memory is still 1.3 GB. Free memory was 939.0 MB in the beginning and 916.7 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:09:43,382 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.19 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 429.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -130.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 377.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8857.22 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 202.9 MB). Free memory was 1.0 GB in the beginning and 939.0 MB in the end (delta: 74.8 MB). Peak memory consumption was 277.7 MB. Max. memory is 11.5 GB. * Witness Printer took 57.12 ms. Allocated memory is still 1.3 GB. Free memory was 939.0 MB in the beginning and 916.7 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 150 ProgramPointsBefore, 77 ProgramPointsAfterwards, 184 TransitionsBefore, 88 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 4687 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 39 SemBasedMoverChecksPositive, 206 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 54623 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L809] FCALL, FORK 0 pthread_create(&t249, ((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, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L811] FCALL, FORK 0 pthread_create(&t250, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L775] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L786] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L786] 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) [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] 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 [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L817] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 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 [L820] 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 3 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2048 SDtfs, 1845 SDslu, 4602 SDs, 0 SdLazy, 3464 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 31 SyntacticMatches, 11 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 5034 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 653 NumberOfCodeBlocks, 653 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 584 ConstructedInterpolants, 0 QuantifiedInterpolants, 152926 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...