/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:59:46,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:59:46,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:59:46,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:59:46,353 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:59:46,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:59:46,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:59:46,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:59:46,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:59:46,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:59:46,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:59:46,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:59:46,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:59:46,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:59:46,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:59:46,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:59:46,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:59:46,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:59:46,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:59:46,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:59:46,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:59:46,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:59:46,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:59:46,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:59:46,387 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:59:46,387 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:59:46,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:59:46,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:59:46,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:59:46,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:59:46,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:59:46,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:59:46,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:59:46,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:59:46,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:59:46,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:59:46,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:59:46,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:59:46,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:59:46,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:59:46,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:59:46,407 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-MCR.epf [2019-12-27 21:59:46,433 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:59:46,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:59:46,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:59:46,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:59:46,436 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:59:46,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:59:46,437 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:59:46,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:59:46,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:59:46,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:59:46,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:59:46,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:59:46,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:59:46,439 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:59:46,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:59:46,440 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:59:46,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:59:46,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:59:46,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:59:46,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:59:46,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:59:46,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:59:46,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:59:46,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:59:46,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:59:46,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:59:46,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:59:46,442 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:59:46,442 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:59:46,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:59:46,444 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:59:46,444 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:59:46,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:59:46,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:59:46,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:59:46,766 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:59:46,767 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:59:46,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.oepc.i [2019-12-27 21:59:46,828 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90763340e/f13bb51b21854f5a83f9af07de5baa6e/FLAG09f874745 [2019-12-27 21:59:47,383 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:59:47,384 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_tso.oepc.i [2019-12-27 21:59:47,398 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90763340e/f13bb51b21854f5a83f9af07de5baa6e/FLAG09f874745 [2019-12-27 21:59:47,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90763340e/f13bb51b21854f5a83f9af07de5baa6e [2019-12-27 21:59:47,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:59:47,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:59:47,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:59:47,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:59:47,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:59:47,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:59:47" (1/1) ... [2019-12-27 21:59:47,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78428862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:47, skipping insertion in model container [2019-12-27 21:59:47,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:59:47" (1/1) ... [2019-12-27 21:59:47,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:59:47,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:59:48,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:59:48,362 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:59:48,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:59:48,520 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:59:48,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:48 WrapperNode [2019-12-27 21:59:48,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:59:48,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:59:48,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:59:48,524 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:59:48,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:48" (1/1) ... [2019-12-27 21:59:48,561 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:48" (1/1) ... [2019-12-27 21:59:48,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:59:48,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:59:48,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:59:48,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:59:48,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:48" (1/1) ... [2019-12-27 21:59:48,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:48" (1/1) ... [2019-12-27 21:59:48,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:48" (1/1) ... [2019-12-27 21:59:48,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:48" (1/1) ... [2019-12-27 21:59:48,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:48" (1/1) ... [2019-12-27 21:59:48,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:48" (1/1) ... [2019-12-27 21:59:48,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:48" (1/1) ... [2019-12-27 21:59:48,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:59:48,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:59:48,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:59:48,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:59:48,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:48" (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 21:59:48,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:59:48,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:59:48,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:59:48,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:59:48,704 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:59:48,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:59:48,704 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:59:48,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:59:48,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:59:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:59:48,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:59:48,707 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 21:59:49,567 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:59:49,567 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:59:49,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:59:49 BoogieIcfgContainer [2019-12-27 21:59:49,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:59:49,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:59:49,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:59:49,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:59:49,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:59:47" (1/3) ... [2019-12-27 21:59:49,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d0903e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:59:49, skipping insertion in model container [2019-12-27 21:59:49,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:48" (2/3) ... [2019-12-27 21:59:49,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d0903e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:59:49, skipping insertion in model container [2019-12-27 21:59:49,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:59:49" (3/3) ... [2019-12-27 21:59:49,576 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_tso.oepc.i [2019-12-27 21:59:49,583 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:59:49,584 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:59:49,590 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:59:49,591 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:59:49,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,627 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,628 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,637 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,637 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,669 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,675 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,677 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,680 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:49,698 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:59:49,719 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:59:49,719 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:59:49,720 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:59:49,720 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:59:49,720 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:59:49,720 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:59:49,720 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:59:49,720 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:59:49,737 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 244 transitions [2019-12-27 21:59:49,739 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-27 21:59:49,852 INFO L132 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-27 21:59:49,853 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:59:49,875 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 0/178 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 21:59:49,909 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-27 21:59:49,970 INFO L132 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-27 21:59:49,971 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:59:49,983 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 0/178 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 21:59:50,011 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 25246 [2019-12-27 21:59:50,012 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:59:53,101 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-27 21:59:53,338 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 21:59:53,450 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 21:59:53,504 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146475 [2019-12-27 21:59:53,504 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 21:59:53,508 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 139 transitions [2019-12-27 21:59:55,128 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 28693 states. [2019-12-27 21:59:55,130 INFO L276 IsEmpty]: Start isEmpty. Operand 28693 states. [2019-12-27 21:59:55,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:59:55,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:55,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:59:55,138 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:55,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:55,145 INFO L82 PathProgramCache]: Analyzing trace with hash 975635512, now seen corresponding path program 1 times [2019-12-27 21:59:55,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:55,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034204005] [2019-12-27 21:59:55,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:55,406 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 21:59:55,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034204005] [2019-12-27 21:59:55,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:55,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:59:55,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [665956311] [2019-12-27 21:59:55,413 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:55,420 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:55,436 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:59:55,437 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:55,443 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:55,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:59:55,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:55,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:59:55,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:55,461 INFO L87 Difference]: Start difference. First operand 28693 states. Second operand 3 states. [2019-12-27 21:59:56,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:56,051 INFO L93 Difference]: Finished difference Result 28603 states and 100987 transitions. [2019-12-27 21:59:56,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:59:56,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:59:56,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:56,263 INFO L225 Difference]: With dead ends: 28603 [2019-12-27 21:59:56,263 INFO L226 Difference]: Without dead ends: 28044 [2019-12-27 21:59:56,267 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 21:59:57,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28044 states. [2019-12-27 21:59:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28044 to 28044. [2019-12-27 21:59:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28044 states. [2019-12-27 21:59:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28044 states to 28044 states and 99141 transitions. [2019-12-27 21:59:58,568 INFO L78 Accepts]: Start accepts. Automaton has 28044 states and 99141 transitions. Word has length 5 [2019-12-27 21:59:58,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:58,570 INFO L462 AbstractCegarLoop]: Abstraction has 28044 states and 99141 transitions. [2019-12-27 21:59:58,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:59:58,570 INFO L276 IsEmpty]: Start isEmpty. Operand 28044 states and 99141 transitions. [2019-12-27 21:59:58,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:59:58,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:58,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:58,576 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:58,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:58,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1770062859, now seen corresponding path program 1 times [2019-12-27 21:59:58,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:58,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624512840] [2019-12-27 21:59:58,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:58,712 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 21:59:58,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624512840] [2019-12-27 21:59:58,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:58,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:59:58,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1285291551] [2019-12-27 21:59:58,713 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:58,715 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:58,719 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 21:59:58,719 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:58,720 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:58,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:59:58,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:58,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:59:58,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:59:58,722 INFO L87 Difference]: Start difference. First operand 28044 states and 99141 transitions. Second operand 4 states. [2019-12-27 21:59:59,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:59,793 INFO L93 Difference]: Finished difference Result 45067 states and 151887 transitions. [2019-12-27 21:59:59,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:59:59,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:59:59,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:59,978 INFO L225 Difference]: With dead ends: 45067 [2019-12-27 21:59:59,979 INFO L226 Difference]: Without dead ends: 45060 [2019-12-27 21:59:59,983 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 22:00:00,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45060 states. [2019-12-27 22:00:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45060 to 43678. [2019-12-27 22:00:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43678 states. [2019-12-27 22:00:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43678 states to 43678 states and 148274 transitions. [2019-12-27 22:00:02,973 INFO L78 Accepts]: Start accepts. Automaton has 43678 states and 148274 transitions. Word has length 11 [2019-12-27 22:00:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:00:02,973 INFO L462 AbstractCegarLoop]: Abstraction has 43678 states and 148274 transitions. [2019-12-27 22:00:02,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:00:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 43678 states and 148274 transitions. [2019-12-27 22:00:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:00:02,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:00:02,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:00:02,976 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:00:02,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:00:02,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1314739975, now seen corresponding path program 1 times [2019-12-27 22:00:02,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:00:02,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522490936] [2019-12-27 22:00:02,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:00:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:00:03,037 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 22:00:03,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522490936] [2019-12-27 22:00:03,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:00:03,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:00:03,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [804090791] [2019-12-27 22:00:03,038 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:00:03,039 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:00:03,040 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:00:03,041 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:00:03,041 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:00:03,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:00:03,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:00:03,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:00:03,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:00:03,042 INFO L87 Difference]: Start difference. First operand 43678 states and 148274 transitions. Second operand 4 states. [2019-12-27 22:00:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:00:03,577 INFO L93 Difference]: Finished difference Result 54479 states and 183229 transitions. [2019-12-27 22:00:03,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:00:03,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:00:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:00:03,905 INFO L225 Difference]: With dead ends: 54479 [2019-12-27 22:00:03,905 INFO L226 Difference]: Without dead ends: 54479 [2019-12-27 22:00:03,906 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 22:00:06,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54479 states. [2019-12-27 22:00:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54479 to 49001. [2019-12-27 22:00:06,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49001 states. [2019-12-27 22:00:07,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49001 states to 49001 states and 166041 transitions. [2019-12-27 22:00:07,092 INFO L78 Accepts]: Start accepts. Automaton has 49001 states and 166041 transitions. Word has length 11 [2019-12-27 22:00:07,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:00:07,093 INFO L462 AbstractCegarLoop]: Abstraction has 49001 states and 166041 transitions. [2019-12-27 22:00:07,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:00:07,093 INFO L276 IsEmpty]: Start isEmpty. Operand 49001 states and 166041 transitions. [2019-12-27 22:00:07,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 22:00:07,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:00:07,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:00:07,099 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:00:07,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:00:07,099 INFO L82 PathProgramCache]: Analyzing trace with hash -23474940, now seen corresponding path program 1 times [2019-12-27 22:00:07,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:00:07,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079722123] [2019-12-27 22:00:07,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:00:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:00:07,191 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 22:00:07,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079722123] [2019-12-27 22:00:07,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:00:07,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:00:07,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1621728233] [2019-12-27 22:00:07,193 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:00:07,195 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:00:07,199 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 53 transitions. [2019-12-27 22:00:07,199 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:00:07,200 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:00:07,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:00:07,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:00:07,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:00:07,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:00:07,201 INFO L87 Difference]: Start difference. First operand 49001 states and 166041 transitions. Second operand 5 states. [2019-12-27 22:00:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:00:08,479 INFO L93 Difference]: Finished difference Result 64731 states and 215221 transitions. [2019-12-27 22:00:08,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:00:08,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 22:00:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:00:08,649 INFO L225 Difference]: With dead ends: 64731 [2019-12-27 22:00:08,650 INFO L226 Difference]: Without dead ends: 64724 [2019-12-27 22:00:08,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 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 22:00:09,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64724 states. [2019-12-27 22:00:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64724 to 48844. [2019-12-27 22:00:11,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48844 states. [2019-12-27 22:00:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48844 states to 48844 states and 165414 transitions. [2019-12-27 22:00:11,987 INFO L78 Accepts]: Start accepts. Automaton has 48844 states and 165414 transitions. Word has length 17 [2019-12-27 22:00:11,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:00:11,987 INFO L462 AbstractCegarLoop]: Abstraction has 48844 states and 165414 transitions. [2019-12-27 22:00:11,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:00:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 48844 states and 165414 transitions. [2019-12-27 22:00:12,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:00:12,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:00:12,011 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] [2019-12-27 22:00:12,012 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:00:12,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:00:12,014 INFO L82 PathProgramCache]: Analyzing trace with hash 952945058, now seen corresponding path program 1 times [2019-12-27 22:00:12,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:00:12,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694046511] [2019-12-27 22:00:12,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:00:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:00:12,133 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 22:00:12,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694046511] [2019-12-27 22:00:12,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:00:12,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:00:12,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2073558467] [2019-12-27 22:00:12,134 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:00:12,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:00:12,139 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:00:12,139 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:00:12,140 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:00:12,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:00:12,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:00:12,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:00:12,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:00:12,140 INFO L87 Difference]: Start difference. First operand 48844 states and 165414 transitions. Second operand 4 states. [2019-12-27 22:00:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:00:12,191 INFO L93 Difference]: Finished difference Result 5701 states and 14235 transitions. [2019-12-27 22:00:12,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:00:12,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 22:00:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:00:12,200 INFO L225 Difference]: With dead ends: 5701 [2019-12-27 22:00:12,200 INFO L226 Difference]: Without dead ends: 4806 [2019-12-27 22:00:12,201 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 22:00:12,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2019-12-27 22:00:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 4806. [2019-12-27 22:00:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4806 states. [2019-12-27 22:00:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4806 states to 4806 states and 11494 transitions. [2019-12-27 22:00:12,281 INFO L78 Accepts]: Start accepts. Automaton has 4806 states and 11494 transitions. Word has length 25 [2019-12-27 22:00:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:00:12,281 INFO L462 AbstractCegarLoop]: Abstraction has 4806 states and 11494 transitions. [2019-12-27 22:00:12,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:00:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 4806 states and 11494 transitions. [2019-12-27 22:00:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:00:12,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:00:12,287 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] [2019-12-27 22:00:12,287 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:00:12,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:00:12,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1877799940, now seen corresponding path program 1 times [2019-12-27 22:00:12,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:00:12,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852643594] [2019-12-27 22:00:12,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:00:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:00:12,447 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 22:00:12,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852643594] [2019-12-27 22:00:12,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:00:12,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:00:12,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1339165877] [2019-12-27 22:00:12,448 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:00:12,457 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:00:12,475 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 85 transitions. [2019-12-27 22:00:12,476 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:00:12,476 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:00:12,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:00:12,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:00:12,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:00:12,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:00:12,478 INFO L87 Difference]: Start difference. First operand 4806 states and 11494 transitions. Second operand 5 states. [2019-12-27 22:00:12,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:00:12,520 INFO L93 Difference]: Finished difference Result 1096 states and 2313 transitions. [2019-12-27 22:00:12,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:00:12,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 22:00:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:00:12,523 INFO L225 Difference]: With dead ends: 1096 [2019-12-27 22:00:12,523 INFO L226 Difference]: Without dead ends: 992 [2019-12-27 22:00:12,523 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 22:00:12,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-12-27 22:00:12,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 950. [2019-12-27 22:00:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-12-27 22:00:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 2011 transitions. [2019-12-27 22:00:12,534 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 2011 transitions. Word has length 37 [2019-12-27 22:00:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:00:12,534 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 2011 transitions. [2019-12-27 22:00:12,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:00:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 2011 transitions. [2019-12-27 22:00:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:00:12,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:00:12,537 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:00:12,537 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:00:12,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:00:12,538 INFO L82 PathProgramCache]: Analyzing trace with hash -273642496, now seen corresponding path program 1 times [2019-12-27 22:00:12,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:00:12,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605239724] [2019-12-27 22:00:12,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:00:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:00:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:00:12,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605239724] [2019-12-27 22:00:12,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:00:12,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:00:12,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [126665365] [2019-12-27 22:00:12,649 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:00:12,676 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:00:12,754 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 127 states and 184 transitions. [2019-12-27 22:00:12,755 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:00:12,756 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:00:12,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:00:12,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:00:12,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:00:12,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:00:12,758 INFO L87 Difference]: Start difference. First operand 950 states and 2011 transitions. Second operand 3 states. [2019-12-27 22:00:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:00:12,774 INFO L93 Difference]: Finished difference Result 950 states and 1969 transitions. [2019-12-27 22:00:12,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:00:12,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-27 22:00:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:00:12,777 INFO L225 Difference]: With dead ends: 950 [2019-12-27 22:00:12,777 INFO L226 Difference]: Without dead ends: 950 [2019-12-27 22:00:12,778 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 22:00:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-12-27 22:00:12,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-12-27 22:00:12,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-12-27 22:00:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1969 transitions. [2019-12-27 22:00:12,786 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1969 transitions. Word has length 68 [2019-12-27 22:00:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:00:12,786 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1969 transitions. [2019-12-27 22:00:12,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:00:12,787 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1969 transitions. [2019-12-27 22:00:12,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 22:00:12,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:00:12,788 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:00:12,789 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:00:12,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:00:12,789 INFO L82 PathProgramCache]: Analyzing trace with hash 392588486, now seen corresponding path program 1 times [2019-12-27 22:00:12,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:00:12,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384531079] [2019-12-27 22:00:12,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:00:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:00:12,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 22:00:12,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384531079] [2019-12-27 22:00:12,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:00:12,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:00:12,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [707272443] [2019-12-27 22:00:12,906 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:00:12,928 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:00:12,984 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 167 transitions. [2019-12-27 22:00:12,985 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:00:12,989 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:00:12,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:00:12,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:00:12,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:00:12,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:00:12,990 INFO L87 Difference]: Start difference. First operand 950 states and 1969 transitions. Second operand 5 states. [2019-12-27 22:00:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:00:13,227 INFO L93 Difference]: Finished difference Result 1088 states and 2217 transitions. [2019-12-27 22:00:13,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:00:13,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-27 22:00:13,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:00:13,229 INFO L225 Difference]: With dead ends: 1088 [2019-12-27 22:00:13,230 INFO L226 Difference]: Without dead ends: 1088 [2019-12-27 22:00:13,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:00:13,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-12-27 22:00:13,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1035. [2019-12-27 22:00:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2019-12-27 22:00:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 2123 transitions. [2019-12-27 22:00:13,247 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 2123 transitions. Word has length 69 [2019-12-27 22:00:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:00:13,247 INFO L462 AbstractCegarLoop]: Abstraction has 1035 states and 2123 transitions. [2019-12-27 22:00:13,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:00:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 2123 transitions. [2019-12-27 22:00:13,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 22:00:13,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:00:13,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:00:13,442 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:00:13,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:00:13,442 INFO L82 PathProgramCache]: Analyzing trace with hash -256828858, now seen corresponding path program 2 times [2019-12-27 22:00:13,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:00:13,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179452107] [2019-12-27 22:00:13,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:00:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:00:13,541 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 22:00:13,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179452107] [2019-12-27 22:00:13,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:00:13,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:00:13,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [397037630] [2019-12-27 22:00:13,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:00:13,564 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:00:13,613 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 126 transitions. [2019-12-27 22:00:13,613 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:00:13,641 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:00:13,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:00:13,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:00:13,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:00:13,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:00:13,643 INFO L87 Difference]: Start difference. First operand 1035 states and 2123 transitions. Second operand 5 states. [2019-12-27 22:00:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:00:13,887 INFO L93 Difference]: Finished difference Result 1138 states and 2304 transitions. [2019-12-27 22:00:13,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:00:13,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-27 22:00:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:00:13,889 INFO L225 Difference]: With dead ends: 1138 [2019-12-27 22:00:13,889 INFO L226 Difference]: Without dead ends: 1138 [2019-12-27 22:00:13,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 5 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 22:00:13,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2019-12-27 22:00:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1042. [2019-12-27 22:00:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2019-12-27 22:00:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 2136 transitions. [2019-12-27 22:00:13,899 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 2136 transitions. Word has length 69 [2019-12-27 22:00:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:00:13,900 INFO L462 AbstractCegarLoop]: Abstraction has 1042 states and 2136 transitions. [2019-12-27 22:00:13,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:00:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 2136 transitions. [2019-12-27 22:00:13,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 22:00:13,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:00:13,902 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:00:13,902 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:00:13,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:00:13,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1924607802, now seen corresponding path program 3 times [2019-12-27 22:00:13,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:00:13,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706822599] [2019-12-27 22:00:13,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:00:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:00:14,078 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 22:00:14,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706822599] [2019-12-27 22:00:14,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:00:14,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:00:14,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1063168271] [2019-12-27 22:00:14,079 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:00:14,101 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:00:14,165 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 140 transitions. [2019-12-27 22:00:14,165 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:00:14,207 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:00:14,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:00:14,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:00:14,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:00:14,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:00:14,209 INFO L87 Difference]: Start difference. First operand 1042 states and 2136 transitions. Second operand 8 states. [2019-12-27 22:00:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:00:14,956 INFO L93 Difference]: Finished difference Result 2277 states and 4639 transitions. [2019-12-27 22:00:14,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 22:00:14,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2019-12-27 22:00:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:00:14,959 INFO L225 Difference]: With dead ends: 2277 [2019-12-27 22:00:14,959 INFO L226 Difference]: Without dead ends: 2277 [2019-12-27 22:00:14,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:00:14,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2019-12-27 22:00:14,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 1410. [2019-12-27 22:00:14,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2019-12-27 22:00:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2915 transitions. [2019-12-27 22:00:14,974 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2915 transitions. Word has length 69 [2019-12-27 22:00:14,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:00:14,974 INFO L462 AbstractCegarLoop]: Abstraction has 1410 states and 2915 transitions. [2019-12-27 22:00:14,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:00:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2915 transitions. [2019-12-27 22:00:14,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 22:00:14,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:00:14,976 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:00:14,977 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:00:14,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:00:14,977 INFO L82 PathProgramCache]: Analyzing trace with hash -630243776, now seen corresponding path program 1 times [2019-12-27 22:00:14,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:00:14,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570145445] [2019-12-27 22:00:14,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:00:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:00:15,100 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 22:00:15,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570145445] [2019-12-27 22:00:15,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:00:15,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:00:15,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1447355321] [2019-12-27 22:00:15,101 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:00:15,122 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:00:15,475 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 127 states and 182 transitions. [2019-12-27 22:00:15,476 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:00:15,478 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:00:15,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:00:15,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:00:15,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:00:15,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:00:15,479 INFO L87 Difference]: Start difference. First operand 1410 states and 2915 transitions. Second operand 6 states. [2019-12-27 22:00:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:00:15,586 INFO L93 Difference]: Finished difference Result 1778 states and 3613 transitions. [2019-12-27 22:00:15,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:00:15,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-27 22:00:15,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:00:15,588 INFO L225 Difference]: With dead ends: 1778 [2019-12-27 22:00:15,588 INFO L226 Difference]: Without dead ends: 338 [2019-12-27 22:00:15,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:00:15,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-12-27 22:00:15,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 308. [2019-12-27 22:00:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-12-27 22:00:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 528 transitions. [2019-12-27 22:00:15,592 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 528 transitions. Word has length 70 [2019-12-27 22:00:15,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:00:15,593 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 528 transitions. [2019-12-27 22:00:15,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:00:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 528 transitions. [2019-12-27 22:00:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 22:00:15,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:00:15,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:00:15,594 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:00:15,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:00:15,595 INFO L82 PathProgramCache]: Analyzing trace with hash 797842854, now seen corresponding path program 1 times [2019-12-27 22:00:15,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:00:15,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538878802] [2019-12-27 22:00:15,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:00:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:00:15,770 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 22:00:15,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538878802] [2019-12-27 22:00:15,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:00:15,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:00:15,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [152568883] [2019-12-27 22:00:15,771 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:00:15,804 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:00:15,866 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 124 transitions. [2019-12-27 22:00:15,866 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:00:16,016 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:00:16,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:00:16,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:00:16,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:00:16,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:00:16,017 INFO L87 Difference]: Start difference. First operand 308 states and 528 transitions. Second operand 12 states. [2019-12-27 22:00:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:00:17,099 INFO L93 Difference]: Finished difference Result 830 states and 1446 transitions. [2019-12-27 22:00:17,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:00:17,100 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-12-27 22:00:17,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:00:17,101 INFO L225 Difference]: With dead ends: 830 [2019-12-27 22:00:17,101 INFO L226 Difference]: Without dead ends: 830 [2019-12-27 22:00:17,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2019-12-27 22:00:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2019-12-27 22:00:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 358. [2019-12-27 22:00:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-12-27 22:00:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 618 transitions. [2019-12-27 22:00:17,107 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 618 transitions. Word has length 70 [2019-12-27 22:00:17,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:00:17,107 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 618 transitions. [2019-12-27 22:00:17,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:00:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 618 transitions. [2019-12-27 22:00:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 22:00:17,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:00:17,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:00:17,108 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:00:17,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:00:17,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2099586582, now seen corresponding path program 2 times [2019-12-27 22:00:17,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:00:17,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361623084] [2019-12-27 22:00:17,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:00:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:00:17,185 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 22:00:17,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361623084] [2019-12-27 22:00:17,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:00:17,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:00:17,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2095855304] [2019-12-27 22:00:17,186 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:00:17,207 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:00:17,543 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 111 transitions. [2019-12-27 22:00:17,544 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:00:17,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:00:17,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:00:17,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:00:17,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:00:17,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:00:17,547 INFO L87 Difference]: Start difference. First operand 358 states and 618 transitions. Second operand 3 states. [2019-12-27 22:00:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:00:17,616 INFO L93 Difference]: Finished difference Result 357 states and 616 transitions. [2019-12-27 22:00:17,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:00:17,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-27 22:00:17,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:00:17,618 INFO L225 Difference]: With dead ends: 357 [2019-12-27 22:00:17,618 INFO L226 Difference]: Without dead ends: 357 [2019-12-27 22:00:17,619 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 22:00:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-27 22:00:17,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 251. [2019-12-27 22:00:17,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-27 22:00:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 419 transitions. [2019-12-27 22:00:17,625 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 419 transitions. Word has length 70 [2019-12-27 22:00:17,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:00:17,626 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 419 transitions. [2019-12-27 22:00:17,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:00:17,626 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 419 transitions. [2019-12-27 22:00:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 22:00:17,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:00:17,627 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:00:17,627 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:00:17,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:00:17,628 INFO L82 PathProgramCache]: Analyzing trace with hash 265573410, now seen corresponding path program 1 times [2019-12-27 22:00:17,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:00:17,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115596768] [2019-12-27 22:00:17,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:00:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:00:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:00:17,873 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:00:17,873 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:00:17,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd0~0_35) (= 0 v_~weak$$choice0~0_10) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1717~0.base_26|) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1717~0.base_26| 1)) (= v_~y$w_buff0_used~0_146 0) (= 0 v_~y$flush_delayed~0_22) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_40) (= v_~y~0_38 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1717~0.base_26|) 0) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (= 0 v_~__unbuffered_cnt~0_14) (= v_~y$r_buff0_thd0~0_69 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1717~0.base_26| 4)) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$r_buff0_thd2~0_75 0) (= 0 v_~y$w_buff1~0_35) (= 0 v_~y$w_buff0~0_38) (= v_~y$w_buff1_used~0_78 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1717~0.base_26| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1717~0.base_26|) |v_ULTIMATE.start_main_~#t1717~0.offset_20| 0)) |v_#memory_int_17|) (= v_~y$mem_tmp~0_12 0) (= |v_#NULL.offset_4| 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= |v_ULTIMATE.start_main_~#t1717~0.offset_20| 0) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_~y$r_buff0_thd1~0_20 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_13|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_23|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_15|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_14|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_20, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_9|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_14|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_15|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_14|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_15|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_13|, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1717~0.offset=|v_ULTIMATE.start_main_~#t1717~0.offset_20|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_75, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_35, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_146, ULTIMATE.start_main_~#t1718~0.offset=|v_ULTIMATE.start_main_~#t1718~0.offset_20|, ULTIMATE.start_main_~#t1717~0.base=|v_ULTIMATE.start_main_~#t1717~0.base_26|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_15|, ~y$w_buff0~0=v_~y$w_buff0~0_38, ~y~0=v_~y~0_38, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_16|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_14|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_13|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_40, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_69, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ULTIMATE.start_main_~#t1718~0.base=|v_ULTIMATE.start_main_~#t1718~0.base_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1717~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1718~0.offset, ULTIMATE.start_main_~#t1717~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ULTIMATE.start_main_~#t1718~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:00:17,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [974] [974] L797-1-->L799: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1718~0.base_13| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1718~0.base_13|) (= 0 (select |v_#valid_27| |v_ULTIMATE.start_main_~#t1718~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1718~0.base_13|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1718~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1718~0.base_13|) |v_ULTIMATE.start_main_~#t1718~0.offset_11| 1)) |v_#memory_int_9|) (= (store |v_#valid_27| |v_ULTIMATE.start_main_~#t1718~0.base_13| 1) |v_#valid_26|) (= |v_ULTIMATE.start_main_~#t1718~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1718~0.offset=|v_ULTIMATE.start_main_~#t1718~0.offset_11|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1718~0.base=|v_ULTIMATE.start_main_~#t1718~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1718~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1718~0.base] because there is no mapped edge [2019-12-27 22:00:17,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~y$w_buff1_used~0_59 v_~y$w_buff0_used~0_108) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~y$w_buff0~0_26 v_~y$w_buff1~0_19) (= 2 v_~y$w_buff0~0_25) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 0 (mod v_~y$w_buff1_used~0_59 256)) (= v_~y$w_buff0_used~0_107 1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ~y$w_buff0~0=v_~y$w_buff0~0_26, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_107, ~y$w_buff1~0=v_~y$w_buff1~0_19, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~y$w_buff0~0=v_~y$w_buff0~0_25, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_59} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:00:17,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L759-2-->L759-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite11_Out1339578025| |P1Thread1of1ForFork1_#t~ite12_Out1339578025|)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1339578025 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1339578025 256)))) (or (and .cse0 (= ~y$w_buff0~0_In1339578025 |P1Thread1of1ForFork1_#t~ite11_Out1339578025|) (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~y$w_buff1~0_In1339578025 |P1Thread1of1ForFork1_#t~ite11_Out1339578025|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1339578025, ~y$w_buff1~0=~y$w_buff1~0_In1339578025, ~y$w_buff0~0=~y$w_buff0~0_In1339578025, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1339578025} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1339578025, ~y$w_buff1~0=~y$w_buff1~0_In1339578025, ~y$w_buff0~0=~y$w_buff0~0_In1339578025, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1339578025, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1339578025|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1339578025|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:00:17,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_58 v_~y$r_buff0_thd2~0_57)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 22:00:17,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In210822853 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In210822853 |P1Thread1of1ForFork1_#t~ite31_Out210822853|)) (and (= ~y~0_In210822853 |P1Thread1of1ForFork1_#t~ite31_Out210822853|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In210822853, ~y$flush_delayed~0=~y$flush_delayed~0_In210822853, ~y~0=~y~0_In210822853} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In210822853, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out210822853|, ~y$flush_delayed~0=~y$flush_delayed~0_In210822853, ~y~0=~y~0_In210822853} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 22:00:17,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-308459461 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-308459461 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-308459461| |P0Thread1of1ForFork0_#t~ite4_Out-308459461|))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out-308459461| ~y~0_In-308459461) .cse2) (and (= |P0Thread1of1ForFork0_#t~ite3_Out-308459461| ~y$w_buff1~0_In-308459461) (not .cse1) (not .cse0) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-308459461, ~y$w_buff1~0=~y$w_buff1~0_In-308459461, ~y~0=~y~0_In-308459461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-308459461} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-308459461, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-308459461|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-308459461|, ~y$w_buff1~0=~y$w_buff1~0_In-308459461, ~y~0=~y~0_In-308459461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-308459461} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 22:00:17,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1210356819 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1210356819 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1210356819|)) (and (= ~y$w_buff0_used~0_In-1210356819 |P0Thread1of1ForFork0_#t~ite5_Out-1210356819|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1210356819, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1210356819} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1210356819|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1210356819, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1210356819} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:00:17,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L732-->L732-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1935977217 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1935977217 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1935977217 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In1935977217 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1935977217| 0)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1935977217 |P0Thread1of1ForFork0_#t~ite6_Out1935977217|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1935977217, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1935977217, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1935977217, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1935977217} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1935977217|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1935977217, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1935977217, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1935977217, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1935977217} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:00:17,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1937666002 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1937666002 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1937666002| 0)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out1937666002| ~y$r_buff0_thd1~0_In1937666002) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1937666002, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1937666002} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1937666002, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1937666002|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1937666002} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 22:00:17,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In184102291 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In184102291 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In184102291 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In184102291 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out184102291| ~y$r_buff1_thd1~0_In184102291) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out184102291| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In184102291, ~y$w_buff0_used~0=~y$w_buff0_used~0_In184102291, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In184102291, ~y$w_buff1_used~0=~y$w_buff1_used~0_In184102291} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In184102291, ~y$w_buff0_used~0=~y$w_buff0_used~0_In184102291, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out184102291|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In184102291, ~y$w_buff1_used~0=~y$w_buff1_used~0_In184102291} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:00:17,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L734-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_15) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_15, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:00:17,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-641749617 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-641749617 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-641749617|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-641749617 |P1Thread1of1ForFork1_#t~ite34_Out-641749617|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-641749617, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-641749617} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-641749617, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-641749617, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-641749617|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 22:00:17,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-754594107 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-754594107 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-754594107 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-754594107 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-754594107|)) (and (= ~y$w_buff1_used~0_In-754594107 |P1Thread1of1ForFork1_#t~ite35_Out-754594107|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-754594107, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-754594107, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-754594107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-754594107} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-754594107, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-754594107, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-754594107, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-754594107|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-754594107} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 22:00:17,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L777-->L778: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1204615775 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1204615775 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd2~0_Out1204615775 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_Out1204615775 ~y$r_buff0_thd2~0_In1204615775)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1204615775, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1204615775} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1204615775, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1204615775, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1204615775|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 22:00:17,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1796314837 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1796314837 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1796314837 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1796314837 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out1796314837| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out1796314837| ~y$r_buff1_thd2~0_In1796314837) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1796314837, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1796314837, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1796314837, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1796314837} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1796314837, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1796314837, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1796314837, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1796314837|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1796314837} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:00:17,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_34 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:00:17,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_47 256)) (= (mod v_~y$w_buff0_used~0_102 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:00:17,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In528947053 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In528947053 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out528947053| ~y~0_In528947053) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out528947053| ~y$w_buff1~0_In528947053) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In528947053, ~y~0=~y~0_In528947053, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In528947053, ~y$w_buff1_used~0=~y$w_buff1_used~0_In528947053} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out528947053|, ~y$w_buff1~0=~y$w_buff1~0_In528947053, ~y~0=~y~0_In528947053, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In528947053, ~y$w_buff1_used~0=~y$w_buff1_used~0_In528947053} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 22:00:17,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~y~0_25 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 22:00:17,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-644079166 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-644079166 256) 0))) (or (and (= ~y$w_buff0_used~0_In-644079166 |ULTIMATE.start_main_#t~ite42_Out-644079166|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-644079166|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-644079166, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-644079166} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-644079166, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-644079166, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-644079166|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 22:00:17,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1189611404 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1189611404 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1189611404 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1189611404 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1189611404|)) (and (= ~y$w_buff1_used~0_In1189611404 |ULTIMATE.start_main_#t~ite43_Out1189611404|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1189611404, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1189611404, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1189611404, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1189611404} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1189611404, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1189611404, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1189611404|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1189611404, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1189611404} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:00:17,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1451919354 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1451919354 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1451919354| ~y$r_buff0_thd0~0_In1451919354)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1451919354| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1451919354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1451919354} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1451919354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1451919354, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1451919354|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:00:17,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1055573071 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1055573071 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1055573071 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1055573071 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1055573071|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1055573071 |ULTIMATE.start_main_#t~ite45_Out1055573071|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1055573071, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1055573071, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1055573071, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1055573071} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1055573071, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1055573071, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1055573071, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1055573071|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1055573071} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:00:17,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1822017368 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out1822017368| ~y$mem_tmp~0_In1822017368) (not .cse0)) (and .cse0 (= ~y~0_In1822017368 |ULTIMATE.start_main_#t~ite68_Out1822017368|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1822017368, ~y$flush_delayed~0=~y$flush_delayed~0_In1822017368, ~y~0=~y~0_In1822017368} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1822017368, ~y$flush_delayed~0=~y$flush_delayed~0_In1822017368, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1822017368|, ~y~0=~y~0_In1822017368} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 22:00:17,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite68_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_12|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_11|, ~y~0=v_~y~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:00:18,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:00:18 BasicIcfg [2019-12-27 22:00:18,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:00:18,039 INFO L168 Benchmark]: Toolchain (without parser) took 30362.21 ms. Allocated memory was 147.8 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 104.3 MB in the beginning and 886.9 MB in the end (delta: -782.6 MB). Peak memory consumption was 570.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:00:18,040 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 22:00:18,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 844.26 ms. Allocated memory was 147.8 MB in the beginning and 205.0 MB in the end (delta: 57.1 MB). Free memory was 103.9 MB in the beginning and 155.9 MB in the end (delta: -52.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 22:00:18,041 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.14 ms. Allocated memory is still 205.0 MB. Free memory was 155.9 MB in the beginning and 152.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:00:18,044 INFO L168 Benchmark]: Boogie Preprocessor took 41.66 ms. Allocated memory is still 205.0 MB. Free memory was 152.6 MB in the beginning and 150.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:00:18,045 INFO L168 Benchmark]: RCFGBuilder took 925.69 ms. Allocated memory was 205.0 MB in the beginning and 231.7 MB in the end (delta: 26.7 MB). Free memory was 150.0 MB in the beginning and 199.5 MB in the end (delta: -49.5 MB). Peak memory consumption was 60.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:00:18,045 INFO L168 Benchmark]: TraceAbstraction took 28466.20 ms. Allocated memory was 231.7 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 198.2 MB in the beginning and 886.9 MB in the end (delta: -688.7 MB). Peak memory consumption was 580.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:00:18,052 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 844.26 ms. Allocated memory was 147.8 MB in the beginning and 205.0 MB in the end (delta: 57.1 MB). Free memory was 103.9 MB in the beginning and 155.9 MB in the end (delta: -52.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.14 ms. Allocated memory is still 205.0 MB. Free memory was 155.9 MB in the beginning and 152.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.66 ms. Allocated memory is still 205.0 MB. Free memory was 152.6 MB in the beginning and 150.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 925.69 ms. Allocated memory was 205.0 MB in the beginning and 231.7 MB in the end (delta: 26.7 MB). Free memory was 150.0 MB in the beginning and 199.5 MB in the end (delta: -49.5 MB). Peak memory consumption was 60.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28466.20 ms. Allocated memory was 231.7 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 198.2 MB in the beginning and 886.9 MB in the end (delta: -688.7 MB). Peak memory consumption was 580.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 189 ProgramPointsBefore, 114 ProgramPointsAfterwards, 244 TransitionsBefore, 139 TransitionsAfterwards, 25246 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 33 ChoiceCompositions, 10096 VarBasedMoverChecksPositive, 239 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 146475 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] FCALL, FORK 0 pthread_create(&t1718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L750] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L751] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L752] 2 y$r_buff0_thd2 = (_Bool)1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 [L771] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 x = 1 [L727] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L730] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L732] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L733] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L809] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L812] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 0 y$flush_delayed = weak$$choice2 [L815] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L817] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L818] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L819] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L820] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L822] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2652 SDtfs, 2241 SDslu, 5024 SDs, 0 SdLazy, 2995 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 41 SyntacticMatches, 24 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49001occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 24406 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 662 NumberOfCodeBlocks, 662 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 111453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...