/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:54:16,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:54:16,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:54:16,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:54:16,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:54:16,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:54:16,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:54:16,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:54:16,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:54:16,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:54:16,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:54:16,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:54:16,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:54:16,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:54:16,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:54:16,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:54:16,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:54:16,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:54:16,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:54:16,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:54:16,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:54:16,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:54:16,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:54:16,331 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:54:16,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:54:16,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:54:16,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:54:16,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:54:16,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:54:16,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:54:16,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:54:16,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:54:16,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:54:16,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:54:16,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:54:16,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:54:16,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:54:16,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:54:16,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:54:16,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:54:16,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:54:16,343 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:54:16,358 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:54:16,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:54:16,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:54:16,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:54:16,360 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:54:16,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:54:16,360 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:54:16,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:54:16,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:54:16,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:54:16,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:54:16,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:54:16,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:54:16,362 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:54:16,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:54:16,362 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:54:16,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:54:16,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:54:16,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:54:16,363 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:54:16,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:54:16,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:54:16,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:54:16,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:54:16,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:54:16,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:54:16,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:54:16,364 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:54:16,365 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:54:16,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:54:16,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:54:16,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:54:16,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:54:16,651 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:54:16,651 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:54:16,652 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i [2019-12-27 06:54:16,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdcf48717/2231b6562e304273bf87b92b29bc95f5/FLAG7cb44b627 [2019-12-27 06:54:17,315 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:54:17,316 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i [2019-12-27 06:54:17,335 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdcf48717/2231b6562e304273bf87b92b29bc95f5/FLAG7cb44b627 [2019-12-27 06:54:17,574 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdcf48717/2231b6562e304273bf87b92b29bc95f5 [2019-12-27 06:54:17,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:54:17,586 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:54:17,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:54:17,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:54:17,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:54:17,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:54:17" (1/1) ... [2019-12-27 06:54:17,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23a66491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:17, skipping insertion in model container [2019-12-27 06:54:17,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:54:17" (1/1) ... [2019-12-27 06:54:17,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:54:17,660 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:54:18,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:54:18,259 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:54:18,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:54:18,394 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:54:18,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:18 WrapperNode [2019-12-27 06:54:18,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:54:18,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:54:18,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:54:18,396 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:54:18,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:18" (1/1) ... [2019-12-27 06:54:18,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:18" (1/1) ... [2019-12-27 06:54:18,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:54:18,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:54:18,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:54:18,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:54:18,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:18" (1/1) ... [2019-12-27 06:54:18,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:18" (1/1) ... [2019-12-27 06:54:18,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:18" (1/1) ... [2019-12-27 06:54:18,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:18" (1/1) ... [2019-12-27 06:54:18,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:18" (1/1) ... [2019-12-27 06:54:18,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:18" (1/1) ... [2019-12-27 06:54:18,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:18" (1/1) ... [2019-12-27 06:54:18,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:54:18,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:54:18,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:54:18,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:54:18,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:18" (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-12-27 06:54:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:54:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:54:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:54:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:54:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:54:18,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:54:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:54:18,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:54:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:54:18,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:54:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:54:18,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:54:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:54:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:54:18,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:54:18,587 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:54:19,392 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:54:19,393 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:54:19,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:54:19 BoogieIcfgContainer [2019-12-27 06:54:19,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:54:19,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:54:19,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:54:19,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:54:19,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:54:17" (1/3) ... [2019-12-27 06:54:19,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e725b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:54:19, skipping insertion in model container [2019-12-27 06:54:19,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:18" (2/3) ... [2019-12-27 06:54:19,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e725b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:54:19, skipping insertion in model container [2019-12-27 06:54:19,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:54:19" (3/3) ... [2019-12-27 06:54:19,404 INFO L109 eAbstractionObserver]: Analyzing ICFG mix055_power.opt.i [2019-12-27 06:54:19,415 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:54:19,416 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:54:19,428 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:54:19,429 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:54:19,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,493 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,493 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,498 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,498 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,500 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,500 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,513 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,513 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,513 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,513 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,514 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,515 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,515 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,515 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,515 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,516 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,516 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,516 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,516 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,516 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,517 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,517 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,517 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,517 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,518 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,518 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,520 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,520 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,520 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,520 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,521 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,525 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,525 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,551 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,552 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,559 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,559 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,561 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,562 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,563 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,563 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,563 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,563 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,564 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:19,580 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:54:19,602 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:54:19,602 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:54:19,603 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:54:19,603 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:54:19,603 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:54:19,603 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:54:19,603 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:54:19,603 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:54:19,621 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 207 transitions [2019-12-27 06:54:19,623 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-27 06:54:19,723 INFO L132 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-27 06:54:19,723 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:54:19,739 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:54:19,761 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-27 06:54:19,813 INFO L132 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-27 06:54:19,813 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:54:19,819 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:54:19,835 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 06:54:19,836 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:54:23,421 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 06:54:23,564 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 06:54:23,588 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51526 [2019-12-27 06:54:23,589 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 06:54:23,592 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 96 transitions [2019-12-27 06:54:25,656 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-27 06:54:25,657 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-27 06:54:25,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 06:54:25,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:25,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:25,666 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:25,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:25,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1005539762, now seen corresponding path program 1 times [2019-12-27 06:54:25,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:25,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664284115] [2019-12-27 06:54:25,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:25,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664284115] [2019-12-27 06:54:25,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:25,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:54:25,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111231882] [2019-12-27 06:54:25,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:25,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:26,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:26,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:26,006 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-27 06:54:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:27,259 INFO L93 Difference]: Finished difference Result 34366 states and 145048 transitions. [2019-12-27 06:54:27,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:27,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 06:54:27,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:27,517 INFO L225 Difference]: With dead ends: 34366 [2019-12-27 06:54:27,518 INFO L226 Difference]: Without dead ends: 33694 [2019-12-27 06:54:27,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:28,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33694 states. [2019-12-27 06:54:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33694 to 33694. [2019-12-27 06:54:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33694 states. [2019-12-27 06:54:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33694 states to 33694 states and 142304 transitions. [2019-12-27 06:54:29,394 INFO L78 Accepts]: Start accepts. Automaton has 33694 states and 142304 transitions. Word has length 9 [2019-12-27 06:54:29,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:29,395 INFO L462 AbstractCegarLoop]: Abstraction has 33694 states and 142304 transitions. [2019-12-27 06:54:29,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 33694 states and 142304 transitions. [2019-12-27 06:54:29,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:54:29,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:29,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:29,403 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:29,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:29,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1499462081, now seen corresponding path program 1 times [2019-12-27 06:54:29,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:29,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622268648] [2019-12-27 06:54:29,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:29,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622268648] [2019-12-27 06:54:29,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:29,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:29,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969621962] [2019-12-27 06:54:29,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:54:29,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:29,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:54:29,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:54:29,549 INFO L87 Difference]: Start difference. First operand 33694 states and 142304 transitions. Second operand 4 states. [2019-12-27 06:54:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:31,794 INFO L93 Difference]: Finished difference Result 52350 states and 214000 transitions. [2019-12-27 06:54:31,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:54:31,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:54:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:32,064 INFO L225 Difference]: With dead ends: 52350 [2019-12-27 06:54:32,064 INFO L226 Difference]: Without dead ends: 52322 [2019-12-27 06:54:32,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-27 06:54:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 46842. [2019-12-27 06:54:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46842 states. [2019-12-27 06:54:34,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46842 states to 46842 states and 193636 transitions. [2019-12-27 06:54:34,268 INFO L78 Accepts]: Start accepts. Automaton has 46842 states and 193636 transitions. Word has length 15 [2019-12-27 06:54:34,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:34,268 INFO L462 AbstractCegarLoop]: Abstraction has 46842 states and 193636 transitions. [2019-12-27 06:54:34,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:54:34,269 INFO L276 IsEmpty]: Start isEmpty. Operand 46842 states and 193636 transitions. [2019-12-27 06:54:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:54:34,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:34,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:34,272 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:34,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:34,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1997976486, now seen corresponding path program 1 times [2019-12-27 06:54:34,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:34,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806756585] [2019-12-27 06:54:34,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:34,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806756585] [2019-12-27 06:54:34,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:34,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:34,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380799244] [2019-12-27 06:54:34,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:54:34,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:34,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:54:34,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:54:34,360 INFO L87 Difference]: Start difference. First operand 46842 states and 193636 transitions. Second operand 4 states. [2019-12-27 06:54:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:34,854 INFO L93 Difference]: Finished difference Result 57862 states and 237476 transitions. [2019-12-27 06:54:34,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:54:34,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:54:34,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:37,329 INFO L225 Difference]: With dead ends: 57862 [2019-12-27 06:54:37,329 INFO L226 Difference]: Without dead ends: 57862 [2019-12-27 06:54:37,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:37,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57862 states. [2019-12-27 06:54:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57862 to 51558. [2019-12-27 06:54:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51558 states. [2019-12-27 06:54:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51558 states to 51558 states and 212860 transitions. [2019-12-27 06:54:38,941 INFO L78 Accepts]: Start accepts. Automaton has 51558 states and 212860 transitions. Word has length 15 [2019-12-27 06:54:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:38,941 INFO L462 AbstractCegarLoop]: Abstraction has 51558 states and 212860 transitions. [2019-12-27 06:54:38,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:54:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 51558 states and 212860 transitions. [2019-12-27 06:54:38,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 06:54:38,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:38,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:38,957 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:38,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:38,958 INFO L82 PathProgramCache]: Analyzing trace with hash 188440407, now seen corresponding path program 1 times [2019-12-27 06:54:38,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:38,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277958050] [2019-12-27 06:54:38,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:39,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277958050] [2019-12-27 06:54:39,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:39,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:54:39,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046985334] [2019-12-27 06:54:39,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:54:39,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:39,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:54:39,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:39,039 INFO L87 Difference]: Start difference. First operand 51558 states and 212860 transitions. Second operand 5 states. [2019-12-27 06:54:40,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:40,208 INFO L93 Difference]: Finished difference Result 69038 states and 280320 transitions. [2019-12-27 06:54:40,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:54:40,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 06:54:40,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:40,462 INFO L225 Difference]: With dead ends: 69038 [2019-12-27 06:54:40,462 INFO L226 Difference]: Without dead ends: 69010 [2019-12-27 06:54:40,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:54:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69010 states. [2019-12-27 06:54:44,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69010 to 51618. [2019-12-27 06:54:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51618 states. [2019-12-27 06:54:44,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51618 states to 51618 states and 212640 transitions. [2019-12-27 06:54:44,503 INFO L78 Accepts]: Start accepts. Automaton has 51618 states and 212640 transitions. Word has length 21 [2019-12-27 06:54:44,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:44,503 INFO L462 AbstractCegarLoop]: Abstraction has 51618 states and 212640 transitions. [2019-12-27 06:54:44,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:54:44,504 INFO L276 IsEmpty]: Start isEmpty. Operand 51618 states and 212640 transitions. [2019-12-27 06:54:44,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 06:54:44,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:44,565 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:44,565 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:44,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:44,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1938437726, now seen corresponding path program 1 times [2019-12-27 06:54:44,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:44,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172959741] [2019-12-27 06:54:44,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:44,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172959741] [2019-12-27 06:54:44,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:44,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:54:44,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749696908] [2019-12-27 06:54:44,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:44,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:44,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:44,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:44,667 INFO L87 Difference]: Start difference. First operand 51618 states and 212640 transitions. Second operand 3 states. [2019-12-27 06:54:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:44,986 INFO L93 Difference]: Finished difference Result 65186 states and 266156 transitions. [2019-12-27 06:54:44,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:44,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-27 06:54:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:45,150 INFO L225 Difference]: With dead ends: 65186 [2019-12-27 06:54:45,150 INFO L226 Difference]: Without dead ends: 65186 [2019-12-27 06:54:45,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:45,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65186 states. [2019-12-27 06:54:48,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65186 to 56294. [2019-12-27 06:54:48,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56294 states. [2019-12-27 06:54:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56294 states to 56294 states and 231400 transitions. [2019-12-27 06:54:48,784 INFO L78 Accepts]: Start accepts. Automaton has 56294 states and 231400 transitions. Word has length 29 [2019-12-27 06:54:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:48,784 INFO L462 AbstractCegarLoop]: Abstraction has 56294 states and 231400 transitions. [2019-12-27 06:54:48,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand 56294 states and 231400 transitions. [2019-12-27 06:54:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 06:54:48,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:48,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:48,822 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:48,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:48,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1938201041, now seen corresponding path program 1 times [2019-12-27 06:54:48,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:48,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7031181] [2019-12-27 06:54:48,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:48,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7031181] [2019-12-27 06:54:48,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:48,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:54:48,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643503839] [2019-12-27 06:54:48,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:54:48,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:48,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:54:48,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:54:48,909 INFO L87 Difference]: Start difference. First operand 56294 states and 231400 transitions. Second operand 4 states. [2019-12-27 06:54:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:49,591 INFO L93 Difference]: Finished difference Result 45340 states and 171347 transitions. [2019-12-27 06:54:49,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:54:49,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-27 06:54:49,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:49,686 INFO L225 Difference]: With dead ends: 45340 [2019-12-27 06:54:49,687 INFO L226 Difference]: Without dead ends: 44232 [2019-12-27 06:54:49,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44232 states. [2019-12-27 06:54:50,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44232 to 44232. [2019-12-27 06:54:50,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44232 states. [2019-12-27 06:54:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44232 states to 44232 states and 167871 transitions. [2019-12-27 06:54:50,523 INFO L78 Accepts]: Start accepts. Automaton has 44232 states and 167871 transitions. Word has length 29 [2019-12-27 06:54:50,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:50,523 INFO L462 AbstractCegarLoop]: Abstraction has 44232 states and 167871 transitions. [2019-12-27 06:54:50,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:54:50,523 INFO L276 IsEmpty]: Start isEmpty. Operand 44232 states and 167871 transitions. [2019-12-27 06:54:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 06:54:51,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:51,076 INFO L411 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] [2019-12-27 06:54:51,077 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:51,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:51,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1904073376, now seen corresponding path program 1 times [2019-12-27 06:54:51,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:51,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948458765] [2019-12-27 06:54:51,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:51,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948458765] [2019-12-27 06:54:51,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:51,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:54:51,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83282849] [2019-12-27 06:54:51,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:54:51,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:51,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:54:51,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:51,157 INFO L87 Difference]: Start difference. First operand 44232 states and 167871 transitions. Second operand 5 states. [2019-12-27 06:54:51,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:51,266 INFO L93 Difference]: Finished difference Result 19345 states and 60752 transitions. [2019-12-27 06:54:51,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:54:51,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 06:54:51,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:51,293 INFO L225 Difference]: With dead ends: 19345 [2019-12-27 06:54:51,293 INFO L226 Difference]: Without dead ends: 18469 [2019-12-27 06:54:51,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:54:51,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18469 states. [2019-12-27 06:54:51,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18469 to 18469. [2019-12-27 06:54:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18469 states. [2019-12-27 06:54:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18469 states to 18469 states and 57954 transitions. [2019-12-27 06:54:51,572 INFO L78 Accepts]: Start accepts. Automaton has 18469 states and 57954 transitions. Word has length 30 [2019-12-27 06:54:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:51,573 INFO L462 AbstractCegarLoop]: Abstraction has 18469 states and 57954 transitions. [2019-12-27 06:54:51,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:54:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 18469 states and 57954 transitions. [2019-12-27 06:54:51,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 06:54:51,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:51,584 INFO L411 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] [2019-12-27 06:54:51,584 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:51,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:51,584 INFO L82 PathProgramCache]: Analyzing trace with hash 700126081, now seen corresponding path program 1 times [2019-12-27 06:54:51,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:51,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618673523] [2019-12-27 06:54:51,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:51,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618673523] [2019-12-27 06:54:51,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:51,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:54:51,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622334850] [2019-12-27 06:54:51,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:54:51,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:51,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:54:51,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:54:51,683 INFO L87 Difference]: Start difference. First operand 18469 states and 57954 transitions. Second operand 6 states. [2019-12-27 06:54:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:51,781 INFO L93 Difference]: Finished difference Result 3432 states and 8687 transitions. [2019-12-27 06:54:51,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:54:51,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 06:54:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:51,787 INFO L225 Difference]: With dead ends: 3432 [2019-12-27 06:54:51,787 INFO L226 Difference]: Without dead ends: 3063 [2019-12-27 06:54:51,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:54:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2019-12-27 06:54:51,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 3063. [2019-12-27 06:54:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3063 states. [2019-12-27 06:54:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 7649 transitions. [2019-12-27 06:54:51,833 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 7649 transitions. Word has length 31 [2019-12-27 06:54:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:51,833 INFO L462 AbstractCegarLoop]: Abstraction has 3063 states and 7649 transitions. [2019-12-27 06:54:51,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:54:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 7649 transitions. [2019-12-27 06:54:51,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 06:54:51,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:51,838 INFO L411 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] [2019-12-27 06:54:51,838 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:51,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:51,839 INFO L82 PathProgramCache]: Analyzing trace with hash -196360051, now seen corresponding path program 1 times [2019-12-27 06:54:51,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:51,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689939780] [2019-12-27 06:54:51,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:51,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689939780] [2019-12-27 06:54:51,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:51,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:54:51,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619467972] [2019-12-27 06:54:51,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:54:51,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:51,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:54:51,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:54:51,995 INFO L87 Difference]: Start difference. First operand 3063 states and 7649 transitions. Second operand 7 states. [2019-12-27 06:54:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:52,103 INFO L93 Difference]: Finished difference Result 1341 states and 3748 transitions. [2019-12-27 06:54:52,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:54:52,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-27 06:54:52,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:52,106 INFO L225 Difference]: With dead ends: 1341 [2019-12-27 06:54:52,106 INFO L226 Difference]: Without dead ends: 1292 [2019-12-27 06:54:52,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:54:52,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-12-27 06:54:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1180. [2019-12-27 06:54:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2019-12-27 06:54:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 3332 transitions. [2019-12-27 06:54:52,120 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 3332 transitions. Word has length 43 [2019-12-27 06:54:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:52,120 INFO L462 AbstractCegarLoop]: Abstraction has 1180 states and 3332 transitions. [2019-12-27 06:54:52,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:54:52,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 3332 transitions. [2019-12-27 06:54:52,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:54:52,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:52,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:52,124 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:52,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:52,124 INFO L82 PathProgramCache]: Analyzing trace with hash 443866773, now seen corresponding path program 1 times [2019-12-27 06:54:52,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:52,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812295629] [2019-12-27 06:54:52,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:52,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:52,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812295629] [2019-12-27 06:54:52,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:52,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:54:52,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432371427] [2019-12-27 06:54:52,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:54:52,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:52,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:54:52,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:54:52,298 INFO L87 Difference]: Start difference. First operand 1180 states and 3332 transitions. Second operand 7 states. [2019-12-27 06:54:52,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:52,420 INFO L93 Difference]: Finished difference Result 2291 states and 6039 transitions. [2019-12-27 06:54:52,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:54:52,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-27 06:54:52,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:52,423 INFO L225 Difference]: With dead ends: 2291 [2019-12-27 06:54:52,423 INFO L226 Difference]: Without dead ends: 1563 [2019-12-27 06:54:52,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:54:52,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-12-27 06:54:52,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1052. [2019-12-27 06:54:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-12-27 06:54:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 2899 transitions. [2019-12-27 06:54:52,437 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 2899 transitions. Word has length 58 [2019-12-27 06:54:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:52,437 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 2899 transitions. [2019-12-27 06:54:52,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:54:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 2899 transitions. [2019-12-27 06:54:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:54:52,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:52,439 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:52,440 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:52,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:52,440 INFO L82 PathProgramCache]: Analyzing trace with hash -324610345, now seen corresponding path program 2 times [2019-12-27 06:54:52,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:52,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179703174] [2019-12-27 06:54:52,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:52,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179703174] [2019-12-27 06:54:52,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:52,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:54:52,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878858058] [2019-12-27 06:54:52,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:54:52,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:52,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:54:52,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:54:52,568 INFO L87 Difference]: Start difference. First operand 1052 states and 2899 transitions. Second operand 7 states. [2019-12-27 06:54:53,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:53,097 INFO L93 Difference]: Finished difference Result 1504 states and 4050 transitions. [2019-12-27 06:54:53,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:54:53,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-27 06:54:53,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:53,100 INFO L225 Difference]: With dead ends: 1504 [2019-12-27 06:54:53,101 INFO L226 Difference]: Without dead ends: 1504 [2019-12-27 06:54:53,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:54:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2019-12-27 06:54:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1367. [2019-12-27 06:54:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2019-12-27 06:54:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 3698 transitions. [2019-12-27 06:54:53,124 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 3698 transitions. Word has length 58 [2019-12-27 06:54:53,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:53,125 INFO L462 AbstractCegarLoop]: Abstraction has 1367 states and 3698 transitions. [2019-12-27 06:54:53,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:54:53,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 3698 transitions. [2019-12-27 06:54:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:54:53,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:53,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:53,129 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:53,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:53,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1383185921, now seen corresponding path program 3 times [2019-12-27 06:54:53,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:53,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298345352] [2019-12-27 06:54:53,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:53,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298345352] [2019-12-27 06:54:53,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:53,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:54:53,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728341472] [2019-12-27 06:54:53,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:54:53,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:53,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:54:53,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:53,290 INFO L87 Difference]: Start difference. First operand 1367 states and 3698 transitions. Second operand 5 states. [2019-12-27 06:54:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:53,509 INFO L93 Difference]: Finished difference Result 1838 states and 5003 transitions. [2019-12-27 06:54:53,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:54:53,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 06:54:53,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:53,514 INFO L225 Difference]: With dead ends: 1838 [2019-12-27 06:54:53,514 INFO L226 Difference]: Without dead ends: 1838 [2019-12-27 06:54:53,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:54:53,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-12-27 06:54:53,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1445. [2019-12-27 06:54:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-12-27 06:54:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 3917 transitions. [2019-12-27 06:54:53,532 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 3917 transitions. Word has length 58 [2019-12-27 06:54:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:53,533 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 3917 transitions. [2019-12-27 06:54:53,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:54:53,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 3917 transitions. [2019-12-27 06:54:53,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:54:53,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:53,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:53,536 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:53,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:53,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1990964243, now seen corresponding path program 4 times [2019-12-27 06:54:53,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:53,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425201809] [2019-12-27 06:54:53,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:53,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:53,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425201809] [2019-12-27 06:54:53,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:53,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:54:53,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639720440] [2019-12-27 06:54:53,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:54:53,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:53,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:54:53,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:54:53,635 INFO L87 Difference]: Start difference. First operand 1445 states and 3917 transitions. Second operand 6 states. [2019-12-27 06:54:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:53,901 INFO L93 Difference]: Finished difference Result 2035 states and 5537 transitions. [2019-12-27 06:54:53,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:54:53,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 06:54:53,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:53,905 INFO L225 Difference]: With dead ends: 2035 [2019-12-27 06:54:53,905 INFO L226 Difference]: Without dead ends: 2035 [2019-12-27 06:54:53,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:54:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2019-12-27 06:54:53,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 1403. [2019-12-27 06:54:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1403 states. [2019-12-27 06:54:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 3804 transitions. [2019-12-27 06:54:53,937 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 3804 transitions. Word has length 58 [2019-12-27 06:54:53,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:53,938 INFO L462 AbstractCegarLoop]: Abstraction has 1403 states and 3804 transitions. [2019-12-27 06:54:53,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:54:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 3804 transitions. [2019-12-27 06:54:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:54:53,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:53,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:53,941 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:53,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:53,941 INFO L82 PathProgramCache]: Analyzing trace with hash -746332050, now seen corresponding path program 1 times [2019-12-27 06:54:53,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:53,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221364084] [2019-12-27 06:54:53,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:54,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221364084] [2019-12-27 06:54:54,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:54,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:54,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806034726] [2019-12-27 06:54:54,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:54,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:54,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:54,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:54,551 INFO L87 Difference]: Start difference. First operand 1403 states and 3804 transitions. Second operand 3 states. [2019-12-27 06:54:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:54,595 INFO L93 Difference]: Finished difference Result 1402 states and 3802 transitions. [2019-12-27 06:54:54,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:54,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 06:54:54,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:54,598 INFO L225 Difference]: With dead ends: 1402 [2019-12-27 06:54:54,599 INFO L226 Difference]: Without dead ends: 1402 [2019-12-27 06:54:54,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-12-27 06:54:54,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1073. [2019-12-27 06:54:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2019-12-27 06:54:54,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 2888 transitions. [2019-12-27 06:54:54,619 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 2888 transitions. Word has length 59 [2019-12-27 06:54:54,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:54,621 INFO L462 AbstractCegarLoop]: Abstraction has 1073 states and 2888 transitions. [2019-12-27 06:54:54,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 2888 transitions. [2019-12-27 06:54:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:54:54,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:54,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:54,624 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:54,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:54,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1912027671, now seen corresponding path program 1 times [2019-12-27 06:54:54,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:54,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929636344] [2019-12-27 06:54:54,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:54,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929636344] [2019-12-27 06:54:54,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:54,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:54,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89175556] [2019-12-27 06:54:54,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:54,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:54,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:54,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:54,725 INFO L87 Difference]: Start difference. First operand 1073 states and 2888 transitions. Second operand 3 states. [2019-12-27 06:54:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:54,740 INFO L93 Difference]: Finished difference Result 1019 states and 2715 transitions. [2019-12-27 06:54:54,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:54,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 06:54:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:54,742 INFO L225 Difference]: With dead ends: 1019 [2019-12-27 06:54:54,742 INFO L226 Difference]: Without dead ends: 1019 [2019-12-27 06:54:54,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:54,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-12-27 06:54:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1019. [2019-12-27 06:54:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-12-27 06:54:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 2715 transitions. [2019-12-27 06:54:54,761 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 2715 transitions. Word has length 59 [2019-12-27 06:54:54,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:54,761 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 2715 transitions. [2019-12-27 06:54:54,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:54,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 2715 transitions. [2019-12-27 06:54:54,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:54:54,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:54,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:54,763 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:54,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:54,764 INFO L82 PathProgramCache]: Analyzing trace with hash 792391964, now seen corresponding path program 1 times [2019-12-27 06:54:54,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:54,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866233604] [2019-12-27 06:54:54,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:54,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866233604] [2019-12-27 06:54:54,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:54,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:54:54,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154033333] [2019-12-27 06:54:54,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:54:54,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:54,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:54:54,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:54:54,962 INFO L87 Difference]: Start difference. First operand 1019 states and 2715 transitions. Second operand 7 states. [2019-12-27 06:54:55,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:55,108 INFO L93 Difference]: Finished difference Result 1958 states and 4862 transitions. [2019-12-27 06:54:55,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:54:55,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-27 06:54:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:55,111 INFO L225 Difference]: With dead ends: 1958 [2019-12-27 06:54:55,111 INFO L226 Difference]: Without dead ends: 795 [2019-12-27 06:54:55,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:54:55,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-12-27 06:54:55,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 570. [2019-12-27 06:54:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-12-27 06:54:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1221 transitions. [2019-12-27 06:54:55,124 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1221 transitions. Word has length 60 [2019-12-27 06:54:55,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:55,124 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 1221 transitions. [2019-12-27 06:54:55,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:54:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1221 transitions. [2019-12-27 06:54:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:54:55,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:55,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:55,127 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:55,127 INFO L82 PathProgramCache]: Analyzing trace with hash -631890150, now seen corresponding path program 2 times [2019-12-27 06:54:55,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:55,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446417315] [2019-12-27 06:54:55,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:55,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446417315] [2019-12-27 06:54:55,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:55,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:54:55,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067649373] [2019-12-27 06:54:55,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:54:55,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:55,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:54:55,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:54:55,257 INFO L87 Difference]: Start difference. First operand 570 states and 1221 transitions. Second operand 6 states. [2019-12-27 06:54:55,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:55,324 INFO L93 Difference]: Finished difference Result 807 states and 1666 transitions. [2019-12-27 06:54:55,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:54:55,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 06:54:55,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:55,325 INFO L225 Difference]: With dead ends: 807 [2019-12-27 06:54:55,325 INFO L226 Difference]: Without dead ends: 238 [2019-12-27 06:54:55,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:54:55,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-12-27 06:54:55,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 214. [2019-12-27 06:54:55,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-27 06:54:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 362 transitions. [2019-12-27 06:54:55,330 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 362 transitions. Word has length 60 [2019-12-27 06:54:55,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:55,330 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 362 transitions. [2019-12-27 06:54:55,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:54:55,330 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 362 transitions. [2019-12-27 06:54:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:54:55,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:55,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:55,331 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:55,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:55,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1041044752, now seen corresponding path program 3 times [2019-12-27 06:54:55,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:55,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881079307] [2019-12-27 06:54:55,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:55,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:55,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881079307] [2019-12-27 06:54:55,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:55,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:54:55,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816840813] [2019-12-27 06:54:55,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 06:54:55,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:55,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 06:54:55,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:54:55,555 INFO L87 Difference]: Start difference. First operand 214 states and 362 transitions. Second operand 12 states. [2019-12-27 06:54:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:56,021 INFO L93 Difference]: Finished difference Result 380 states and 633 transitions. [2019-12-27 06:54:56,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 06:54:56,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-27 06:54:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:56,023 INFO L225 Difference]: With dead ends: 380 [2019-12-27 06:54:56,023 INFO L226 Difference]: Without dead ends: 348 [2019-12-27 06:54:56,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-27 06:54:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-12-27 06:54:56,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 314. [2019-12-27 06:54:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-27 06:54:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 533 transitions. [2019-12-27 06:54:56,030 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 533 transitions. Word has length 60 [2019-12-27 06:54:56,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:56,030 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 533 transitions. [2019-12-27 06:54:56,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 06:54:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 533 transitions. [2019-12-27 06:54:56,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:54:56,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:56,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:56,031 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:56,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:56,032 INFO L82 PathProgramCache]: Analyzing trace with hash -597728434, now seen corresponding path program 4 times [2019-12-27 06:54:56,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:56,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877614919] [2019-12-27 06:54:56,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:56,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877614919] [2019-12-27 06:54:56,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:56,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:54:56,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258599902] [2019-12-27 06:54:56,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:54:56,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:56,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:54:56,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:54:56,318 INFO L87 Difference]: Start difference. First operand 314 states and 533 transitions. Second operand 14 states. [2019-12-27 06:54:56,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:56,786 INFO L93 Difference]: Finished difference Result 424 states and 699 transitions. [2019-12-27 06:54:56,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:54:56,786 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-27 06:54:56,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:56,787 INFO L225 Difference]: With dead ends: 424 [2019-12-27 06:54:56,787 INFO L226 Difference]: Without dead ends: 392 [2019-12-27 06:54:56,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-27 06:54:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-12-27 06:54:56,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 322. [2019-12-27 06:54:56,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 06:54:56,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 547 transitions. [2019-12-27 06:54:56,791 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 547 transitions. Word has length 60 [2019-12-27 06:54:56,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:56,791 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 547 transitions. [2019-12-27 06:54:56,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:54:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 547 transitions. [2019-12-27 06:54:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:54:56,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:56,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:56,792 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:56,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:56,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1167049754, now seen corresponding path program 5 times [2019-12-27 06:54:56,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:56,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143477647] [2019-12-27 06:54:56,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:54:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:54:56,902 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:54:56,903 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:54:56,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1461~0.base_22| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1461~0.base_22|) |v_ULTIMATE.start_main_~#t1461~0.offset_17| 0)) |v_#memory_int_27|) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~__unbuffered_p3_EAX~0_10) (= v_~z$r_buff0_thd4~0_27 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_26 0) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~z$r_buff1_thd3~0_18) (< 0 |v_#StackHeapBarrier_21|) (= v_~x~0_13 0) (= 0 v_~z$w_buff1~0_21) (= 0 v_~z$r_buff1_thd4~0_20) (= 0 v_~z$flush_delayed~0_15) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_ULTIMATE.start_main_~#t1461~0.offset_17| 0) (= v_~z$r_buff0_thd3~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t1461~0.base_22| 4) |v_#length_31|) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$r_buff1_thd0~0_48) (= 0 v_~z$r_buff1_thd2~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= v_~z$r_buff0_thd1~0_9 0) (= v_~z$mem_tmp~0_10 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1461~0.base_22|) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= v_~y~0_10 0) (= 0 v_~z$w_buff0~0_25) (= 0 v_~z$w_buff1_used~0_65) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1461~0.base_22| 1)) (= (select .cse0 |v_ULTIMATE.start_main_~#t1461~0.base_22|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, ULTIMATE.start_main_~#t1464~0.base=|v_ULTIMATE.start_main_~#t1464~0.base_20|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_~#t1461~0.base=|v_ULTIMATE.start_main_~#t1461~0.base_22|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ULTIMATE.start_main_~#t1463~0.offset=|v_ULTIMATE.start_main_~#t1463~0.offset_17|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_31|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_65, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_16|, ~z$flush_delayed~0=v_~z$flush_delayed~0_15, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_13|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_13, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~z$w_buff1~0=v_~z$w_buff1~0_21, ULTIMATE.start_main_~#t1464~0.offset=|v_ULTIMATE.start_main_~#t1464~0.offset_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_16|, ULTIMATE.start_main_~#t1462~0.base=|v_ULTIMATE.start_main_~#t1462~0.base_23|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_48, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_9|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_17|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, ULTIMATE.start_main_~#t1462~0.offset=|v_ULTIMATE.start_main_~#t1462~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~#t1463~0.base=|v_ULTIMATE.start_main_~#t1463~0.base_20|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9, ULTIMATE.start_main_~#t1461~0.offset=|v_ULTIMATE.start_main_~#t1461~0.offset_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1464~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1461~0.base, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1463~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ULTIMATE.start_main_~#t1464~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1462~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1462~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1463~0.base, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1461~0.offset] because there is no mapped edge [2019-12-27 06:54:56,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L823-1-->L825: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1462~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1462~0.base_13|) |v_ULTIMATE.start_main_~#t1462~0.offset_11| 1)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1462~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1462~0.base_13|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1462~0.base_13|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1462~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t1462~0.base_13| 0)) (= |v_ULTIMATE.start_main_~#t1462~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1462~0.base=|v_ULTIMATE.start_main_~#t1462~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1462~0.offset=|v_ULTIMATE.start_main_~#t1462~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1462~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1462~0.offset] because there is no mapped edge [2019-12-27 06:54:56,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L825-1-->L827: Formula: (and (= |v_ULTIMATE.start_main_~#t1463~0.offset_10| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1463~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1463~0.base_10|) |v_ULTIMATE.start_main_~#t1463~0.offset_10| 2)) |v_#memory_int_15|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1463~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t1463~0.base_10| 0)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1463~0.base_10| 4) |v_#length_19|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1463~0.base_10|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1463~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1463~0.base=|v_ULTIMATE.start_main_~#t1463~0.base_10|, ULTIMATE.start_main_~#t1463~0.offset=|v_ULTIMATE.start_main_~#t1463~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_19|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1463~0.base, ULTIMATE.start_main_~#t1463~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 06:54:56,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L827-1-->L829: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1464~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1464~0.base_11|) |v_ULTIMATE.start_main_~#t1464~0.offset_10| 3)) |v_#memory_int_17|) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1464~0.base_11|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1464~0.base_11| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1464~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1464~0.base_11|)) (= |v_ULTIMATE.start_main_~#t1464~0.offset_10| 0) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1464~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1464~0.base=|v_ULTIMATE.start_main_~#t1464~0.base_11|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1464~0.offset=|v_ULTIMATE.start_main_~#t1464~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1464~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1464~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 06:54:56,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L4-->L800: Formula: (and (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1621069811 0)) (= 1 ~z$r_buff0_thd4~0_Out-1621069811) (= ~z$r_buff0_thd4~0_In-1621069811 ~z$r_buff1_thd4~0_Out-1621069811) (= ~a~0_In-1621069811 ~__unbuffered_p3_EAX~0_Out-1621069811) (= ~z$r_buff1_thd2~0_Out-1621069811 ~z$r_buff0_thd2~0_In-1621069811) (= ~z$r_buff0_thd1~0_In-1621069811 ~z$r_buff1_thd1~0_Out-1621069811) (= ~z$r_buff0_thd0~0_In-1621069811 ~z$r_buff1_thd0~0_Out-1621069811) (= ~z$r_buff1_thd3~0_Out-1621069811 ~z$r_buff0_thd3~0_In-1621069811)) InVars {~a~0=~a~0_In-1621069811, P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1621069811, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1621069811, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1621069811, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1621069811, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1621069811, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1621069811} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1621069811, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1621069811, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1621069811, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1621069811, ~a~0=~a~0_In-1621069811, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1621069811, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1621069811, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1621069811, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1621069811, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1621069811, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1621069811, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1621069811, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1621069811} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 06:54:56,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~a~0_6) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_9, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 06:54:56,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p1_EAX~0_7 v_~y~0_7) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x~0_10 2) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_7} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_7, ~x~0=v_~x~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:54:56,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1540672662 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1540672662 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-1540672662| ~z$w_buff0_used~0_In-1540672662)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-1540672662| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1540672662, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1540672662} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1540672662, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1540672662, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-1540672662|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 06:54:56,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L770-2-->L770-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-334631047 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-334631047 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-334631047 |P2Thread1of1ForFork2_#t~ite3_Out-334631047|) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In-334631047 |P2Thread1of1ForFork2_#t~ite3_Out-334631047|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-334631047, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-334631047, ~z$w_buff1~0=~z$w_buff1~0_In-334631047, ~z~0=~z~0_In-334631047} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-334631047|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-334631047, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-334631047, ~z$w_buff1~0=~z$w_buff1~0_In-334631047, ~z~0=~z~0_In-334631047} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:54:56,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L770-4-->L771: Formula: (= v_~z~0_19 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 06:54:56,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In1951197663 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1951197663 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1951197663 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1951197663 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1951197663 |P3Thread1of1ForFork3_#t~ite12_Out1951197663|) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork3_#t~ite12_Out1951197663| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1951197663, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1951197663, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1951197663, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1951197663} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1951197663, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1951197663, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1951197663, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1951197663, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1951197663|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 06:54:56,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L803-->L804: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-576821911 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-576821911 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-576821911)) (and (= ~z$r_buff0_thd4~0_Out-576821911 ~z$r_buff0_thd4~0_In-576821911) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-576821911, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-576821911} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-576821911, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-576821911, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-576821911|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 06:54:56,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L804-->L804-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1368787472 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1368787472 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1368787472 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-1368787472 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out-1368787472| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out-1368787472| ~z$r_buff1_thd4~0_In-1368787472)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1368787472, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1368787472, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1368787472, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1368787472} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1368787472, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1368787472, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1368787472|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1368787472, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1368787472} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 06:54:56,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L804-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_16) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 06:54:56,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1820935429 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1820935429 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-1820935429|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1820935429 |P2Thread1of1ForFork2_#t~ite5_Out-1820935429|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1820935429, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1820935429} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1820935429|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1820935429, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1820935429} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 06:54:56,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L772-->L772-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In910316702 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In910316702 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In910316702 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In910316702 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite6_Out910316702| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite6_Out910316702| ~z$w_buff1_used~0_In910316702)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In910316702, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In910316702, ~z$w_buff1_used~0=~z$w_buff1_used~0_In910316702, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In910316702} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out910316702|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In910316702, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In910316702, ~z$w_buff1_used~0=~z$w_buff1_used~0_In910316702, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In910316702} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 06:54:56,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1047326596 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1047326596 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out1047326596| ~z$r_buff0_thd3~0_In1047326596) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out1047326596|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1047326596, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1047326596} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1047326596, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1047326596, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1047326596|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 06:54:56,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1745997577 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1745997577 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1745997577 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1745997577 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In-1745997577 |P2Thread1of1ForFork2_#t~ite8_Out-1745997577|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-1745997577|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1745997577, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1745997577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1745997577, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1745997577} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1745997577, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1745997577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1745997577, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1745997577, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1745997577|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:54:56,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_24 1) v_~__unbuffered_cnt~0_23) (= v_~z$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork2_#t~ite8_8|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:54:56,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L833-->L835-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_50 256)) (= 0 (mod v_~z$w_buff0_used~0_72 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_50, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_72, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_50, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_72, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:54:56,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L835-2-->L835-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In532435719 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In532435719 256)))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out532435719| ~z$w_buff1~0_In532435719) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite19_Out532435719| ~z~0_In532435719)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In532435719, ~z$w_buff1_used~0=~z$w_buff1_used~0_In532435719, ~z$w_buff1~0=~z$w_buff1~0_In532435719, ~z~0=~z~0_In532435719} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out532435719|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In532435719, ~z$w_buff1_used~0=~z$w_buff1_used~0_In532435719, ~z$w_buff1~0=~z$w_buff1~0_In532435719, ~z~0=~z~0_In532435719} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:54:56,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-4-->L836: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_18, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:54:56,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1460893707 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1460893707 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1460893707| 0)) (and (= |ULTIMATE.start_main_#t~ite21_Out-1460893707| ~z$w_buff0_used~0_In-1460893707) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1460893707, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1460893707} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1460893707, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1460893707, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1460893707|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:54:56,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L837-->L837-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1861241557 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1861241557 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1861241557 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1861241557 256) 0))) (or (and (= ~z$w_buff1_used~0_In-1861241557 |ULTIMATE.start_main_#t~ite22_Out-1861241557|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1861241557|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1861241557, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1861241557, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1861241557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1861241557} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1861241557, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1861241557, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1861241557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1861241557, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1861241557|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:54:56,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In79179452 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In79179452 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out79179452| ~z$r_buff0_thd0~0_In79179452)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out79179452| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In79179452, ~z$w_buff0_used~0=~z$w_buff0_used~0_In79179452} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In79179452, ~z$w_buff0_used~0=~z$w_buff0_used~0_In79179452, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out79179452|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 06:54:56,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L839-->L839-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-496851787 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-496851787 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-496851787 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-496851787 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite24_Out-496851787| ~z$r_buff1_thd0~0_In-496851787)) (and (= |ULTIMATE.start_main_#t~ite24_Out-496851787| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-496851787, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-496851787, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-496851787, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-496851787} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-496851787, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-496851787, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-496851787, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-496851787|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-496851787} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 06:54:56,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L848-->L848-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1915985519 256)))) (or (and (= |ULTIMATE.start_main_#t~ite33_Out1915985519| ~z$w_buff1~0_In1915985519) .cse0 (= |ULTIMATE.start_main_#t~ite33_Out1915985519| |ULTIMATE.start_main_#t~ite34_Out1915985519|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1915985519 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In1915985519 256)) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In1915985519 256) 0)) (= (mod ~z$w_buff0_used~0_In1915985519 256) 0)))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out1915985519| ~z$w_buff1~0_In1915985519) (= |ULTIMATE.start_main_#t~ite33_In1915985519| |ULTIMATE.start_main_#t~ite33_Out1915985519|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1915985519, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1915985519, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1915985519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1915985519, ~z$w_buff1~0=~z$w_buff1~0_In1915985519, ~weak$$choice2~0=~weak$$choice2~0_In1915985519, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In1915985519|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1915985519, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1915985519, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1915985519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1915985519, ~z$w_buff1~0=~z$w_buff1~0_In1915985519, ~weak$$choice2~0=~weak$$choice2~0_In1915985519, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1915985519|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1915985519|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 06:54:56,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L850-->L850-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1522174618 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite39_Out-1522174618| ~z$w_buff1_used~0_In-1522174618) (= |ULTIMATE.start_main_#t~ite39_Out-1522174618| |ULTIMATE.start_main_#t~ite40_Out-1522174618|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1522174618 256)))) (or (and (= 0 (mod ~z$r_buff1_thd0~0_In-1522174618 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-1522174618 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-1522174618 256) 0)))) (and (= |ULTIMATE.start_main_#t~ite40_Out-1522174618| ~z$w_buff1_used~0_In-1522174618) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_In-1522174618| |ULTIMATE.start_main_#t~ite39_Out-1522174618|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1522174618, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1522174618, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-1522174618|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1522174618, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1522174618, ~weak$$choice2~0=~weak$$choice2~0_In-1522174618} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1522174618, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1522174618|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1522174618|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1522174618, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1522174618, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1522174618, ~weak$$choice2~0=~weak$$choice2~0_In-1522174618} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:54:56,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L851-->L852: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd0~0_69 v_~z$r_buff0_thd0~0_70)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:54:56,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L852-->L852-8: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In227551303 256) 0)) (.cse0 (= (mod ~weak$$choice2~0_In227551303 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In227551303 256))) (.cse5 (= |ULTIMATE.start_main_#t~ite46_Out227551303| |ULTIMATE.start_main_#t~ite45_Out227551303|)) (.cse4 (= 0 (mod ~z$w_buff0_used~0_In227551303 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In227551303 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_In227551303| |ULTIMATE.start_main_#t~ite44_Out227551303|) (or (and (= |ULTIMATE.start_main_#t~ite45_Out227551303| |ULTIMATE.start_main_#t~ite45_In227551303|) (not .cse0) (= ~z$r_buff1_thd0~0_In227551303 |ULTIMATE.start_main_#t~ite46_Out227551303|)) (and .cse0 (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4) .cse5 (= ~z$r_buff1_thd0~0_In227551303 |ULTIMATE.start_main_#t~ite45_Out227551303|)))) (let ((.cse6 (not .cse2))) (and (or .cse6 (not .cse1)) .cse0 (or (not .cse3) .cse6) (= |ULTIMATE.start_main_#t~ite45_Out227551303| |ULTIMATE.start_main_#t~ite44_Out227551303|) .cse5 (= 0 |ULTIMATE.start_main_#t~ite44_Out227551303|) (not .cse4))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In227551303, ~z$w_buff0_used~0=~z$w_buff0_used~0_In227551303, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In227551303, ~z$w_buff1_used~0=~z$w_buff1_used~0_In227551303, ~weak$$choice2~0=~weak$$choice2~0_In227551303, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In227551303|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In227551303|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In227551303, ~z$w_buff0_used~0=~z$w_buff0_used~0_In227551303, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In227551303, ~z$w_buff1_used~0=~z$w_buff1_used~0_In227551303, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out227551303|, ~weak$$choice2~0=~weak$$choice2~0_In227551303, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out227551303|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out227551303|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:54:56,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L854-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_22 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:54:56,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:54:57,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:54:57 BasicIcfg [2019-12-27 06:54:57,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:54:57,012 INFO L168 Benchmark]: Toolchain (without parser) took 39426.42 ms. Allocated memory was 139.5 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 101.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 519.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:57,013 INFO L168 Benchmark]: CDTParser took 1.45 ms. Allocated memory is still 139.5 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 06:54:57,014 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.98 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 101.0 MB in the beginning and 155.1 MB in the end (delta: -54.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:57,014 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.33 ms. Allocated memory is still 202.4 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:57,015 INFO L168 Benchmark]: Boogie Preprocessor took 40.00 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 149.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:57,015 INFO L168 Benchmark]: RCFGBuilder took 889.03 ms. Allocated memory is still 202.4 MB. Free memory was 149.7 MB in the beginning and 101.0 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:57,016 INFO L168 Benchmark]: TraceAbstraction took 37614.74 ms. Allocated memory was 202.4 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 100.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 455.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:57,019 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.45 ms. Allocated memory is still 139.5 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 805.98 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 101.0 MB in the beginning and 155.1 MB in the end (delta: -54.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.33 ms. Allocated memory is still 202.4 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.00 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 149.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 889.03 ms. Allocated memory is still 202.4 MB. Free memory was 149.7 MB in the beginning and 101.0 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37614.74 ms. Allocated memory was 202.4 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 100.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 455.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 179 ProgramPointsBefore, 91 ProgramPointsAfterwards, 207 TransitionsBefore, 96 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 4854 VarBasedMoverChecksPositive, 171 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51526 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 4 z$w_buff1 = z$w_buff0 [L785] 4 z$w_buff0 = 2 [L786] 4 z$w_buff1_used = z$w_buff0_used [L787] 4 z$w_buff0_used = (_Bool)1 [L800] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 1 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L770] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L839] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 z$flush_delayed = weak$$choice2 [L845] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L847] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L848] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L849] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 37.3s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2184 SDtfs, 2601 SDslu, 5452 SDs, 0 SdLazy, 2185 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56294occurred 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: 14.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 40535 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 872 NumberOfCodeBlocks, 872 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 793 ConstructedInterpolants, 0 QuantifiedInterpolants, 169897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...