./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_power.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_0a6392cf-1dbe-4dc7-8fc1-41208fb7f98f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0a6392cf-1dbe-4dc7-8fc1-41208fb7f98f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0a6392cf-1dbe-4dc7-8fc1-41208fb7f98f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0a6392cf-1dbe-4dc7-8fc1-41208fb7f98f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0a6392cf-1dbe-4dc7-8fc1-41208fb7f98f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0a6392cf-1dbe-4dc7-8fc1-41208fb7f98f/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 3d42252203ae435c01e16559a298cce401c32dec ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 17:48:48,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:48:48,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:48:48,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:48:48,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:48:48,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:48:48,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:48:48,118 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:48:48,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:48:48,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:48:48,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:48:48,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:48:48,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:48:48,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:48:48,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:48:48,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:48:48,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:48:48,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:48:48,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:48:48,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:48:48,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:48:48,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:48:48,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:48:48,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:48:48,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:48:48,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:48:48,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:48:48,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:48:48,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:48:48,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:48:48,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:48:48,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:48:48,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:48:48,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:48:48,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:48:48,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:48:48,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:48:48,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:48:48,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:48:48,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:48:48,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:48:48,143 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0a6392cf-1dbe-4dc7-8fc1-41208fb7f98f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:48:48,156 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:48:48,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:48:48,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:48:48,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:48:48,157 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:48:48,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:48:48,158 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:48:48,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:48:48,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:48:48,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:48:48,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:48:48,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:48:48,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:48:48,159 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:48:48,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:48:48,159 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:48:48,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:48:48,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:48:48,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:48:48,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:48:48,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:48:48,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:48:48,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:48:48,160 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:48:48,160 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:48:48,161 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:48:48,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:48:48,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:48:48,161 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:48:48,161 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_0a6392cf-1dbe-4dc7-8fc1-41208fb7f98f/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 -> 3d42252203ae435c01e16559a298cce401c32dec [2019-12-07 17:48:48,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:48:48,287 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:48:48,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:48:48,291 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:48:48,291 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:48:48,292 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0a6392cf-1dbe-4dc7-8fc1-41208fb7f98f/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_power.oepc.i [2019-12-07 17:48:48,339 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0a6392cf-1dbe-4dc7-8fc1-41208fb7f98f/bin/uautomizer/data/d6743b9ac/6ee47bd61c8f4bf69529b3d11caa8d4a/FLAG974d84418 [2019-12-07 17:48:48,800 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:48:48,800 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0a6392cf-1dbe-4dc7-8fc1-41208fb7f98f/sv-benchmarks/c/pthread-wmm/mix031_power.oepc.i [2019-12-07 17:48:48,811 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0a6392cf-1dbe-4dc7-8fc1-41208fb7f98f/bin/uautomizer/data/d6743b9ac/6ee47bd61c8f4bf69529b3d11caa8d4a/FLAG974d84418 [2019-12-07 17:48:49,119 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0a6392cf-1dbe-4dc7-8fc1-41208fb7f98f/bin/uautomizer/data/d6743b9ac/6ee47bd61c8f4bf69529b3d11caa8d4a [2019-12-07 17:48:49,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:48:49,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:48:49,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:48:49,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:48:49,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:48:49,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:48:49" (1/1) ... [2019-12-07 17:48:49,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa3c0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:49, skipping insertion in model container [2019-12-07 17:48:49,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:48:49" (1/1) ... [2019-12-07 17:48:49,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:48:49,166 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:48:49,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:48:49,432 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:48:49,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:48:49,520 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:48:49,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:49 WrapperNode [2019-12-07 17:48:49,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:48:49,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:48:49,521 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:48:49,521 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:48:49,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:49" (1/1) ... [2019-12-07 17:48:49,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:49" (1/1) ... [2019-12-07 17:48:49,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:48:49,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:48:49,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:48:49,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:48:49,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:49" (1/1) ... [2019-12-07 17:48:49,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:49" (1/1) ... [2019-12-07 17:48:49,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:49" (1/1) ... [2019-12-07 17:48:49,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:49" (1/1) ... [2019-12-07 17:48:49,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:49" (1/1) ... [2019-12-07 17:48:49,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:49" (1/1) ... [2019-12-07 17:48:49,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:49" (1/1) ... [2019-12-07 17:48:49,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:48:49,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:48:49,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:48:49,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:48:49,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0a6392cf-1dbe-4dc7-8fc1-41208fb7f98f/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 17:48:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:48:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:48:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:48:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:48:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:48:49,628 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:48:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:48:49,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:48:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:48:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:48:49,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:48:49,630 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 17:48:49,964 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:48:49,964 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:48:49,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:48:49 BoogieIcfgContainer [2019-12-07 17:48:49,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:48:49,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:48:49,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:48:49,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:48:49,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:48:49" (1/3) ... [2019-12-07 17:48:49,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738818d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:48:49, skipping insertion in model container [2019-12-07 17:48:49,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:48:49" (2/3) ... [2019-12-07 17:48:49,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738818d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:48:49, skipping insertion in model container [2019-12-07 17:48:49,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:48:49" (3/3) ... [2019-12-07 17:48:49,969 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.oepc.i [2019-12-07 17:48:49,976 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:48:49,976 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:48:49,980 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:48:49,981 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:48:50,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,003 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,003 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,003 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,004 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,004 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,008 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,008 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:48:50,030 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:48:50,042 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:48:50,043 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:48:50,043 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:48:50,043 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:48:50,043 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:48:50,043 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:48:50,043 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:48:50,043 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:48:50,053 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-07 17:48:50,055 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-07 17:48:50,102 INFO L134 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-07 17:48:50,102 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:48:50,111 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 575 event pairs. 6/146 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:48:50,122 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-07 17:48:50,145 INFO L134 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-07 17:48:50,146 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:48:50,150 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 575 event pairs. 6/146 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:48:50,162 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 17:48:50,163 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:48:52,986 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 17:48:53,072 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55357 [2019-12-07 17:48:53,072 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-12-07 17:48:53,075 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-07 17:48:53,379 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 17:48:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 17:48:53,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:48:53,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:53,384 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:48:53,385 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:53,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:53,388 INFO L82 PathProgramCache]: Analyzing trace with hash 801135, now seen corresponding path program 1 times [2019-12-07 17:48:53,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:53,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942792983] [2019-12-07 17:48:53,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:53,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:53,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942792983] [2019-12-07 17:48:53,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:53,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:48:53,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174116919] [2019-12-07 17:48:53,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:48:53,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:53,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:48:53,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:53,541 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 17:48:53,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:53,715 INFO L93 Difference]: Finished difference Result 8472 states and 28002 transitions. [2019-12-07 17:48:53,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:48:53,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:48:53,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:53,778 INFO L225 Difference]: With dead ends: 8472 [2019-12-07 17:48:53,778 INFO L226 Difference]: Without dead ends: 7980 [2019-12-07 17:48:53,779 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 17:48:53,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7980 states. [2019-12-07 17:48:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7980 to 7980. [2019-12-07 17:48:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7980 states. [2019-12-07 17:48:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 26329 transitions. [2019-12-07 17:48:54,056 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 26329 transitions. Word has length 3 [2019-12-07 17:48:54,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:54,056 INFO L462 AbstractCegarLoop]: Abstraction has 7980 states and 26329 transitions. [2019-12-07 17:48:54,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:48:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 26329 transitions. [2019-12-07 17:48:54,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:48:54,059 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:54,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:54,059 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:54,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:54,059 INFO L82 PathProgramCache]: Analyzing trace with hash -337363797, now seen corresponding path program 1 times [2019-12-07 17:48:54,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:54,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107740031] [2019-12-07 17:48:54,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:54,122 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 17:48:54,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107740031] [2019-12-07 17:48:54,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:54,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:48:54,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402403297] [2019-12-07 17:48:54,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:48:54,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:54,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:48:54,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:48:54,125 INFO L87 Difference]: Start difference. First operand 7980 states and 26329 transitions. Second operand 4 states. [2019-12-07 17:48:54,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:54,371 INFO L93 Difference]: Finished difference Result 12172 states and 38421 transitions. [2019-12-07 17:48:54,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:48:54,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:48:54,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:54,467 INFO L225 Difference]: With dead ends: 12172 [2019-12-07 17:48:54,468 INFO L226 Difference]: Without dead ends: 12165 [2019-12-07 17:48:54,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:48:54,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12165 states. [2019-12-07 17:48:54,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12165 to 10976. [2019-12-07 17:48:54,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10976 states. [2019-12-07 17:48:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10976 states to 10976 states and 35289 transitions. [2019-12-07 17:48:54,721 INFO L78 Accepts]: Start accepts. Automaton has 10976 states and 35289 transitions. Word has length 11 [2019-12-07 17:48:54,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:54,721 INFO L462 AbstractCegarLoop]: Abstraction has 10976 states and 35289 transitions. [2019-12-07 17:48:54,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:48:54,721 INFO L276 IsEmpty]: Start isEmpty. Operand 10976 states and 35289 transitions. [2019-12-07 17:48:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:48:54,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:54,726 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:54,726 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:54,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:54,727 INFO L82 PathProgramCache]: Analyzing trace with hash 254708639, now seen corresponding path program 1 times [2019-12-07 17:48:54,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:54,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752619158] [2019-12-07 17:48:54,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:54,766 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 17:48:54,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752619158] [2019-12-07 17:48:54,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:54,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:48:54,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063569961] [2019-12-07 17:48:54,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:48:54,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:54,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:48:54,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:54,767 INFO L87 Difference]: Start difference. First operand 10976 states and 35289 transitions. Second operand 3 states. [2019-12-07 17:48:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:54,923 INFO L93 Difference]: Finished difference Result 16162 states and 51860 transitions. [2019-12-07 17:48:54,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:48:54,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 17:48:54,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:54,982 INFO L225 Difference]: With dead ends: 16162 [2019-12-07 17:48:54,983 INFO L226 Difference]: Without dead ends: 16162 [2019-12-07 17:48:54,983 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 17:48:55,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16162 states. [2019-12-07 17:48:55,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16162 to 12780. [2019-12-07 17:48:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12780 states. [2019-12-07 17:48:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12780 states to 12780 states and 41531 transitions. [2019-12-07 17:48:55,265 INFO L78 Accepts]: Start accepts. Automaton has 12780 states and 41531 transitions. Word has length 14 [2019-12-07 17:48:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:55,266 INFO L462 AbstractCegarLoop]: Abstraction has 12780 states and 41531 transitions. [2019-12-07 17:48:55,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:48:55,266 INFO L276 IsEmpty]: Start isEmpty. Operand 12780 states and 41531 transitions. [2019-12-07 17:48:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:48:55,268 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:55,268 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:55,268 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:55,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:55,269 INFO L82 PathProgramCache]: Analyzing trace with hash 254810970, now seen corresponding path program 1 times [2019-12-07 17:48:55,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:55,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915891591] [2019-12-07 17:48:55,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:55,315 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 17:48:55,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915891591] [2019-12-07 17:48:55,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:55,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:48:55,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204347143] [2019-12-07 17:48:55,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:48:55,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:55,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:48:55,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:48:55,317 INFO L87 Difference]: Start difference. First operand 12780 states and 41531 transitions. Second operand 4 states. [2019-12-07 17:48:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:55,493 INFO L93 Difference]: Finished difference Result 15429 states and 49294 transitions. [2019-12-07 17:48:55,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:48:55,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:48:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:55,515 INFO L225 Difference]: With dead ends: 15429 [2019-12-07 17:48:55,516 INFO L226 Difference]: Without dead ends: 15429 [2019-12-07 17:48:55,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:48:55,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15429 states. [2019-12-07 17:48:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15429 to 14033. [2019-12-07 17:48:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14033 states. [2019-12-07 17:48:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14033 states to 14033 states and 45307 transitions. [2019-12-07 17:48:55,762 INFO L78 Accepts]: Start accepts. Automaton has 14033 states and 45307 transitions. Word has length 14 [2019-12-07 17:48:55,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:55,763 INFO L462 AbstractCegarLoop]: Abstraction has 14033 states and 45307 transitions. [2019-12-07 17:48:55,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:48:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 14033 states and 45307 transitions. [2019-12-07 17:48:55,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:48:55,764 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:55,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:55,765 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:55,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:55,765 INFO L82 PathProgramCache]: Analyzing trace with hash 32652836, now seen corresponding path program 1 times [2019-12-07 17:48:55,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:55,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855747003] [2019-12-07 17:48:55,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:55,800 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 17:48:55,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855747003] [2019-12-07 17:48:55,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:55,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:48:55,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167166759] [2019-12-07 17:48:55,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:48:55,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:55,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:48:55,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:48:55,801 INFO L87 Difference]: Start difference. First operand 14033 states and 45307 transitions. Second operand 4 states. [2019-12-07 17:48:55,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:55,941 INFO L93 Difference]: Finished difference Result 16676 states and 53317 transitions. [2019-12-07 17:48:55,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:48:55,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:48:55,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:55,964 INFO L225 Difference]: With dead ends: 16676 [2019-12-07 17:48:55,964 INFO L226 Difference]: Without dead ends: 16676 [2019-12-07 17:48:55,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:48:56,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16676 states. [2019-12-07 17:48:56,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16676 to 14306. [2019-12-07 17:48:56,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14306 states. [2019-12-07 17:48:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14306 states to 14306 states and 46219 transitions. [2019-12-07 17:48:56,228 INFO L78 Accepts]: Start accepts. Automaton has 14306 states and 46219 transitions. Word has length 14 [2019-12-07 17:48:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:56,228 INFO L462 AbstractCegarLoop]: Abstraction has 14306 states and 46219 transitions. [2019-12-07 17:48:56,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:48:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 14306 states and 46219 transitions. [2019-12-07 17:48:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:48:56,231 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:56,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:56,231 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:56,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:56,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1305033028, now seen corresponding path program 1 times [2019-12-07 17:48:56,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:56,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477173862] [2019-12-07 17:48:56,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:56,280 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 17:48:56,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477173862] [2019-12-07 17:48:56,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:56,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:48:56,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858384737] [2019-12-07 17:48:56,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:48:56,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:56,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:48:56,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:56,281 INFO L87 Difference]: Start difference. First operand 14306 states and 46219 transitions. Second operand 3 states. [2019-12-07 17:48:56,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:56,325 INFO L93 Difference]: Finished difference Result 13528 states and 43047 transitions. [2019-12-07 17:48:56,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:48:56,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:48:56,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:56,343 INFO L225 Difference]: With dead ends: 13528 [2019-12-07 17:48:56,343 INFO L226 Difference]: Without dead ends: 13528 [2019-12-07 17:48:56,344 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 17:48:56,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13528 states. [2019-12-07 17:48:56,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13528 to 13448. [2019-12-07 17:48:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13448 states. [2019-12-07 17:48:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13448 states to 13448 states and 42815 transitions. [2019-12-07 17:48:56,544 INFO L78 Accepts]: Start accepts. Automaton has 13448 states and 42815 transitions. Word has length 16 [2019-12-07 17:48:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:56,544 INFO L462 AbstractCegarLoop]: Abstraction has 13448 states and 42815 transitions. [2019-12-07 17:48:56,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:48:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 13448 states and 42815 transitions. [2019-12-07 17:48:56,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:48:56,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:56,547 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:56,547 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:56,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1252676989, now seen corresponding path program 1 times [2019-12-07 17:48:56,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:56,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729497552] [2019-12-07 17:48:56,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:56,573 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 17:48:56,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729497552] [2019-12-07 17:48:56,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:56,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:48:56,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707536944] [2019-12-07 17:48:56,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:48:56,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:56,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:48:56,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:56,575 INFO L87 Difference]: Start difference. First operand 13448 states and 42815 transitions. Second operand 3 states. [2019-12-07 17:48:56,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:56,585 INFO L93 Difference]: Finished difference Result 1752 states and 4007 transitions. [2019-12-07 17:48:56,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:48:56,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:48:56,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:56,587 INFO L225 Difference]: With dead ends: 1752 [2019-12-07 17:48:56,587 INFO L226 Difference]: Without dead ends: 1752 [2019-12-07 17:48:56,587 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 17:48:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2019-12-07 17:48:56,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2019-12-07 17:48:56,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2019-12-07 17:48:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 4007 transitions. [2019-12-07 17:48:56,603 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 4007 transitions. Word has length 16 [2019-12-07 17:48:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:56,603 INFO L462 AbstractCegarLoop]: Abstraction has 1752 states and 4007 transitions. [2019-12-07 17:48:56,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:48:56,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 4007 transitions. [2019-12-07 17:48:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:48:56,605 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:56,605 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 17:48:56,605 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:56,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:56,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1595600556, now seen corresponding path program 1 times [2019-12-07 17:48:56,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:56,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245263158] [2019-12-07 17:48:56,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:56,658 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 17:48:56,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245263158] [2019-12-07 17:48:56,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:56,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:48:56,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313454026] [2019-12-07 17:48:56,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:48:56,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:56,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:48:56,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:48:56,659 INFO L87 Difference]: Start difference. First operand 1752 states and 4007 transitions. Second operand 5 states. [2019-12-07 17:48:56,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:56,788 INFO L93 Difference]: Finished difference Result 2261 states and 5020 transitions. [2019-12-07 17:48:56,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:48:56,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 17:48:56,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:56,790 INFO L225 Difference]: With dead ends: 2261 [2019-12-07 17:48:56,790 INFO L226 Difference]: Without dead ends: 2261 [2019-12-07 17:48:56,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:48:56,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2019-12-07 17:48:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 1820. [2019-12-07 17:48:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1820 states. [2019-12-07 17:48:56,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 4147 transitions. [2019-12-07 17:48:56,805 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 4147 transitions. Word has length 25 [2019-12-07 17:48:56,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:56,805 INFO L462 AbstractCegarLoop]: Abstraction has 1820 states and 4147 transitions. [2019-12-07 17:48:56,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:48:56,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 4147 transitions. [2019-12-07 17:48:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:48:56,807 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:56,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:56,807 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:56,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:56,807 INFO L82 PathProgramCache]: Analyzing trace with hash 532711466, now seen corresponding path program 1 times [2019-12-07 17:48:56,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:56,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254198076] [2019-12-07 17:48:56,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:56,847 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 17:48:56,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254198076] [2019-12-07 17:48:56,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:56,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:48:56,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929199588] [2019-12-07 17:48:56,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:48:56,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:56,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:48:56,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:48:56,848 INFO L87 Difference]: Start difference. First operand 1820 states and 4147 transitions. Second operand 5 states. [2019-12-07 17:48:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:56,979 INFO L93 Difference]: Finished difference Result 2275 states and 5049 transitions. [2019-12-07 17:48:56,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:48:56,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 17:48:56,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:56,981 INFO L225 Difference]: With dead ends: 2275 [2019-12-07 17:48:56,981 INFO L226 Difference]: Without dead ends: 2275 [2019-12-07 17:48:56,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:48:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2019-12-07 17:48:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 1766. [2019-12-07 17:48:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2019-12-07 17:48:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 4036 transitions. [2019-12-07 17:48:56,996 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 4036 transitions. Word has length 26 [2019-12-07 17:48:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:56,996 INFO L462 AbstractCegarLoop]: Abstraction has 1766 states and 4036 transitions. [2019-12-07 17:48:56,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:48:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 4036 transitions. [2019-12-07 17:48:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:48:56,998 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:56,998 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 17:48:56,998 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:56,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:56,998 INFO L82 PathProgramCache]: Analyzing trace with hash 898927989, now seen corresponding path program 1 times [2019-12-07 17:48:56,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:56,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326702425] [2019-12-07 17:48:56,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:57,030 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 17:48:57,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326702425] [2019-12-07 17:48:57,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:57,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:48:57,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858880830] [2019-12-07 17:48:57,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:48:57,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:57,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:48:57,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:48:57,031 INFO L87 Difference]: Start difference. First operand 1766 states and 4036 transitions. Second operand 4 states. [2019-12-07 17:48:57,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:57,041 INFO L93 Difference]: Finished difference Result 859 states and 1946 transitions. [2019-12-07 17:48:57,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:48:57,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 17:48:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:57,042 INFO L225 Difference]: With dead ends: 859 [2019-12-07 17:48:57,042 INFO L226 Difference]: Without dead ends: 859 [2019-12-07 17:48:57,042 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 17:48:57,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-12-07 17:48:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2019-12-07 17:48:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-12-07 17:48:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1946 transitions. [2019-12-07 17:48:57,049 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1946 transitions. Word has length 27 [2019-12-07 17:48:57,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:57,050 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1946 transitions. [2019-12-07 17:48:57,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:48:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1946 transitions. [2019-12-07 17:48:57,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:48:57,051 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:57,051 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 17:48:57,052 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:57,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1144531918, now seen corresponding path program 1 times [2019-12-07 17:48:57,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:57,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119783594] [2019-12-07 17:48:57,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:57,114 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 17:48:57,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119783594] [2019-12-07 17:48:57,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:57,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:48:57,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384307681] [2019-12-07 17:48:57,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:48:57,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:57,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:48:57,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:48:57,116 INFO L87 Difference]: Start difference. First operand 859 states and 1946 transitions. Second operand 6 states. [2019-12-07 17:48:57,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:57,511 INFO L93 Difference]: Finished difference Result 1487 states and 3250 transitions. [2019-12-07 17:48:57,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:48:57,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-07 17:48:57,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:57,513 INFO L225 Difference]: With dead ends: 1487 [2019-12-07 17:48:57,513 INFO L226 Difference]: Without dead ends: 1487 [2019-12-07 17:48:57,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:48:57,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-12-07 17:48:57,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1149. [2019-12-07 17:48:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2019-12-07 17:48:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 2588 transitions. [2019-12-07 17:48:57,527 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 2588 transitions. Word has length 52 [2019-12-07 17:48:57,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:57,527 INFO L462 AbstractCegarLoop]: Abstraction has 1149 states and 2588 transitions. [2019-12-07 17:48:57,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:48:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 2588 transitions. [2019-12-07 17:48:57,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:48:57,529 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:57,529 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 17:48:57,529 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:57,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:57,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1913367860, now seen corresponding path program 2 times [2019-12-07 17:48:57,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:57,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855771657] [2019-12-07 17:48:57,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:57,605 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 17:48:57,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855771657] [2019-12-07 17:48:57,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:57,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:48:57,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51327027] [2019-12-07 17:48:57,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:48:57,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:57,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:48:57,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:57,606 INFO L87 Difference]: Start difference. First operand 1149 states and 2588 transitions. Second operand 3 states. [2019-12-07 17:48:57,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:57,642 INFO L93 Difference]: Finished difference Result 1408 states and 3131 transitions. [2019-12-07 17:48:57,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:48:57,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 17:48:57,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:57,644 INFO L225 Difference]: With dead ends: 1408 [2019-12-07 17:48:57,644 INFO L226 Difference]: Without dead ends: 1408 [2019-12-07 17:48:57,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2019-12-07 17:48:57,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1153. [2019-12-07 17:48:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-12-07 17:48:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 2605 transitions. [2019-12-07 17:48:57,654 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 2605 transitions. Word has length 52 [2019-12-07 17:48:57,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:57,654 INFO L462 AbstractCegarLoop]: Abstraction has 1153 states and 2605 transitions. [2019-12-07 17:48:57,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:48:57,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 2605 transitions. [2019-12-07 17:48:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:48:57,656 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:57,656 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 17:48:57,656 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:57,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:57,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1717636000, now seen corresponding path program 1 times [2019-12-07 17:48:57,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:57,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462992148] [2019-12-07 17:48:57,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:57,686 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 17:48:57,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462992148] [2019-12-07 17:48:57,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:57,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:48:57,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772793587] [2019-12-07 17:48:57,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:48:57,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:57,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:48:57,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:48:57,688 INFO L87 Difference]: Start difference. First operand 1153 states and 2605 transitions. Second operand 4 states. [2019-12-07 17:48:57,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:57,801 INFO L93 Difference]: Finished difference Result 1870 states and 4212 transitions. [2019-12-07 17:48:57,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:48:57,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-07 17:48:57,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:57,803 INFO L225 Difference]: With dead ends: 1870 [2019-12-07 17:48:57,803 INFO L226 Difference]: Without dead ends: 1870 [2019-12-07 17:48:57,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:48:57,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-12-07 17:48:57,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1239. [2019-12-07 17:48:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-12-07 17:48:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2834 transitions. [2019-12-07 17:48:57,816 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2834 transitions. Word has length 53 [2019-12-07 17:48:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:57,817 INFO L462 AbstractCegarLoop]: Abstraction has 1239 states and 2834 transitions. [2019-12-07 17:48:57,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:48:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2834 transitions. [2019-12-07 17:48:57,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:48:57,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:57,818 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 17:48:57,818 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:57,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:57,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1264660564, now seen corresponding path program 1 times [2019-12-07 17:48:57,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:57,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754431440] [2019-12-07 17:48:57,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:57,862 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 17:48:57,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754431440] [2019-12-07 17:48:57,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:57,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:48:57,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269305799] [2019-12-07 17:48:57,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:48:57,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:57,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:48:57,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:48:57,863 INFO L87 Difference]: Start difference. First operand 1239 states and 2834 transitions. Second operand 4 states. [2019-12-07 17:48:57,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:57,908 INFO L93 Difference]: Finished difference Result 1239 states and 2819 transitions. [2019-12-07 17:48:57,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:48:57,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-07 17:48:57,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:57,909 INFO L225 Difference]: With dead ends: 1239 [2019-12-07 17:48:57,909 INFO L226 Difference]: Without dead ends: 1239 [2019-12-07 17:48:57,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:48:57,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2019-12-07 17:48:57,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1050. [2019-12-07 17:48:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-12-07 17:48:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 2362 transitions. [2019-12-07 17:48:57,918 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 2362 transitions. Word has length 53 [2019-12-07 17:48:57,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:57,918 INFO L462 AbstractCegarLoop]: Abstraction has 1050 states and 2362 transitions. [2019-12-07 17:48:57,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:48:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 2362 transitions. [2019-12-07 17:48:57,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:48:57,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:57,920 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 17:48:57,920 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:57,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:57,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1299337590, now seen corresponding path program 1 times [2019-12-07 17:48:57,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:57,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283207943] [2019-12-07 17:48:57,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:58,070 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 17:48:58,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283207943] [2019-12-07 17:48:58,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:58,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:48:58,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433238750] [2019-12-07 17:48:58,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:48:58,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:58,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:48:58,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:48:58,071 INFO L87 Difference]: Start difference. First operand 1050 states and 2362 transitions. Second operand 10 states. [2019-12-07 17:48:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:58,453 INFO L93 Difference]: Finished difference Result 2655 states and 5878 transitions. [2019-12-07 17:48:58,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:48:58,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-07 17:48:58,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:58,454 INFO L225 Difference]: With dead ends: 2655 [2019-12-07 17:48:58,454 INFO L226 Difference]: Without dead ends: 835 [2019-12-07 17:48:58,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:48:58,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-12-07 17:48:58,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2019-12-07 17:48:58,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-12-07 17:48:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1892 transitions. [2019-12-07 17:48:58,465 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1892 transitions. Word has length 53 [2019-12-07 17:48:58,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:58,465 INFO L462 AbstractCegarLoop]: Abstraction has 835 states and 1892 transitions. [2019-12-07 17:48:58,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:48:58,465 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1892 transitions. [2019-12-07 17:48:58,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:48:58,467 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:58,467 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 17:48:58,467 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:58,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:58,467 INFO L82 PathProgramCache]: Analyzing trace with hash -779576130, now seen corresponding path program 2 times [2019-12-07 17:48:58,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:58,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774363775] [2019-12-07 17:48:58,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:58,542 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 17:48:58,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774363775] [2019-12-07 17:48:58,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:58,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:48:58,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232362688] [2019-12-07 17:48:58,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:48:58,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:58,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:48:58,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:48:58,544 INFO L87 Difference]: Start difference. First operand 835 states and 1892 transitions. Second operand 7 states. [2019-12-07 17:48:58,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:58,702 INFO L93 Difference]: Finished difference Result 2260 states and 4792 transitions. [2019-12-07 17:48:58,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:48:58,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 17:48:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:58,703 INFO L225 Difference]: With dead ends: 2260 [2019-12-07 17:48:58,703 INFO L226 Difference]: Without dead ends: 1527 [2019-12-07 17:48:58,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:48:58,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2019-12-07 17:48:58,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 861. [2019-12-07 17:48:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-12-07 17:48:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1933 transitions. [2019-12-07 17:48:58,712 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1933 transitions. Word has length 53 [2019-12-07 17:48:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:58,712 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1933 transitions. [2019-12-07 17:48:58,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:48:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1933 transitions. [2019-12-07 17:48:58,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:48:58,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:58,713 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 17:48:58,713 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:58,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:58,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1691396374, now seen corresponding path program 3 times [2019-12-07 17:48:58,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:58,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842325567] [2019-12-07 17:48:58,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:48:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:48:58,780 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:48:58,780 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:48:58,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t833~0.base_35|)) (= 0 v_~a$w_buff1~0_316) (= (store .cse0 |v_ULTIMATE.start_main_~#t833~0.base_35| 1) |v_#valid_63|) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_cnt~0_62) (= v_~z~0_11 0) (= 0 v_~a$read_delayed~0_7) (= v_~y~0_90 0) (= 0 v_~a$r_buff1_thd2~0_271) (= v_~__unbuffered_p1_EBX~0_60 0) (= v_~a$flush_delayed~0_23 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= |v_ULTIMATE.start_main_~#t833~0.offset_23| 0) (= 0 v_~a$w_buff0_used~0_830) (= 0 v_~a$w_buff1_used~0_501) (= 0 |v_#NULL.base_4|) (= v_~x~0_85 0) (= 0 v_~a$r_buff1_thd1~0_132) (= 0 v_~weak$$choice0~0_11) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t833~0.base_35| 4)) (= 0 v_~a$r_buff0_thd1~0_236) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~a$r_buff0_thd2~0_373) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t833~0.base_35| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t833~0.base_35|) |v_ULTIMATE.start_main_~#t833~0.offset_23| 0)) |v_#memory_int_13|) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_115 0) (= v_~a$mem_tmp~0_14 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t833~0.base_35|) (= v_~weak$$choice2~0_107 0) (= v_~a~0_150 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~a$r_buff1_thd0~0_178 0) (= v_~a$r_buff0_thd0~0_163 0) (= v_~a$w_buff0~0_518 0) (= 0 v_~__unbuffered_p1_EAX~0_46) (= 0 v_~__unbuffered_p0_EAX~0_117))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_271, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_373, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ULTIMATE.start_main_~#t834~0.base=|v_ULTIMATE.start_main_~#t834~0.base_27|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~a~0=v_~a~0_150, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_117, ~a$w_buff1~0=v_~a$w_buff1~0_316, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_60, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_115, ULTIMATE.start_main_~#t833~0.offset=|v_ULTIMATE.start_main_~#t833~0.offset_23|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_132, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_830, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_236, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_95|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_87|, ULTIMATE.start_main_~#t834~0.offset=|v_ULTIMATE.start_main_~#t834~0.offset_16|, ~a$w_buff0~0=v_~a$w_buff0~0_518, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_178, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_11, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_501, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~x~0=v_~x~0_85, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t833~0.base=|v_ULTIMATE.start_main_~#t833~0.base_35|} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t834~0.base, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t833~0.offset, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t834~0.offset, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t833~0.base] because there is no mapped edge [2019-12-07 17:48:58,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (= ~a$w_buff1~0_Out-1201629646 ~a$w_buff0~0_In-1201629646) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1201629646| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1201629646) (= ~a$w_buff1_used~0_Out-1201629646 ~a$w_buff0_used~0_In-1201629646) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1201629646| P0Thread1of1ForFork0_~arg.offset_Out-1201629646) (= ~a$w_buff0~0_Out-1201629646 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1201629646| (ite (not (and (not (= 0 (mod ~a$w_buff1_used~0_Out-1201629646 256))) (not (= (mod ~a$w_buff0_used~0_Out-1201629646 256) 0)))) 1 0)) (= |P0Thread1of1ForFork0_#in~arg.base_In-1201629646| P0Thread1of1ForFork0_~arg.base_Out-1201629646) (= 1 ~a$w_buff0_used~0_Out-1201629646) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1201629646 0))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1201629646|, ~a$w_buff0~0=~a$w_buff0~0_In-1201629646, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1201629646|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1201629646} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1201629646|, ~a$w_buff1~0=~a$w_buff1~0_Out-1201629646, ~a$w_buff0~0=~a$w_buff0~0_Out-1201629646, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1201629646, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1201629646|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-1201629646, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-1201629646, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1201629646, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1201629646|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1201629646} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 17:48:58,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L814-1-->L816: Formula: (and (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t834~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t834~0.base_10| 0)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t834~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t834~0.base_10|) |v_ULTIMATE.start_main_~#t834~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t834~0.offset_9| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t834~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t834~0.base_10|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t834~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t834~0.base=|v_ULTIMATE.start_main_~#t834~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t834~0.offset=|v_ULTIMATE.start_main_~#t834~0.offset_9|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t834~0.base, ULTIMATE.start_main_~#t834~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:48:58,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In667199615 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out667199615| |P1Thread1of1ForFork1_#t~ite24_Out667199615|) (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In667199615 256)))) (or (and (= 0 (mod ~a$r_buff1_thd2~0_In667199615 256)) .cse0) (= 0 (mod ~a$w_buff0_used~0_In667199615 256)) (and (= (mod ~a$w_buff1_used~0_In667199615 256) 0) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out667199615| ~a$w_buff1_used~0_In667199615)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite23_In667199615| |P1Thread1of1ForFork1_#t~ite23_Out667199615|) (= ~a$w_buff1_used~0_In667199615 |P1Thread1of1ForFork1_#t~ite24_Out667199615|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In667199615, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In667199615, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In667199615|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In667199615, ~a$w_buff1_used~0=~a$w_buff1_used~0_In667199615, ~weak$$choice2~0=~weak$$choice2~0_In667199615} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In667199615, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out667199615|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In667199615, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out667199615|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In667199615, ~a$w_buff1_used~0=~a$w_buff1_used~0_In667199615, ~weak$$choice2~0=~weak$$choice2~0_In667199615} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 17:48:58,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= (mod v_~weak$$choice2~0_38 256) 0)) (= v_~a$r_buff0_thd2~0_146 v_~a$r_buff0_thd2~0_147)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_6|, ~weak$$choice2~0=v_~weak$$choice2~0_38, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:48:58,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1698882912 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1698882912 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1698882912| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1698882912| ~a$w_buff0_used~0_In-1698882912)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1698882912, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1698882912} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1698882912|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1698882912, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1698882912} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:48:58,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In479880670 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In479880670 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In479880670 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In479880670 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out479880670|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~a$w_buff1_used~0_In479880670 |P0Thread1of1ForFork0_#t~ite6_Out479880670|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In479880670, ~a$w_buff0_used~0=~a$w_buff0_used~0_In479880670, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In479880670, ~a$w_buff1_used~0=~a$w_buff1_used~0_In479880670} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out479880670|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In479880670, ~a$w_buff0_used~0=~a$w_buff0_used~0_In479880670, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In479880670, ~a$w_buff1_used~0=~a$w_buff1_used~0_In479880670} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:48:58,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-93811009 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-93811009 256))) (.cse2 (= ~a$r_buff0_thd1~0_In-93811009 ~a$r_buff0_thd1~0_Out-93811009))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-93811009)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-93811009, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-93811009} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-93811009|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-93811009, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-93811009} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:48:58,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In1545942081 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1545942081 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1545942081 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1545942081 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1545942081| ~a$r_buff1_thd1~0_In1545942081) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1545942081| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1545942081, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1545942081, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1545942081, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1545942081} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1545942081, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1545942081|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1545942081, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1545942081, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1545942081} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:48:58,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L756-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:48:58,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_14 256))) (= v_~a~0_48 v_~a$mem_tmp~0_7) (= v_~a$flush_delayed~0_13 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_14} OutVars{~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_11|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 17:48:58,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out1966587189| |P1Thread1of1ForFork1_#t~ite32_Out1966587189|)) (.cse0 (= (mod ~a$w_buff1_used~0_In1966587189 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In1966587189 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~a~0_In1966587189 |P1Thread1of1ForFork1_#t~ite32_Out1966587189|)) (and .cse2 (= ~a$w_buff1~0_In1966587189 |P1Thread1of1ForFork1_#t~ite32_Out1966587189|) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In1966587189, ~a$w_buff1~0=~a$w_buff1~0_In1966587189, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1966587189, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1966587189} OutVars{~a~0=~a~0_In1966587189, ~a$w_buff1~0=~a$w_buff1~0_In1966587189, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1966587189, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1966587189|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1966587189|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1966587189} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 17:48:58,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In2142947114 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In2142947114 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out2142947114| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out2142947114| ~a$w_buff0_used~0_In2142947114)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2142947114, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2142947114} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out2142947114|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2142947114, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2142947114} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:48:58,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-912738815 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-912738815 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-912738815 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-912738815 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-912738815 |P1Thread1of1ForFork1_#t~ite35_Out-912738815|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-912738815| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-912738815, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-912738815, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-912738815, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-912738815} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-912738815, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-912738815, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-912738815, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-912738815|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-912738815} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:48:58,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In630509908 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In630509908 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out630509908| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out630509908| ~a$r_buff0_thd2~0_In630509908)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In630509908, ~a$w_buff0_used~0=~a$w_buff0_used~0_In630509908} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In630509908, ~a$w_buff0_used~0=~a$w_buff0_used~0_In630509908, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out630509908|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:48:58,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-689521726 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-689521726 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-689521726 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-689521726 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out-689521726| ~a$r_buff1_thd2~0_In-689521726)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-689521726| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-689521726, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-689521726, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-689521726, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-689521726} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-689521726, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-689521726, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-689521726, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-689521726, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-689521726|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:48:58,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L795-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite37_22| v_~a$r_buff1_thd2~0_110) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:48:58,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) 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_9, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 17:48:58,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1033512127 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1033512127 256)))) (or (and (= ~a$w_buff1~0_In1033512127 |ULTIMATE.start_main_#t~ite40_Out1033512127|) (not .cse0) (not .cse1)) (and (= ~a~0_In1033512127 |ULTIMATE.start_main_#t~ite40_Out1033512127|) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In1033512127, ~a$w_buff1~0=~a$w_buff1~0_In1033512127, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1033512127, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1033512127} OutVars{~a~0=~a~0_In1033512127, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1033512127|, ~a$w_buff1~0=~a$w_buff1~0_In1033512127, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1033512127, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1033512127} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:48:58,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_26 |v_ULTIMATE.start_main_#t~ite40_17|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|} OutVars{~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:48:58,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-316541254 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-316541254 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-316541254 |ULTIMATE.start_main_#t~ite42_Out-316541254|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-316541254| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-316541254, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-316541254} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-316541254, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-316541254, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-316541254|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:48:58,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1543772730 256))) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-1543772730 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-1543772730 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1543772730 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1543772730| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1543772730| ~a$w_buff1_used~0_In-1543772730)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1543772730, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1543772730, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1543772730, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1543772730} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1543772730, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1543772730, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1543772730, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1543772730, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1543772730|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:48:58,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1090346624 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1090346624 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1090346624| ~a$r_buff0_thd0~0_In-1090346624) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1090346624|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1090346624, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1090346624} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1090346624, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1090346624, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1090346624|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:48:58,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1219085959 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-1219085959 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1219085959 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1219085959 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1219085959| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-1219085959| ~a$r_buff1_thd0~0_In-1219085959)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1219085959, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1219085959, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1219085959, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1219085959} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1219085959, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1219085959, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1219085959, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1219085959, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1219085959|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:48:58,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~a$r_buff1_thd0~0_147 |v_ULTIMATE.start_main_#t~ite45_39|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_86 0) (= 1 v_~__unbuffered_p1_EAX~0_18) (= 1 v_~__unbuffered_p0_EAX~0_88))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |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_88, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_147, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$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 17:48:58,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:48:58 BasicIcfg [2019-12-07 17:48:58,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:48:58,837 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:48:58,837 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:48:58,837 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:48:58,838 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:48:49" (3/4) ... [2019-12-07 17:48:58,839 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:48:58,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t833~0.base_35|)) (= 0 v_~a$w_buff1~0_316) (= (store .cse0 |v_ULTIMATE.start_main_~#t833~0.base_35| 1) |v_#valid_63|) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_cnt~0_62) (= v_~z~0_11 0) (= 0 v_~a$read_delayed~0_7) (= v_~y~0_90 0) (= 0 v_~a$r_buff1_thd2~0_271) (= v_~__unbuffered_p1_EBX~0_60 0) (= v_~a$flush_delayed~0_23 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= |v_ULTIMATE.start_main_~#t833~0.offset_23| 0) (= 0 v_~a$w_buff0_used~0_830) (= 0 v_~a$w_buff1_used~0_501) (= 0 |v_#NULL.base_4|) (= v_~x~0_85 0) (= 0 v_~a$r_buff1_thd1~0_132) (= 0 v_~weak$$choice0~0_11) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t833~0.base_35| 4)) (= 0 v_~a$r_buff0_thd1~0_236) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~a$r_buff0_thd2~0_373) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t833~0.base_35| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t833~0.base_35|) |v_ULTIMATE.start_main_~#t833~0.offset_23| 0)) |v_#memory_int_13|) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_115 0) (= v_~a$mem_tmp~0_14 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t833~0.base_35|) (= v_~weak$$choice2~0_107 0) (= v_~a~0_150 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~a$r_buff1_thd0~0_178 0) (= v_~a$r_buff0_thd0~0_163 0) (= v_~a$w_buff0~0_518 0) (= 0 v_~__unbuffered_p1_EAX~0_46) (= 0 v_~__unbuffered_p0_EAX~0_117))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_271, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_373, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ULTIMATE.start_main_~#t834~0.base=|v_ULTIMATE.start_main_~#t834~0.base_27|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~a~0=v_~a~0_150, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_117, ~a$w_buff1~0=v_~a$w_buff1~0_316, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_60, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_115, ULTIMATE.start_main_~#t833~0.offset=|v_ULTIMATE.start_main_~#t833~0.offset_23|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_132, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_830, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_236, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_95|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_87|, ULTIMATE.start_main_~#t834~0.offset=|v_ULTIMATE.start_main_~#t834~0.offset_16|, ~a$w_buff0~0=v_~a$w_buff0~0_518, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_178, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_11, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_501, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~x~0=v_~x~0_85, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t833~0.base=|v_ULTIMATE.start_main_~#t833~0.base_35|} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t834~0.base, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t833~0.offset, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t834~0.offset, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t833~0.base] because there is no mapped edge [2019-12-07 17:48:58,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (= ~a$w_buff1~0_Out-1201629646 ~a$w_buff0~0_In-1201629646) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1201629646| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1201629646) (= ~a$w_buff1_used~0_Out-1201629646 ~a$w_buff0_used~0_In-1201629646) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1201629646| P0Thread1of1ForFork0_~arg.offset_Out-1201629646) (= ~a$w_buff0~0_Out-1201629646 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1201629646| (ite (not (and (not (= 0 (mod ~a$w_buff1_used~0_Out-1201629646 256))) (not (= (mod ~a$w_buff0_used~0_Out-1201629646 256) 0)))) 1 0)) (= |P0Thread1of1ForFork0_#in~arg.base_In-1201629646| P0Thread1of1ForFork0_~arg.base_Out-1201629646) (= 1 ~a$w_buff0_used~0_Out-1201629646) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1201629646 0))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1201629646|, ~a$w_buff0~0=~a$w_buff0~0_In-1201629646, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1201629646|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1201629646} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1201629646|, ~a$w_buff1~0=~a$w_buff1~0_Out-1201629646, ~a$w_buff0~0=~a$w_buff0~0_Out-1201629646, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1201629646, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1201629646|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-1201629646, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-1201629646, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1201629646, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1201629646|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1201629646} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 17:48:58,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L814-1-->L816: Formula: (and (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t834~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t834~0.base_10| 0)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t834~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t834~0.base_10|) |v_ULTIMATE.start_main_~#t834~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t834~0.offset_9| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t834~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t834~0.base_10|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t834~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t834~0.base=|v_ULTIMATE.start_main_~#t834~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t834~0.offset=|v_ULTIMATE.start_main_~#t834~0.offset_9|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t834~0.base, ULTIMATE.start_main_~#t834~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:48:58,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In667199615 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out667199615| |P1Thread1of1ForFork1_#t~ite24_Out667199615|) (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In667199615 256)))) (or (and (= 0 (mod ~a$r_buff1_thd2~0_In667199615 256)) .cse0) (= 0 (mod ~a$w_buff0_used~0_In667199615 256)) (and (= (mod ~a$w_buff1_used~0_In667199615 256) 0) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out667199615| ~a$w_buff1_used~0_In667199615)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite23_In667199615| |P1Thread1of1ForFork1_#t~ite23_Out667199615|) (= ~a$w_buff1_used~0_In667199615 |P1Thread1of1ForFork1_#t~ite24_Out667199615|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In667199615, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In667199615, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In667199615|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In667199615, ~a$w_buff1_used~0=~a$w_buff1_used~0_In667199615, ~weak$$choice2~0=~weak$$choice2~0_In667199615} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In667199615, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out667199615|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In667199615, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out667199615|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In667199615, ~a$w_buff1_used~0=~a$w_buff1_used~0_In667199615, ~weak$$choice2~0=~weak$$choice2~0_In667199615} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 17:48:58,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= (mod v_~weak$$choice2~0_38 256) 0)) (= v_~a$r_buff0_thd2~0_146 v_~a$r_buff0_thd2~0_147)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_6|, ~weak$$choice2~0=v_~weak$$choice2~0_38, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:48:58,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1698882912 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1698882912 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1698882912| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1698882912| ~a$w_buff0_used~0_In-1698882912)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1698882912, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1698882912} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1698882912|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1698882912, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1698882912} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:48:58,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In479880670 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In479880670 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In479880670 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In479880670 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out479880670|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~a$w_buff1_used~0_In479880670 |P0Thread1of1ForFork0_#t~ite6_Out479880670|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In479880670, ~a$w_buff0_used~0=~a$w_buff0_used~0_In479880670, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In479880670, ~a$w_buff1_used~0=~a$w_buff1_used~0_In479880670} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out479880670|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In479880670, ~a$w_buff0_used~0=~a$w_buff0_used~0_In479880670, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In479880670, ~a$w_buff1_used~0=~a$w_buff1_used~0_In479880670} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:48:58,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-93811009 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-93811009 256))) (.cse2 (= ~a$r_buff0_thd1~0_In-93811009 ~a$r_buff0_thd1~0_Out-93811009))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-93811009)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-93811009, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-93811009} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-93811009|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-93811009, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-93811009} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:48:58,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In1545942081 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1545942081 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1545942081 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1545942081 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1545942081| ~a$r_buff1_thd1~0_In1545942081) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1545942081| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1545942081, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1545942081, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1545942081, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1545942081} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1545942081, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1545942081|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1545942081, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1545942081, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1545942081} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:48:58,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L756-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:48:58,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_14 256))) (= v_~a~0_48 v_~a$mem_tmp~0_7) (= v_~a$flush_delayed~0_13 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_14} OutVars{~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_11|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 17:48:58,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out1966587189| |P1Thread1of1ForFork1_#t~ite32_Out1966587189|)) (.cse0 (= (mod ~a$w_buff1_used~0_In1966587189 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In1966587189 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~a~0_In1966587189 |P1Thread1of1ForFork1_#t~ite32_Out1966587189|)) (and .cse2 (= ~a$w_buff1~0_In1966587189 |P1Thread1of1ForFork1_#t~ite32_Out1966587189|) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In1966587189, ~a$w_buff1~0=~a$w_buff1~0_In1966587189, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1966587189, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1966587189} OutVars{~a~0=~a~0_In1966587189, ~a$w_buff1~0=~a$w_buff1~0_In1966587189, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1966587189, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1966587189|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1966587189|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1966587189} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 17:48:58,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In2142947114 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In2142947114 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out2142947114| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out2142947114| ~a$w_buff0_used~0_In2142947114)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2142947114, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2142947114} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out2142947114|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2142947114, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2142947114} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:48:58,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-912738815 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-912738815 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-912738815 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-912738815 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-912738815 |P1Thread1of1ForFork1_#t~ite35_Out-912738815|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-912738815| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-912738815, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-912738815, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-912738815, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-912738815} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-912738815, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-912738815, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-912738815, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-912738815|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-912738815} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:48:58,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In630509908 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In630509908 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out630509908| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out630509908| ~a$r_buff0_thd2~0_In630509908)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In630509908, ~a$w_buff0_used~0=~a$w_buff0_used~0_In630509908} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In630509908, ~a$w_buff0_used~0=~a$w_buff0_used~0_In630509908, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out630509908|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:48:58,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-689521726 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-689521726 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-689521726 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-689521726 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out-689521726| ~a$r_buff1_thd2~0_In-689521726)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-689521726| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-689521726, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-689521726, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-689521726, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-689521726} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-689521726, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-689521726, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-689521726, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-689521726, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-689521726|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:48:58,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L795-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite37_22| v_~a$r_buff1_thd2~0_110) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:48:58,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) 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_9, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 17:48:58,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1033512127 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1033512127 256)))) (or (and (= ~a$w_buff1~0_In1033512127 |ULTIMATE.start_main_#t~ite40_Out1033512127|) (not .cse0) (not .cse1)) (and (= ~a~0_In1033512127 |ULTIMATE.start_main_#t~ite40_Out1033512127|) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In1033512127, ~a$w_buff1~0=~a$w_buff1~0_In1033512127, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1033512127, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1033512127} OutVars{~a~0=~a~0_In1033512127, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1033512127|, ~a$w_buff1~0=~a$w_buff1~0_In1033512127, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1033512127, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1033512127} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:48:58,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_26 |v_ULTIMATE.start_main_#t~ite40_17|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|} OutVars{~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:48:58,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-316541254 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-316541254 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-316541254 |ULTIMATE.start_main_#t~ite42_Out-316541254|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-316541254| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-316541254, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-316541254} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-316541254, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-316541254, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-316541254|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:48:58,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1543772730 256))) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-1543772730 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-1543772730 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1543772730 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1543772730| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1543772730| ~a$w_buff1_used~0_In-1543772730)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1543772730, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1543772730, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1543772730, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1543772730} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1543772730, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1543772730, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1543772730, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1543772730, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1543772730|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:48:58,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1090346624 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1090346624 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1090346624| ~a$r_buff0_thd0~0_In-1090346624) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1090346624|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1090346624, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1090346624} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1090346624, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1090346624, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1090346624|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:48:58,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1219085959 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-1219085959 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1219085959 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1219085959 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1219085959| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-1219085959| ~a$r_buff1_thd0~0_In-1219085959)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1219085959, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1219085959, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1219085959, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1219085959} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1219085959, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1219085959, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1219085959, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1219085959, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1219085959|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:48:58,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~a$r_buff1_thd0~0_147 |v_ULTIMATE.start_main_#t~ite45_39|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_86 0) (= 1 v_~__unbuffered_p1_EAX~0_18) (= 1 v_~__unbuffered_p0_EAX~0_88))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |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_88, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_147, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$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 17:48:58,899 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0a6392cf-1dbe-4dc7-8fc1-41208fb7f98f/bin/uautomizer/witness.graphml [2019-12-07 17:48:58,899 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:48:58,900 INFO L168 Benchmark]: Toolchain (without parser) took 9778.85 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 420.5 MB). Free memory was 939.8 MB in the beginning and 945.7 MB in the end (delta: -6.0 MB). Peak memory consumption was 414.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:48:58,900 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 961.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:48:58,901 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -123.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:48:58,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.13 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 17:48:58,901 INFO L168 Benchmark]: Boogie Preprocessor took 26.71 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 17:48:58,901 INFO L168 Benchmark]: RCFGBuilder took 378.43 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: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:48:58,902 INFO L168 Benchmark]: TraceAbstraction took 8871.37 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 329.3 MB). Free memory was 1.0 GB in the beginning and 971.7 MB in the end (delta: 36.4 MB). Peak memory consumption was 365.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:48:58,902 INFO L168 Benchmark]: Witness Printer took 62.18 ms. Allocated memory is still 1.4 GB. Free memory was 971.7 MB in the beginning and 945.7 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:48:58,903 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 961.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 399.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -123.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.13 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 26.71 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 378.43 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: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8871.37 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 329.3 MB). Free memory was 1.0 GB in the beginning and 971.7 MB in the end (delta: 36.4 MB). Peak memory consumption was 365.7 MB. Max. memory is 11.5 GB. * Witness Printer took 62.18 ms. Allocated memory is still 1.4 GB. Free memory was 971.7 MB in the beginning and 945.7 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 151 ProgramPointsBefore, 77 ProgramPointsAfterwards, 185 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 5174 VarBasedMoverChecksPositive, 220 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 55357 CheckedPairsTotal, 107 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t833, ((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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$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, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1994 SDtfs, 2027 SDslu, 3645 SDs, 0 SdLazy, 2134 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 26 SyntacticMatches, 9 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14306occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 11446 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 535 NumberOfCodeBlocks, 535 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 466 ConstructedInterpolants, 0 QuantifiedInterpolants, 68948 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...