./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/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix031_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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-11-28 18:11:18,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:11:18,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:11:18,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:11:18,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:11:18,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:11:18,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:11:18,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:11:18,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:11:18,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:11:18,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:11:18,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:11:18,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:11:18,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:11:18,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:11:18,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:11:18,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:11:18,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:11:18,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:11:18,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:11:18,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:11:18,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:11:18,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:11:18,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:11:18,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:11:18,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:11:18,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:11:18,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:11:18,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:11:18,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:11:18,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:11:18,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:11:18,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:11:18,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:11:18,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:11:18,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:11:18,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:11:18,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:11:18,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:11:18,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:11:18,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:11:18,345 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:11:18,361 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:11:18,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:11:18,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:11:18,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:11:18,363 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:11:18,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:11:18,364 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:11:18,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:11:18,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:11:18,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:11:18,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:11:18,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:11:18,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:11:18,366 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:11:18,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:11:18,366 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:11:18,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:11:18,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:11:18,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:11:18,368 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:11:18,368 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:11:18,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:11:18,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:11:18,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:11:18,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:11:18,369 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:11:18,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:11:18,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:11:18,370 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:11:18,370 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-11-28 18:11:18,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:11:18,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:11:18,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:11:18,698 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:11:18,699 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:11:18,699 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix031_power.oepc.i [2019-11-28 18:11:18,760 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3df03edc/feed6ce2bc00444bae936286ff3e0704/FLAG06a0dce1b [2019-11-28 18:11:19,362 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:11:19,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix031_power.oepc.i [2019-11-28 18:11:19,379 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3df03edc/feed6ce2bc00444bae936286ff3e0704/FLAG06a0dce1b [2019-11-28 18:11:19,627 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3df03edc/feed6ce2bc00444bae936286ff3e0704 [2019-11-28 18:11:19,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:11:19,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:11:19,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:19,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:11:19,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:11:19,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:19" (1/1) ... [2019-11-28 18:11:19,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6822e6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:19, skipping insertion in model container [2019-11-28 18:11:19,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:19" (1/1) ... [2019-11-28 18:11:19,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:11:19,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:11:20,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:20,226 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:11:20,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:20,416 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:11:20,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:20 WrapperNode [2019-11-28 18:11:20,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:20,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:20,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:11:20,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:11:20,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:20" (1/1) ... [2019-11-28 18:11:20,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:20" (1/1) ... [2019-11-28 18:11:20,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:20,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:11:20,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:11:20,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:11:20,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:20" (1/1) ... [2019-11-28 18:11:20,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:20" (1/1) ... [2019-11-28 18:11:20,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:20" (1/1) ... [2019-11-28 18:11:20,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:20" (1/1) ... [2019-11-28 18:11:20,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:20" (1/1) ... [2019-11-28 18:11:20,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:20" (1/1) ... [2019-11-28 18:11:20,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:20" (1/1) ... [2019-11-28 18:11:20,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:11:20,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:11:20,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:11:20,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:11:20,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 18:11:20,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:11:20,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:11:20,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:11:20,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:11:20,613 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:11:20,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:11:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:11:20,614 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:11:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:11:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:11:20,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:11:20,617 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:11:21,282 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:11:21,283 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:11:21,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:21 BoogieIcfgContainer [2019-11-28 18:11:21,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:11:21,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:11:21,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:11:21,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:11:21,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:11:19" (1/3) ... [2019-11-28 18:11:21,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a3a0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:21, skipping insertion in model container [2019-11-28 18:11:21,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:20" (2/3) ... [2019-11-28 18:11:21,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a3a0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:21, skipping insertion in model container [2019-11-28 18:11:21,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:21" (3/3) ... [2019-11-28 18:11:21,293 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.oepc.i [2019-11-28 18:11:21,301 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:11:21,301 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:11:21,309 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:11:21,310 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:11:21,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,347 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,347 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,348 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,348 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,349 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,358 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,358 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:21,405 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:11:21,427 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:11:21,428 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:11:21,428 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:11:21,428 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:11:21,428 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:11:21,428 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:11:21,429 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:11:21,429 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:11:21,447 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-11-28 18:11:21,450 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-11-28 18:11:21,537 INFO L134 PetriNetUnfolder]: 41/183 cut-off events. [2019-11-28 18:11:21,538 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:11:21,556 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-11-28 18:11:21,584 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-11-28 18:11:21,635 INFO L134 PetriNetUnfolder]: 41/183 cut-off events. [2019-11-28 18:11:21,635 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:11:21,647 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-11-28 18:11:21,676 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:11:21,678 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:11:26,889 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-11-28 18:11:27,017 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 18:11:27,041 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55357 [2019-11-28 18:11:27,042 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-11-28 18:11:27,045 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-11-28 18:11:27,632 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-11-28 18:11:27,636 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-11-28 18:11:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:11:27,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:27,646 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:11:27,646 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:27,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:27,656 INFO L82 PathProgramCache]: Analyzing trace with hash 801135, now seen corresponding path program 1 times [2019-11-28 18:11:27,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:27,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685962039] [2019-11-28 18:11:27,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:27,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685962039] [2019-11-28 18:11:27,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:27,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:11:27,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242716450] [2019-11-28 18:11:27,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:27,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:27,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:27,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:27,984 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-11-28 18:11:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:28,319 INFO L93 Difference]: Finished difference Result 8472 states and 28002 transitions. [2019-11-28 18:11:28,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:28,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:11:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:28,430 INFO L225 Difference]: With dead ends: 8472 [2019-11-28 18:11:28,430 INFO L226 Difference]: Without dead ends: 7980 [2019-11-28 18:11:28,432 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-11-28 18:11:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7980 states. [2019-11-28 18:11:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7980 to 7980. [2019-11-28 18:11:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7980 states. [2019-11-28 18:11:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 26329 transitions. [2019-11-28 18:11:28,931 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 26329 transitions. Word has length 3 [2019-11-28 18:11:28,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:28,932 INFO L462 AbstractCegarLoop]: Abstraction has 7980 states and 26329 transitions. [2019-11-28 18:11:28,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:28,932 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 26329 transitions. [2019-11-28 18:11:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:11:28,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:28,939 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:28,940 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:28,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:28,940 INFO L82 PathProgramCache]: Analyzing trace with hash -337363797, now seen corresponding path program 1 times [2019-11-28 18:11:28,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:28,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886949312] [2019-11-28 18:11:28,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:29,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886949312] [2019-11-28 18:11:29,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:29,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:29,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492667095] [2019-11-28 18:11:29,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:29,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:29,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:29,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:29,119 INFO L87 Difference]: Start difference. First operand 7980 states and 26329 transitions. Second operand 4 states. [2019-11-28 18:11:29,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:29,590 INFO L93 Difference]: Finished difference Result 12172 states and 38421 transitions. [2019-11-28 18:11:29,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:29,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:11:29,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:29,682 INFO L225 Difference]: With dead ends: 12172 [2019-11-28 18:11:29,682 INFO L226 Difference]: Without dead ends: 12165 [2019-11-28 18:11:29,683 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-11-28 18:11:29,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12165 states. [2019-11-28 18:11:30,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12165 to 10976. [2019-11-28 18:11:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10976 states. [2019-11-28 18:11:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10976 states to 10976 states and 35289 transitions. [2019-11-28 18:11:30,225 INFO L78 Accepts]: Start accepts. Automaton has 10976 states and 35289 transitions. Word has length 11 [2019-11-28 18:11:30,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:30,226 INFO L462 AbstractCegarLoop]: Abstraction has 10976 states and 35289 transitions. [2019-11-28 18:11:30,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 10976 states and 35289 transitions. [2019-11-28 18:11:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:30,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:30,232 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:30,233 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:30,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:30,233 INFO L82 PathProgramCache]: Analyzing trace with hash 254708639, now seen corresponding path program 1 times [2019-11-28 18:11:30,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:30,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37432867] [2019-11-28 18:11:30,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:30,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37432867] [2019-11-28 18:11:30,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:30,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:30,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944040287] [2019-11-28 18:11:30,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:30,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:30,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:30,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:30,287 INFO L87 Difference]: Start difference. First operand 10976 states and 35289 transitions. Second operand 3 states. [2019-11-28 18:11:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:30,414 INFO L93 Difference]: Finished difference Result 16162 states and 51860 transitions. [2019-11-28 18:11:30,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:30,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:11:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:30,471 INFO L225 Difference]: With dead ends: 16162 [2019-11-28 18:11:30,471 INFO L226 Difference]: Without dead ends: 16162 [2019-11-28 18:11:30,472 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-11-28 18:11:30,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16162 states. [2019-11-28 18:11:30,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16162 to 12780. [2019-11-28 18:11:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12780 states. [2019-11-28 18:11:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12780 states to 12780 states and 41531 transitions. [2019-11-28 18:11:30,926 INFO L78 Accepts]: Start accepts. Automaton has 12780 states and 41531 transitions. Word has length 14 [2019-11-28 18:11:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:30,928 INFO L462 AbstractCegarLoop]: Abstraction has 12780 states and 41531 transitions. [2019-11-28 18:11:30,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 12780 states and 41531 transitions. [2019-11-28 18:11:30,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:30,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:30,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:30,932 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:30,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:30,932 INFO L82 PathProgramCache]: Analyzing trace with hash 254810970, now seen corresponding path program 1 times [2019-11-28 18:11:30,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:30,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043257984] [2019-11-28 18:11:30,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:31,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043257984] [2019-11-28 18:11:31,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:31,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:31,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891532024] [2019-11-28 18:11:31,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:31,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:31,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:31,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:31,049 INFO L87 Difference]: Start difference. First operand 12780 states and 41531 transitions. Second operand 4 states. [2019-11-28 18:11:31,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:31,273 INFO L93 Difference]: Finished difference Result 15429 states and 49294 transitions. [2019-11-28 18:11:31,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:31,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:11:31,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:31,323 INFO L225 Difference]: With dead ends: 15429 [2019-11-28 18:11:31,323 INFO L226 Difference]: Without dead ends: 15429 [2019-11-28 18:11:31,324 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-11-28 18:11:31,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15429 states. [2019-11-28 18:11:31,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15429 to 14033. [2019-11-28 18:11:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14033 states. [2019-11-28 18:11:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14033 states to 14033 states and 45307 transitions. [2019-11-28 18:11:31,931 INFO L78 Accepts]: Start accepts. Automaton has 14033 states and 45307 transitions. Word has length 14 [2019-11-28 18:11:31,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:31,932 INFO L462 AbstractCegarLoop]: Abstraction has 14033 states and 45307 transitions. [2019-11-28 18:11:31,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:31,932 INFO L276 IsEmpty]: Start isEmpty. Operand 14033 states and 45307 transitions. [2019-11-28 18:11:31,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:31,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:31,936 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:31,936 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:31,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:31,937 INFO L82 PathProgramCache]: Analyzing trace with hash 32652836, now seen corresponding path program 1 times [2019-11-28 18:11:31,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:31,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211367349] [2019-11-28 18:11:31,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:32,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211367349] [2019-11-28 18:11:32,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:32,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:32,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635900285] [2019-11-28 18:11:32,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:32,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:32,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:32,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:32,014 INFO L87 Difference]: Start difference. First operand 14033 states and 45307 transitions. Second operand 4 states. [2019-11-28 18:11:32,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:32,263 INFO L93 Difference]: Finished difference Result 16676 states and 53317 transitions. [2019-11-28 18:11:32,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:32,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:11:32,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:32,300 INFO L225 Difference]: With dead ends: 16676 [2019-11-28 18:11:32,301 INFO L226 Difference]: Without dead ends: 16676 [2019-11-28 18:11:32,301 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-11-28 18:11:32,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16676 states. [2019-11-28 18:11:32,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16676 to 14306. [2019-11-28 18:11:32,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14306 states. [2019-11-28 18:11:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14306 states to 14306 states and 46219 transitions. [2019-11-28 18:11:32,747 INFO L78 Accepts]: Start accepts. Automaton has 14306 states and 46219 transitions. Word has length 14 [2019-11-28 18:11:32,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:32,747 INFO L462 AbstractCegarLoop]: Abstraction has 14306 states and 46219 transitions. [2019-11-28 18:11:32,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:32,748 INFO L276 IsEmpty]: Start isEmpty. Operand 14306 states and 46219 transitions. [2019-11-28 18:11:32,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:11:32,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:32,752 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:32,753 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:32,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:32,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1305033028, now seen corresponding path program 1 times [2019-11-28 18:11:32,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:32,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663685629] [2019-11-28 18:11:32,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:32,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663685629] [2019-11-28 18:11:32,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:32,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:32,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818851416] [2019-11-28 18:11:32,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:32,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:32,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:32,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:32,826 INFO L87 Difference]: Start difference. First operand 14306 states and 46219 transitions. Second operand 3 states. [2019-11-28 18:11:32,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:32,894 INFO L93 Difference]: Finished difference Result 13528 states and 43047 transitions. [2019-11-28 18:11:32,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:32,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:11:32,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:32,922 INFO L225 Difference]: With dead ends: 13528 [2019-11-28 18:11:32,922 INFO L226 Difference]: Without dead ends: 13528 [2019-11-28 18:11:32,922 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-11-28 18:11:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13528 states. [2019-11-28 18:11:33,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13528 to 13448. [2019-11-28 18:11:33,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13448 states. [2019-11-28 18:11:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13448 states to 13448 states and 42815 transitions. [2019-11-28 18:11:33,364 INFO L78 Accepts]: Start accepts. Automaton has 13448 states and 42815 transitions. Word has length 16 [2019-11-28 18:11:33,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:33,364 INFO L462 AbstractCegarLoop]: Abstraction has 13448 states and 42815 transitions. [2019-11-28 18:11:33,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:33,365 INFO L276 IsEmpty]: Start isEmpty. Operand 13448 states and 42815 transitions. [2019-11-28 18:11:33,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:11:33,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:33,370 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:33,370 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:33,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:33,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1252676989, now seen corresponding path program 1 times [2019-11-28 18:11:33,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:33,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525583881] [2019-11-28 18:11:33,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:33,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525583881] [2019-11-28 18:11:33,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:33,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:33,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110821219] [2019-11-28 18:11:33,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:33,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:33,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:33,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:33,409 INFO L87 Difference]: Start difference. First operand 13448 states and 42815 transitions. Second operand 3 states. [2019-11-28 18:11:33,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:33,425 INFO L93 Difference]: Finished difference Result 1752 states and 4007 transitions. [2019-11-28 18:11:33,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:33,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:11:33,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:33,428 INFO L225 Difference]: With dead ends: 1752 [2019-11-28 18:11:33,429 INFO L226 Difference]: Without dead ends: 1752 [2019-11-28 18:11:33,429 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-11-28 18:11:33,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2019-11-28 18:11:33,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2019-11-28 18:11:33,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2019-11-28 18:11:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 4007 transitions. [2019-11-28 18:11:33,468 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 4007 transitions. Word has length 16 [2019-11-28 18:11:33,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:33,469 INFO L462 AbstractCegarLoop]: Abstraction has 1752 states and 4007 transitions. [2019-11-28 18:11:33,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:33,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 4007 transitions. [2019-11-28 18:11:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:11:33,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:33,472 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-11-28 18:11:33,473 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:33,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:33,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1595600556, now seen corresponding path program 1 times [2019-11-28 18:11:33,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:33,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240761669] [2019-11-28 18:11:33,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:33,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240761669] [2019-11-28 18:11:33,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:33,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:33,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228079005] [2019-11-28 18:11:33,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:11:33,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:33,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:11:33,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:33,547 INFO L87 Difference]: Start difference. First operand 1752 states and 4007 transitions. Second operand 5 states. [2019-11-28 18:11:33,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:33,902 INFO L93 Difference]: Finished difference Result 2261 states and 5020 transitions. [2019-11-28 18:11:33,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:11:33,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 18:11:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:33,906 INFO L225 Difference]: With dead ends: 2261 [2019-11-28 18:11:33,906 INFO L226 Difference]: Without dead ends: 2261 [2019-11-28 18:11:33,907 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-11-28 18:11:33,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2019-11-28 18:11:33,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 1820. [2019-11-28 18:11:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1820 states. [2019-11-28 18:11:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 4147 transitions. [2019-11-28 18:11:33,941 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 4147 transitions. Word has length 25 [2019-11-28 18:11:33,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:33,942 INFO L462 AbstractCegarLoop]: Abstraction has 1820 states and 4147 transitions. [2019-11-28 18:11:33,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:11:33,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 4147 transitions. [2019-11-28 18:11:33,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:11:33,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:33,945 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-11-28 18:11:33,945 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:33,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:33,946 INFO L82 PathProgramCache]: Analyzing trace with hash 532711466, now seen corresponding path program 1 times [2019-11-28 18:11:33,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:33,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854318092] [2019-11-28 18:11:33,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:34,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854318092] [2019-11-28 18:11:34,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:34,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:34,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955347164] [2019-11-28 18:11:34,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:11:34,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:34,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:11:34,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:34,075 INFO L87 Difference]: Start difference. First operand 1820 states and 4147 transitions. Second operand 5 states. [2019-11-28 18:11:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:34,296 INFO L93 Difference]: Finished difference Result 2275 states and 5049 transitions. [2019-11-28 18:11:34,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:11:34,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:11:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:34,301 INFO L225 Difference]: With dead ends: 2275 [2019-11-28 18:11:34,301 INFO L226 Difference]: Without dead ends: 2275 [2019-11-28 18:11:34,302 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-11-28 18:11:34,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2019-11-28 18:11:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 1766. [2019-11-28 18:11:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2019-11-28 18:11:34,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 4036 transitions. [2019-11-28 18:11:34,335 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 4036 transitions. Word has length 26 [2019-11-28 18:11:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:34,338 INFO L462 AbstractCegarLoop]: Abstraction has 1766 states and 4036 transitions. [2019-11-28 18:11:34,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:11:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 4036 transitions. [2019-11-28 18:11:34,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:11:34,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:34,342 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-11-28 18:11:34,342 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:34,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:34,343 INFO L82 PathProgramCache]: Analyzing trace with hash 898927989, now seen corresponding path program 1 times [2019-11-28 18:11:34,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:34,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082853116] [2019-11-28 18:11:34,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:34,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082853116] [2019-11-28 18:11:34,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:34,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:34,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993212474] [2019-11-28 18:11:34,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:34,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:34,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:34,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:34,407 INFO L87 Difference]: Start difference. First operand 1766 states and 4036 transitions. Second operand 4 states. [2019-11-28 18:11:34,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:34,422 INFO L93 Difference]: Finished difference Result 859 states and 1946 transitions. [2019-11-28 18:11:34,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:11:34,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-28 18:11:34,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:34,424 INFO L225 Difference]: With dead ends: 859 [2019-11-28 18:11:34,424 INFO L226 Difference]: Without dead ends: 859 [2019-11-28 18:11:34,425 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-11-28 18:11:34,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-11-28 18:11:34,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2019-11-28 18:11:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-28 18:11:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1946 transitions. [2019-11-28 18:11:34,437 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1946 transitions. Word has length 27 [2019-11-28 18:11:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:34,438 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1946 transitions. [2019-11-28 18:11:34,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:34,439 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1946 transitions. [2019-11-28 18:11:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:11:34,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:34,444 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-11-28 18:11:34,444 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:34,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:34,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1144531918, now seen corresponding path program 1 times [2019-11-28 18:11:34,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:34,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918863921] [2019-11-28 18:11:34,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:34,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918863921] [2019-11-28 18:11:34,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:34,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:11:34,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204111041] [2019-11-28 18:11:34,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:11:34,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:34,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:11:34,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:11:34,593 INFO L87 Difference]: Start difference. First operand 859 states and 1946 transitions. Second operand 6 states. [2019-11-28 18:11:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:35,199 INFO L93 Difference]: Finished difference Result 1487 states and 3250 transitions. [2019-11-28 18:11:35,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:11:35,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-28 18:11:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:35,202 INFO L225 Difference]: With dead ends: 1487 [2019-11-28 18:11:35,202 INFO L226 Difference]: Without dead ends: 1487 [2019-11-28 18:11:35,203 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-11-28 18:11:35,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-11-28 18:11:35,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1149. [2019-11-28 18:11:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2019-11-28 18:11:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 2588 transitions. [2019-11-28 18:11:35,222 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 2588 transitions. Word has length 52 [2019-11-28 18:11:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:35,223 INFO L462 AbstractCegarLoop]: Abstraction has 1149 states and 2588 transitions. [2019-11-28 18:11:35,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:11:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 2588 transitions. [2019-11-28 18:11:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:11:35,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:35,231 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-11-28 18:11:35,232 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:35,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:35,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1913367860, now seen corresponding path program 2 times [2019-11-28 18:11:35,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:35,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566515661] [2019-11-28 18:11:35,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:35,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566515661] [2019-11-28 18:11:35,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:35,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:35,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510976926] [2019-11-28 18:11:35,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:35,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:35,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:35,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:35,356 INFO L87 Difference]: Start difference. First operand 1149 states and 2588 transitions. Second operand 3 states. [2019-11-28 18:11:35,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:35,421 INFO L93 Difference]: Finished difference Result 1408 states and 3131 transitions. [2019-11-28 18:11:35,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:35,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:11:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:35,424 INFO L225 Difference]: With dead ends: 1408 [2019-11-28 18:11:35,424 INFO L226 Difference]: Without dead ends: 1408 [2019-11-28 18:11:35,424 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-11-28 18:11:35,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2019-11-28 18:11:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1153. [2019-11-28 18:11:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-11-28 18:11:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 2605 transitions. [2019-11-28 18:11:35,446 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 2605 transitions. Word has length 52 [2019-11-28 18:11:35,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:35,449 INFO L462 AbstractCegarLoop]: Abstraction has 1153 states and 2605 transitions. [2019-11-28 18:11:35,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 2605 transitions. [2019-11-28 18:11:35,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:11:35,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:35,452 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-11-28 18:11:35,452 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:35,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:35,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1717636000, now seen corresponding path program 1 times [2019-11-28 18:11:35,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:35,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124201877] [2019-11-28 18:11:35,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:35,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124201877] [2019-11-28 18:11:35,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:35,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:11:35,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778613423] [2019-11-28 18:11:35,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:35,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:35,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:35,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:35,526 INFO L87 Difference]: Start difference. First operand 1153 states and 2605 transitions. Second operand 4 states. [2019-11-28 18:11:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:35,739 INFO L93 Difference]: Finished difference Result 1870 states and 4212 transitions. [2019-11-28 18:11:35,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:35,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-28 18:11:35,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:35,742 INFO L225 Difference]: With dead ends: 1870 [2019-11-28 18:11:35,742 INFO L226 Difference]: Without dead ends: 1870 [2019-11-28 18:11:35,743 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-11-28 18:11:35,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-11-28 18:11:35,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1239. [2019-11-28 18:11:35,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-11-28 18:11:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2834 transitions. [2019-11-28 18:11:35,766 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2834 transitions. Word has length 53 [2019-11-28 18:11:35,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:35,766 INFO L462 AbstractCegarLoop]: Abstraction has 1239 states and 2834 transitions. [2019-11-28 18:11:35,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2834 transitions. [2019-11-28 18:11:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:11:35,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:35,770 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-11-28 18:11:35,770 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:35,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:35,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1264660564, now seen corresponding path program 1 times [2019-11-28 18:11:35,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:35,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010745328] [2019-11-28 18:11:35,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:35,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010745328] [2019-11-28 18:11:35,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:35,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:35,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390959994] [2019-11-28 18:11:35,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:35,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:35,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:35,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:35,881 INFO L87 Difference]: Start difference. First operand 1239 states and 2834 transitions. Second operand 4 states. [2019-11-28 18:11:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:35,950 INFO L93 Difference]: Finished difference Result 1239 states and 2819 transitions. [2019-11-28 18:11:35,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:11:35,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-28 18:11:35,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:35,954 INFO L225 Difference]: With dead ends: 1239 [2019-11-28 18:11:35,954 INFO L226 Difference]: Without dead ends: 1239 [2019-11-28 18:11:35,954 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-11-28 18:11:35,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2019-11-28 18:11:35,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1050. [2019-11-28 18:11:35,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-11-28 18:11:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 2362 transitions. [2019-11-28 18:11:35,972 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 2362 transitions. Word has length 53 [2019-11-28 18:11:35,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:35,972 INFO L462 AbstractCegarLoop]: Abstraction has 1050 states and 2362 transitions. [2019-11-28 18:11:35,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 2362 transitions. [2019-11-28 18:11:35,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:11:35,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:35,975 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-11-28 18:11:35,975 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:35,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:35,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1299337590, now seen corresponding path program 1 times [2019-11-28 18:11:35,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:35,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601794454] [2019-11-28 18:11:35,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:36,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601794454] [2019-11-28 18:11:36,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:36,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:11:36,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776486196] [2019-11-28 18:11:36,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:11:36,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:36,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:11:36,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:36,136 INFO L87 Difference]: Start difference. First operand 1050 states and 2362 transitions. Second operand 5 states. [2019-11-28 18:11:36,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:36,159 INFO L93 Difference]: Finished difference Result 1816 states and 4124 transitions. [2019-11-28 18:11:36,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:36,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-11-28 18:11:36,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:36,161 INFO L225 Difference]: With dead ends: 1816 [2019-11-28 18:11:36,161 INFO L226 Difference]: Without dead ends: 835 [2019-11-28 18:11:36,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:11:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-11-28 18:11:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2019-11-28 18:11:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-11-28 18:11:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1892 transitions. [2019-11-28 18:11:36,173 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1892 transitions. Word has length 53 [2019-11-28 18:11:36,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:36,173 INFO L462 AbstractCegarLoop]: Abstraction has 835 states and 1892 transitions. [2019-11-28 18:11:36,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:11:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1892 transitions. [2019-11-28 18:11:36,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:11:36,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:36,175 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-11-28 18:11:36,175 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:36,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:36,176 INFO L82 PathProgramCache]: Analyzing trace with hash -779576130, now seen corresponding path program 2 times [2019-11-28 18:11:36,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:36,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659928244] [2019-11-28 18:11:36,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:36,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659928244] [2019-11-28 18:11:36,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:36,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:11:36,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035578126] [2019-11-28 18:11:36,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:11:36,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:36,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:11:36,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:11:36,327 INFO L87 Difference]: Start difference. First operand 835 states and 1892 transitions. Second operand 7 states. [2019-11-28 18:11:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:36,608 INFO L93 Difference]: Finished difference Result 2260 states and 4792 transitions. [2019-11-28 18:11:36,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 18:11:36,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-28 18:11:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:36,611 INFO L225 Difference]: With dead ends: 2260 [2019-11-28 18:11:36,611 INFO L226 Difference]: Without dead ends: 1527 [2019-11-28 18:11:36,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-28 18:11:36,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2019-11-28 18:11:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 861. [2019-11-28 18:11:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-11-28 18:11:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1933 transitions. [2019-11-28 18:11:36,627 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1933 transitions. Word has length 53 [2019-11-28 18:11:36,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:36,628 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1933 transitions. [2019-11-28 18:11:36,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:11:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1933 transitions. [2019-11-28 18:11:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:11:36,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:36,631 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-11-28 18:11:36,631 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:36,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:36,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1691396374, now seen corresponding path program 3 times [2019-11-28 18:11:36,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:36,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79305726] [2019-11-28 18:11:36,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:11:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:11:36,738 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:11:36,738 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:11:36,743 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-11-28 18:11:36,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (= P0Thread1of1ForFork0_~arg.base_Out-309185947 |P0Thread1of1ForFork0_#in~arg.base_In-309185947|) (= 1 ~a$w_buff0~0_Out-309185947) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-309185947)) (= ~a$w_buff1~0_Out-309185947 ~a$w_buff0~0_In-309185947) (= |P0Thread1of1ForFork0_#in~arg.offset_In-309185947| P0Thread1of1ForFork0_~arg.offset_Out-309185947) (= ~a$w_buff1_used~0_Out-309185947 ~a$w_buff0_used~0_In-309185947) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-309185947| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-309185947) (= (ite (not (and (not (= (mod ~a$w_buff1_used~0_Out-309185947 256) 0)) (not (= (mod ~a$w_buff0_used~0_Out-309185947 256) 0)))) 1 0) |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-309185947|) (= 1 ~a$w_buff0_used~0_Out-309185947)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-309185947|, ~a$w_buff0~0=~a$w_buff0~0_In-309185947, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-309185947|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-309185947} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-309185947|, ~a$w_buff1~0=~a$w_buff1~0_Out-309185947, ~a$w_buff0~0=~a$w_buff0~0_Out-309185947, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-309185947, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-309185947|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-309185947, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-309185947, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-309185947, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-309185947|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-309185947} 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-11-28 18:11:36,744 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-11-28 18:11:36,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-635118715 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out-635118715| ~a$w_buff1_used~0_In-635118715) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In-635118715| |P1Thread1of1ForFork1_#t~ite23_Out-635118715|)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-635118715| ~a$w_buff1_used~0_In-635118715) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-635118715 256)))) (or (and .cse1 (= (mod ~a$r_buff1_thd2~0_In-635118715 256) 0)) (and (= 0 (mod ~a$w_buff1_used~0_In-635118715 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-635118715 256)))) (= |P1Thread1of1ForFork1_#t~ite23_Out-635118715| |P1Thread1of1ForFork1_#t~ite24_Out-635118715|) .cse0))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-635118715, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-635118715, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-635118715|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-635118715, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-635118715, ~weak$$choice2~0=~weak$$choice2~0_In-635118715} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-635118715, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-635118715|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-635118715, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-635118715|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-635118715, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-635118715, ~weak$$choice2~0=~weak$$choice2~0_In-635118715} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:11:36,750 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-11-28 18:11:36,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In491401838 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In491401838 256)))) (or (and (= ~a$w_buff0_used~0_In491401838 |P0Thread1of1ForFork0_#t~ite5_Out491401838|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out491401838|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In491401838, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In491401838} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out491401838|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In491401838, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In491401838} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:11:36,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In1643940799 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1643940799 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In1643940799 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In1643940799 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1643940799|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~a$w_buff1_used~0_In1643940799 |P0Thread1of1ForFork0_#t~ite6_Out1643940799|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1643940799, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1643940799, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1643940799, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1643940799} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1643940799|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1643940799, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1643940799, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1643940799, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1643940799} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:11:36,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1721174684 256) 0)) (.cse1 (= ~a$r_buff0_thd1~0_In-1721174684 ~a$r_buff0_thd1~0_Out-1721174684)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-1721174684 256)))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out-1721174684)) (and .cse1 .cse2))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1721174684, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1721174684} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1721174684|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1721174684, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1721174684} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:11:36,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In1561937593 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In1561937593 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In1561937593 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd1~0_In1561937593 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1561937593| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out1561937593| ~a$r_buff1_thd1~0_In1561937593)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1561937593, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1561937593, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1561937593, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1561937593} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1561937593, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1561937593|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1561937593, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1561937593, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1561937593} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:11:36,754 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-11-28 18:11:36,754 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-11-28 18:11:36,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-1842853105 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-1842853105 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out-1842853105| |P1Thread1of1ForFork1_#t~ite33_Out-1842853105|))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-1842853105| ~a$w_buff1~0_In-1842853105) .cse0 (not .cse1) (not .cse2)) (and (= ~a~0_In-1842853105 |P1Thread1of1ForFork1_#t~ite32_Out-1842853105|) (or .cse1 .cse2) .cse0))) InVars {~a~0=~a~0_In-1842853105, ~a$w_buff1~0=~a$w_buff1~0_In-1842853105, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1842853105, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1842853105} OutVars{~a~0=~a~0_In-1842853105, ~a$w_buff1~0=~a$w_buff1~0_In-1842853105, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1842853105, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1842853105|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1842853105|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1842853105} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:11:36,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1903937569 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1903937569 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1903937569| ~a$w_buff0_used~0_In-1903937569)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1903937569| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1903937569, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1903937569} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1903937569|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1903937569, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1903937569} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:11:36,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In700492281 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In700492281 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In700492281 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In700492281 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out700492281|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In700492281 |P1Thread1of1ForFork1_#t~ite35_Out700492281|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In700492281, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In700492281, ~a$w_buff0_used~0=~a$w_buff0_used~0_In700492281, ~a$w_buff1_used~0=~a$w_buff1_used~0_In700492281} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In700492281, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In700492281, ~a$w_buff0_used~0=~a$w_buff0_used~0_In700492281, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out700492281|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In700492281} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:11:36,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1216286533 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1216286533 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1216286533|) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In1216286533 |P1Thread1of1ForFork1_#t~ite36_Out1216286533|) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1216286533, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1216286533} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1216286533, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1216286533, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1216286533|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:11:36,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1397846849 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-1397846849 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd2~0_In-1397846849 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1397846849 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd2~0_In-1397846849 |P1Thread1of1ForFork1_#t~ite37_Out-1397846849|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1397846849|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1397846849, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1397846849, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1397846849, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1397846849} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1397846849, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1397846849, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1397846849, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1397846849, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1397846849|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:11:36,757 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-11-28 18:11:36,757 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-11-28 18:11:36,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In669413542 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In669413542 256) 0))) (or (and (= ~a~0_In669413542 |ULTIMATE.start_main_#t~ite40_Out669413542|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out669413542| ~a$w_buff1~0_In669413542)))) InVars {~a~0=~a~0_In669413542, ~a$w_buff1~0=~a$w_buff1~0_In669413542, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In669413542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In669413542} OutVars{~a~0=~a~0_In669413542, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out669413542|, ~a$w_buff1~0=~a$w_buff1~0_In669413542, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In669413542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In669413542} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:11:36,758 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-11-28 18:11:36,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In785945644 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In785945644 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out785945644|) (not .cse1)) (and (= ~a$w_buff0_used~0_In785945644 |ULTIMATE.start_main_#t~ite42_Out785945644|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In785945644, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In785945644} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In785945644, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In785945644, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out785945644|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:11:36,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-1694521448 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1694521448 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-1694521448 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In-1694521448 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1694521448|)) (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-1694521448 |ULTIMATE.start_main_#t~ite43_Out-1694521448|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1694521448, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1694521448, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1694521448, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1694521448} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1694521448, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1694521448, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1694521448, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1694521448, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1694521448|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:11:36,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1489453478 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1489453478 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1489453478| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1489453478| ~a$r_buff0_thd0~0_In-1489453478)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1489453478, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1489453478} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1489453478, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1489453478, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1489453478|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:11:36,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In12072445 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In12072445 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd0~0_In12072445 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In12072445 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out12072445|)) (and (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In12072445 |ULTIMATE.start_main_#t~ite45_Out12072445|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In12072445, ~a$w_buff0_used~0=~a$w_buff0_used~0_In12072445, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In12072445, ~a$w_buff1_used~0=~a$w_buff1_used~0_In12072445} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In12072445, ~a$w_buff0_used~0=~a$w_buff0_used~0_In12072445, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In12072445, ~a$w_buff1_used~0=~a$w_buff1_used~0_In12072445, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out12072445|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:11:36,761 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-11-28 18:11:36,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:11:36 BasicIcfg [2019-11-28 18:11:36,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:11:36,853 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:11:36,853 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:11:36,853 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:11:36,854 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:21" (3/4) ... [2019-11-28 18:11:36,856 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:11:36,856 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-11-28 18:11:36,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (= P0Thread1of1ForFork0_~arg.base_Out-309185947 |P0Thread1of1ForFork0_#in~arg.base_In-309185947|) (= 1 ~a$w_buff0~0_Out-309185947) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-309185947)) (= ~a$w_buff1~0_Out-309185947 ~a$w_buff0~0_In-309185947) (= |P0Thread1of1ForFork0_#in~arg.offset_In-309185947| P0Thread1of1ForFork0_~arg.offset_Out-309185947) (= ~a$w_buff1_used~0_Out-309185947 ~a$w_buff0_used~0_In-309185947) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-309185947| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-309185947) (= (ite (not (and (not (= (mod ~a$w_buff1_used~0_Out-309185947 256) 0)) (not (= (mod ~a$w_buff0_used~0_Out-309185947 256) 0)))) 1 0) |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-309185947|) (= 1 ~a$w_buff0_used~0_Out-309185947)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-309185947|, ~a$w_buff0~0=~a$w_buff0~0_In-309185947, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-309185947|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-309185947} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-309185947|, ~a$w_buff1~0=~a$w_buff1~0_Out-309185947, ~a$w_buff0~0=~a$w_buff0~0_Out-309185947, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-309185947, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-309185947|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-309185947, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-309185947, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-309185947, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-309185947|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-309185947} 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-11-28 18:11:36,857 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-11-28 18:11:36,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-635118715 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out-635118715| ~a$w_buff1_used~0_In-635118715) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In-635118715| |P1Thread1of1ForFork1_#t~ite23_Out-635118715|)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-635118715| ~a$w_buff1_used~0_In-635118715) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-635118715 256)))) (or (and .cse1 (= (mod ~a$r_buff1_thd2~0_In-635118715 256) 0)) (and (= 0 (mod ~a$w_buff1_used~0_In-635118715 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-635118715 256)))) (= |P1Thread1of1ForFork1_#t~ite23_Out-635118715| |P1Thread1of1ForFork1_#t~ite24_Out-635118715|) .cse0))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-635118715, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-635118715, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-635118715|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-635118715, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-635118715, ~weak$$choice2~0=~weak$$choice2~0_In-635118715} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-635118715, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-635118715|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-635118715, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-635118715|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-635118715, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-635118715, ~weak$$choice2~0=~weak$$choice2~0_In-635118715} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:11:36,862 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-11-28 18:11:36,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In491401838 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In491401838 256)))) (or (and (= ~a$w_buff0_used~0_In491401838 |P0Thread1of1ForFork0_#t~ite5_Out491401838|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out491401838|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In491401838, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In491401838} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out491401838|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In491401838, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In491401838} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:11:36,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In1643940799 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1643940799 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In1643940799 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In1643940799 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1643940799|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~a$w_buff1_used~0_In1643940799 |P0Thread1of1ForFork0_#t~ite6_Out1643940799|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1643940799, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1643940799, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1643940799, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1643940799} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1643940799|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1643940799, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1643940799, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1643940799, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1643940799} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:11:36,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1721174684 256) 0)) (.cse1 (= ~a$r_buff0_thd1~0_In-1721174684 ~a$r_buff0_thd1~0_Out-1721174684)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-1721174684 256)))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out-1721174684)) (and .cse1 .cse2))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1721174684, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1721174684} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1721174684|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1721174684, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1721174684} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:11:36,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In1561937593 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In1561937593 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In1561937593 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd1~0_In1561937593 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1561937593| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out1561937593| ~a$r_buff1_thd1~0_In1561937593)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1561937593, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1561937593, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1561937593, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1561937593} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1561937593, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1561937593|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1561937593, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1561937593, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1561937593} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:11:36,865 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-11-28 18:11:36,866 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-11-28 18:11:36,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-1842853105 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-1842853105 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out-1842853105| |P1Thread1of1ForFork1_#t~ite33_Out-1842853105|))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-1842853105| ~a$w_buff1~0_In-1842853105) .cse0 (not .cse1) (not .cse2)) (and (= ~a~0_In-1842853105 |P1Thread1of1ForFork1_#t~ite32_Out-1842853105|) (or .cse1 .cse2) .cse0))) InVars {~a~0=~a~0_In-1842853105, ~a$w_buff1~0=~a$w_buff1~0_In-1842853105, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1842853105, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1842853105} OutVars{~a~0=~a~0_In-1842853105, ~a$w_buff1~0=~a$w_buff1~0_In-1842853105, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1842853105, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1842853105|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1842853105|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1842853105} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:11:36,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1903937569 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1903937569 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1903937569| ~a$w_buff0_used~0_In-1903937569)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1903937569| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1903937569, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1903937569} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1903937569|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1903937569, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1903937569} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:11:36,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In700492281 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In700492281 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In700492281 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In700492281 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out700492281|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In700492281 |P1Thread1of1ForFork1_#t~ite35_Out700492281|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In700492281, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In700492281, ~a$w_buff0_used~0=~a$w_buff0_used~0_In700492281, ~a$w_buff1_used~0=~a$w_buff1_used~0_In700492281} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In700492281, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In700492281, ~a$w_buff0_used~0=~a$w_buff0_used~0_In700492281, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out700492281|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In700492281} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:11:36,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1216286533 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1216286533 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1216286533|) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In1216286533 |P1Thread1of1ForFork1_#t~ite36_Out1216286533|) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1216286533, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1216286533} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1216286533, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1216286533, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1216286533|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:11:36,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1397846849 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-1397846849 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd2~0_In-1397846849 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1397846849 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd2~0_In-1397846849 |P1Thread1of1ForFork1_#t~ite37_Out-1397846849|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1397846849|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1397846849, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1397846849, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1397846849, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1397846849} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1397846849, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1397846849, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1397846849, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1397846849, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1397846849|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:11:36,868 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-11-28 18:11:36,868 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-11-28 18:11:36,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In669413542 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In669413542 256) 0))) (or (and (= ~a~0_In669413542 |ULTIMATE.start_main_#t~ite40_Out669413542|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out669413542| ~a$w_buff1~0_In669413542)))) InVars {~a~0=~a~0_In669413542, ~a$w_buff1~0=~a$w_buff1~0_In669413542, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In669413542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In669413542} OutVars{~a~0=~a~0_In669413542, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out669413542|, ~a$w_buff1~0=~a$w_buff1~0_In669413542, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In669413542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In669413542} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:11:36,869 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-11-28 18:11:36,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In785945644 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In785945644 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out785945644|) (not .cse1)) (and (= ~a$w_buff0_used~0_In785945644 |ULTIMATE.start_main_#t~ite42_Out785945644|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In785945644, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In785945644} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In785945644, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In785945644, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out785945644|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:11:36,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-1694521448 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1694521448 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-1694521448 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In-1694521448 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1694521448|)) (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-1694521448 |ULTIMATE.start_main_#t~ite43_Out-1694521448|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1694521448, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1694521448, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1694521448, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1694521448} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1694521448, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1694521448, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1694521448, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1694521448, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1694521448|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:11:36,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1489453478 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1489453478 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1489453478| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1489453478| ~a$r_buff0_thd0~0_In-1489453478)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1489453478, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1489453478} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1489453478, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1489453478, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1489453478|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:11:36,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In12072445 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In12072445 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd0~0_In12072445 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In12072445 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out12072445|)) (and (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In12072445 |ULTIMATE.start_main_#t~ite45_Out12072445|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In12072445, ~a$w_buff0_used~0=~a$w_buff0_used~0_In12072445, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In12072445, ~a$w_buff1_used~0=~a$w_buff1_used~0_In12072445} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In12072445, ~a$w_buff0_used~0=~a$w_buff0_used~0_In12072445, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In12072445, ~a$w_buff1_used~0=~a$w_buff1_used~0_In12072445, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out12072445|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:11:36,871 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-11-28 18:11:36,971 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:11:36,971 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:11:36,975 INFO L168 Benchmark]: Toolchain (without parser) took 17343.43 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 506.5 MB). Free memory was 952.3 MB in the beginning and 835.0 MB in the end (delta: 117.3 MB). Peak memory consumption was 623.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:36,975 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:11:36,976 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -141.2 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:36,976 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:36,981 INFO L168 Benchmark]: Boogie Preprocessor took 40.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:11:36,981 INFO L168 Benchmark]: RCFGBuilder took 758.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:36,982 INFO L168 Benchmark]: TraceAbstraction took 15566.31 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 375.4 MB). Free memory was 1.0 GB in the beginning and 859.8 MB in the end (delta: 182.2 MB). Peak memory consumption was 557.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:36,982 INFO L168 Benchmark]: Witness Printer took 118.69 ms. Allocated memory is still 1.5 GB. Free memory was 859.8 MB in the beginning and 835.0 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:36,988 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 783.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -141.2 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 758.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15566.31 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 375.4 MB). Free memory was 1.0 GB in the beginning and 859.8 MB in the end (delta: 182.2 MB). Peak memory consumption was 557.5 MB. Max. memory is 11.5 GB. * Witness Printer took 118.69 ms. Allocated memory is still 1.5 GB. Free memory was 859.8 MB in the beginning and 835.0 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 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: 1.7s, 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: 15.3s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1899 SDtfs, 1752 SDslu, 3207 SDs, 0 SdLazy, 1685 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s 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: 3.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 11446 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 535 NumberOfCodeBlocks, 535 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 466 ConstructedInterpolants, 0 QuantifiedInterpolants, 81896 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...