/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:57:12,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:57:12,543 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:57:12,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:57:12,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:57:12,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:57:12,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:57:12,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:57:12,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:57:12,562 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:57:12,563 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:57:12,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:57:12,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:57:12,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:57:12,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:57:12,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:57:12,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:57:12,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:57:12,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:57:12,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:57:12,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:57:12,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:57:12,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:57:12,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:57:12,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:57:12,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:57:12,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:57:12,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:57:12,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:57:12,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:57:12,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:57:12,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:57:12,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:57:12,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:57:12,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:57:12,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:57:12,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:57:12,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:57:12,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:57:12,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:57:12,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:57:12,596 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-SemanticLbe.epf [2019-12-27 03:57:12,622 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:57:12,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:57:12,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:57:12,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:57:12,626 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:57:12,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:57:12,626 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:57:12,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:57:12,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:57:12,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:57:12,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:57:12,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:57:12,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:57:12,629 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:57:12,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:57:12,630 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:57:12,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:57:12,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:57:12,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:57:12,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:57:12,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:57:12,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:57:12,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:57:12,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:57:12,632 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:57:12,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:57:12,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:57:12,633 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:57:12,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:57:12,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:57:12,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:57:12,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:57:12,945 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:57:12,946 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:57:12,947 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i [2019-12-27 03:57:13,017 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af1b8b856/d77dda1ce7cf4f318cba983119ec96ae/FLAG49e4d1e42 [2019-12-27 03:57:13,549 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:57:13,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i [2019-12-27 03:57:13,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af1b8b856/d77dda1ce7cf4f318cba983119ec96ae/FLAG49e4d1e42 [2019-12-27 03:57:13,825 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af1b8b856/d77dda1ce7cf4f318cba983119ec96ae [2019-12-27 03:57:13,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:57:13,834 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:57:13,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:57:13,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:57:13,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:57:13,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:57:13" (1/1) ... [2019-12-27 03:57:13,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b447f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:13, skipping insertion in model container [2019-12-27 03:57:13,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:57:13" (1/1) ... [2019-12-27 03:57:13,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:57:13,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:57:14,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:57:14,515 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:57:14,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:57:14,661 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:57:14,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:14 WrapperNode [2019-12-27 03:57:14,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:57:14,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:57:14,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:57:14,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:57:14,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:14" (1/1) ... [2019-12-27 03:57:14,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:14" (1/1) ... [2019-12-27 03:57:14,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:57:14,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:57:14,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:57:14,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:57:14,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:14" (1/1) ... [2019-12-27 03:57:14,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:14" (1/1) ... [2019-12-27 03:57:14,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:14" (1/1) ... [2019-12-27 03:57:14,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:14" (1/1) ... [2019-12-27 03:57:14,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:14" (1/1) ... [2019-12-27 03:57:14,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:14" (1/1) ... [2019-12-27 03:57:14,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:14" (1/1) ... [2019-12-27 03:57:14,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:57:14,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:57:14,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:57:14,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:57:14,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:14" (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 03:57:14,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:57:14,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:57:14,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:57:14,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:57:14,855 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:57:14,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:57:14,859 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:57:14,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:57:14,860 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:57:14,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:57:14,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:57:14,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:57:14,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:57:14,866 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 03:57:15,615 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:57:15,615 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:57:15,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:57:15 BoogieIcfgContainer [2019-12-27 03:57:15,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:57:15,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:57:15,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:57:15,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:57:15,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:57:13" (1/3) ... [2019-12-27 03:57:15,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c652de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:57:15, skipping insertion in model container [2019-12-27 03:57:15,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:14" (2/3) ... [2019-12-27 03:57:15,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c652de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:57:15, skipping insertion in model container [2019-12-27 03:57:15,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:57:15" (3/3) ... [2019-12-27 03:57:15,626 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc.i [2019-12-27 03:57:15,637 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:57:15,638 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:57:15,646 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:57:15,647 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:57:15,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,688 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,688 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,725 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,725 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,725 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,727 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,727 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,748 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,748 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,775 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,775 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,775 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,781 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,781 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,785 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,786 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:15,804 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:57:15,822 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:57:15,822 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:57:15,822 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:57:15,822 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:57:15,822 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:57:15,822 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:57:15,822 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:57:15,822 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:57:15,839 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 03:57:15,841 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 03:57:15,955 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 03:57:15,956 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:57:15,975 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:57:15,997 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 03:57:16,097 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 03:57:16,097 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:57:16,111 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:57:16,135 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 03:57:16,136 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:57:21,783 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 03:57:21,906 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 03:57:21,932 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-27 03:57:21,932 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 03:57:21,936 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-27 03:57:34,283 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-27 03:57:34,285 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-27 03:57:34,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:57:34,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:57:34,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:57:34,292 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:57:34,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:57:34,298 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-27 03:57:34,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:57:34,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184789244] [2019-12-27 03:57:34,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:57:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:57:34,534 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 03:57:34,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184789244] [2019-12-27 03:57:34,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:57:34,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:57:34,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135643578] [2019-12-27 03:57:34,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:57:34,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:57:34,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:57:34,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:57:34,561 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-27 03:57:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:57:37,416 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-27 03:57:37,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:57:37,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:57:37,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:57:38,040 INFO L225 Difference]: With dead ends: 87834 [2019-12-27 03:57:38,040 INFO L226 Difference]: Without dead ends: 82738 [2019-12-27 03:57:38,041 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 03:57:41,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-27 03:57:45,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-27 03:57:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-27 03:57:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-27 03:57:49,163 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-27 03:57:49,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:57:49,164 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-27 03:57:49,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:57:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-27 03:57:49,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:57:49,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:57:49,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:57:49,176 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:57:49,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:57:49,176 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-27 03:57:49,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:57:49,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078855551] [2019-12-27 03:57:49,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:57:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:57:49,348 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 03:57:49,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078855551] [2019-12-27 03:57:49,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:57:49,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:57:49,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626473474] [2019-12-27 03:57:49,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:57:49,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:57:49,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:57:49,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:57:49,351 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-27 03:57:50,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:57:50,425 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-27 03:57:50,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:57:50,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:57:50,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:57:50,955 INFO L225 Difference]: With dead ends: 127286 [2019-12-27 03:57:50,955 INFO L226 Difference]: Without dead ends: 127202 [2019-12-27 03:57:50,956 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 03:57:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-27 03:58:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-27 03:58:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-27 03:58:01,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-27 03:58:01,872 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-27 03:58:01,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:01,873 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-27 03:58:01,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:58:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-27 03:58:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:58:01,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:01,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:58:01,878 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:01,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:01,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-27 03:58:01,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:01,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172162593] [2019-12-27 03:58:01,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:01,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172162593] [2019-12-27 03:58:01,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:01,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:58:01,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109177910] [2019-12-27 03:58:01,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:58:01,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:01,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:58:01,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:58:01,947 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-27 03:58:02,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:02,093 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-27 03:58:02,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:58:02,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:58:02,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:02,186 INFO L225 Difference]: With dead ends: 28492 [2019-12-27 03:58:02,186 INFO L226 Difference]: Without dead ends: 28492 [2019-12-27 03:58:02,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:58:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-27 03:58:02,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-27 03:58:02,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-27 03:58:02,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-27 03:58:02,843 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-27 03:58:02,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:02,843 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-27 03:58:02,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:58:02,843 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-27 03:58:02,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:58:02,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:02,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:58:02,846 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:02,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:02,846 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-27 03:58:02,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:02,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371654680] [2019-12-27 03:58:02,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:02,929 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 03:58:02,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371654680] [2019-12-27 03:58:02,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:02,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:58:02,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672804608] [2019-12-27 03:58:02,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:58:02,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:02,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:58:02,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:58:02,932 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-27 03:58:05,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:05,170 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-27 03:58:05,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:58:05,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 03:58:05,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:05,260 INFO L225 Difference]: With dead ends: 41156 [2019-12-27 03:58:05,260 INFO L226 Difference]: Without dead ends: 41141 [2019-12-27 03:58:05,261 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 03:58:05,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-27 03:58:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-27 03:58:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-27 03:58:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-27 03:58:05,999 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-27 03:58:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:05,999 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-27 03:58:05,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:58:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-27 03:58:06,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:58:06,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:06,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] [2019-12-27 03:58:06,011 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:06,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:06,012 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-27 03:58:06,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:06,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687008749] [2019-12-27 03:58:06,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:06,152 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 03:58:06,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687008749] [2019-12-27 03:58:06,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:06,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:58:06,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164881809] [2019-12-27 03:58:06,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:58:06,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:06,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:58:06,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:58:06,155 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-27 03:58:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:07,121 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-27 03:58:07,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:58:07,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 03:58:07,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:07,240 INFO L225 Difference]: With dead ends: 48363 [2019-12-27 03:58:07,241 INFO L226 Difference]: Without dead ends: 48336 [2019-12-27 03:58:07,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:58:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-27 03:58:08,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-27 03:58:08,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-27 03:58:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-27 03:58:08,563 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-27 03:58:08,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:08,563 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-27 03:58:08,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:58:08,564 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-27 03:58:08,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:58:08,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:08,582 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 03:58:08,583 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:08,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:08,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-27 03:58:08,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:08,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199442419] [2019-12-27 03:58:08,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:08,651 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 03:58:08,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199442419] [2019-12-27 03:58:08,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:08,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:58:08,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105610443] [2019-12-27 03:58:08,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:58:08,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:08,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:58:08,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:58:08,656 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 4 states. [2019-12-27 03:58:08,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:08,724 INFO L93 Difference]: Finished difference Result 12861 states and 39176 transitions. [2019-12-27 03:58:08,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:58:08,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:58:08,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:08,748 INFO L225 Difference]: With dead ends: 12861 [2019-12-27 03:58:08,748 INFO L226 Difference]: Without dead ends: 12861 [2019-12-27 03:58:08,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:58:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-27 03:58:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12721. [2019-12-27 03:58:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12721 states. [2019-12-27 03:58:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 38766 transitions. [2019-12-27 03:58:09,018 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 38766 transitions. Word has length 25 [2019-12-27 03:58:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:09,019 INFO L462 AbstractCegarLoop]: Abstraction has 12721 states and 38766 transitions. [2019-12-27 03:58:09,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:58:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 38766 transitions. [2019-12-27 03:58:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 03:58:09,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:09,041 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] [2019-12-27 03:58:09,041 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:09,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:09,042 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-27 03:58:09,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:09,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182729805] [2019-12-27 03:58:09,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:09,119 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 03:58:09,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182729805] [2019-12-27 03:58:09,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:09,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:58:09,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273860008] [2019-12-27 03:58:09,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:58:09,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:09,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:58:09,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:58:09,121 INFO L87 Difference]: Start difference. First operand 12721 states and 38766 transitions. Second operand 5 states. [2019-12-27 03:58:09,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:09,189 INFO L93 Difference]: Finished difference Result 11425 states and 35436 transitions. [2019-12-27 03:58:09,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:58:09,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 03:58:09,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:09,207 INFO L225 Difference]: With dead ends: 11425 [2019-12-27 03:58:09,207 INFO L226 Difference]: Without dead ends: 11425 [2019-12-27 03:58:09,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:58:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-12-27 03:58:09,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 10977. [2019-12-27 03:58:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-27 03:58:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-27 03:58:09,382 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-27 03:58:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:09,382 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-27 03:58:09,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:58:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-27 03:58:09,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:09,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:09,399 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] [2019-12-27 03:58:09,399 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:09,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:09,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-27 03:58:09,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:09,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708887663] [2019-12-27 03:58:09,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:09,492 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 03:58:09,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708887663] [2019-12-27 03:58:09,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:09,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:58:09,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354132206] [2019-12-27 03:58:09,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:58:09,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:09,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:58:09,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:58:09,494 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 4 states. [2019-12-27 03:58:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:09,563 INFO L93 Difference]: Finished difference Result 20009 states and 62260 transitions. [2019-12-27 03:58:09,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:58:09,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 03:58:09,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:09,578 INFO L225 Difference]: With dead ends: 20009 [2019-12-27 03:58:09,578 INFO L226 Difference]: Without dead ends: 9365 [2019-12-27 03:58:09,578 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 03:58:09,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2019-12-27 03:58:09,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 9365. [2019-12-27 03:58:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-12-27 03:58:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 29013 transitions. [2019-12-27 03:58:09,875 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 29013 transitions. Word has length 53 [2019-12-27 03:58:09,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:09,875 INFO L462 AbstractCegarLoop]: Abstraction has 9365 states and 29013 transitions. [2019-12-27 03:58:09,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:58:09,875 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 29013 transitions. [2019-12-27 03:58:09,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:09,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:09,889 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] [2019-12-27 03:58:09,889 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:09,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:09,889 INFO L82 PathProgramCache]: Analyzing trace with hash 383407097, now seen corresponding path program 2 times [2019-12-27 03:58:09,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:09,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713698262] [2019-12-27 03:58:09,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:09,997 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 03:58:09,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713698262] [2019-12-27 03:58:09,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:09,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:58:09,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586755205] [2019-12-27 03:58:09,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:58:09,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:09,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:58:10,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:58:10,000 INFO L87 Difference]: Start difference. First operand 9365 states and 29013 transitions. Second operand 7 states. [2019-12-27 03:58:10,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:10,460 INFO L93 Difference]: Finished difference Result 23182 states and 71788 transitions. [2019-12-27 03:58:10,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:58:10,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 03:58:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:10,500 INFO L225 Difference]: With dead ends: 23182 [2019-12-27 03:58:10,501 INFO L226 Difference]: Without dead ends: 18276 [2019-12-27 03:58:10,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:58:10,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-12-27 03:58:10,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 11162. [2019-12-27 03:58:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11162 states. [2019-12-27 03:58:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11162 states to 11162 states and 34879 transitions. [2019-12-27 03:58:10,735 INFO L78 Accepts]: Start accepts. Automaton has 11162 states and 34879 transitions. Word has length 53 [2019-12-27 03:58:10,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:10,735 INFO L462 AbstractCegarLoop]: Abstraction has 11162 states and 34879 transitions. [2019-12-27 03:58:10,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:58:10,735 INFO L276 IsEmpty]: Start isEmpty. Operand 11162 states and 34879 transitions. [2019-12-27 03:58:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:10,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:10,751 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] [2019-12-27 03:58:10,751 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:10,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:10,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1401815865, now seen corresponding path program 3 times [2019-12-27 03:58:10,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:10,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312410925] [2019-12-27 03:58:10,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:10,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312410925] [2019-12-27 03:58:10,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:10,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:58:10,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782158966] [2019-12-27 03:58:10,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:58:10,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:10,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:58:10,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:58:10,849 INFO L87 Difference]: Start difference. First operand 11162 states and 34879 transitions. Second operand 7 states. [2019-12-27 03:58:11,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:11,268 INFO L93 Difference]: Finished difference Result 27840 states and 85084 transitions. [2019-12-27 03:58:11,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:58:11,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 03:58:11,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:11,306 INFO L225 Difference]: With dead ends: 27840 [2019-12-27 03:58:11,306 INFO L226 Difference]: Without dead ends: 19924 [2019-12-27 03:58:11,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:58:11,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19924 states. [2019-12-27 03:58:11,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19924 to 13020. [2019-12-27 03:58:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-12-27 03:58:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 40574 transitions. [2019-12-27 03:58:11,574 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 40574 transitions. Word has length 53 [2019-12-27 03:58:11,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:11,574 INFO L462 AbstractCegarLoop]: Abstraction has 13020 states and 40574 transitions. [2019-12-27 03:58:11,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:58:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 40574 transitions. [2019-12-27 03:58:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:11,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:11,593 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] [2019-12-27 03:58:11,593 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:11,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:11,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1901485579, now seen corresponding path program 4 times [2019-12-27 03:58:11,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:11,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734494722] [2019-12-27 03:58:11,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:11,685 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 03:58:11,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734494722] [2019-12-27 03:58:11,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:11,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:58:11,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384375557] [2019-12-27 03:58:11,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:58:11,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:11,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:58:11,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:58:11,687 INFO L87 Difference]: Start difference. First operand 13020 states and 40574 transitions. Second operand 7 states. [2019-12-27 03:58:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:12,034 INFO L93 Difference]: Finished difference Result 25803 states and 80188 transitions. [2019-12-27 03:58:12,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:58:12,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 03:58:12,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:12,069 INFO L225 Difference]: With dead ends: 25803 [2019-12-27 03:58:12,070 INFO L226 Difference]: Without dead ends: 23832 [2019-12-27 03:58:12,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:58:12,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23832 states. [2019-12-27 03:58:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23832 to 13086. [2019-12-27 03:58:12,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13086 states. [2019-12-27 03:58:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13086 states to 13086 states and 40859 transitions. [2019-12-27 03:58:12,576 INFO L78 Accepts]: Start accepts. Automaton has 13086 states and 40859 transitions. Word has length 53 [2019-12-27 03:58:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:12,577 INFO L462 AbstractCegarLoop]: Abstraction has 13086 states and 40859 transitions. [2019-12-27 03:58:12,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:58:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand 13086 states and 40859 transitions. [2019-12-27 03:58:12,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:12,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:12,592 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] [2019-12-27 03:58:12,592 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:12,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:12,593 INFO L82 PathProgramCache]: Analyzing trace with hash -9451933, now seen corresponding path program 1 times [2019-12-27 03:58:12,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:12,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746456919] [2019-12-27 03:58:12,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58: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 03:58:12,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746456919] [2019-12-27 03:58:12,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:12,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:58:12,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620149393] [2019-12-27 03:58:12,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:58:12,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:12,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:58:12,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:58:12,648 INFO L87 Difference]: Start difference. First operand 13086 states and 40859 transitions. Second operand 3 states. [2019-12-27 03:58:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:12,751 INFO L93 Difference]: Finished difference Result 18737 states and 58738 transitions. [2019-12-27 03:58:12,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:58:12,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 03:58:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:12,777 INFO L225 Difference]: With dead ends: 18737 [2019-12-27 03:58:12,777 INFO L226 Difference]: Without dead ends: 18737 [2019-12-27 03:58:12,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:58:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18737 states. [2019-12-27 03:58:13,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18737 to 16909. [2019-12-27 03:58:13,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16909 states. [2019-12-27 03:58:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16909 states to 16909 states and 53533 transitions. [2019-12-27 03:58:13,068 INFO L78 Accepts]: Start accepts. Automaton has 16909 states and 53533 transitions. Word has length 53 [2019-12-27 03:58:13,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:13,068 INFO L462 AbstractCegarLoop]: Abstraction has 16909 states and 53533 transitions. [2019-12-27 03:58:13,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:58:13,068 INFO L276 IsEmpty]: Start isEmpty. Operand 16909 states and 53533 transitions. [2019-12-27 03:58:13,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:13,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:13,088 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] [2019-12-27 03:58:13,088 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:13,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:13,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2081547793, now seen corresponding path program 5 times [2019-12-27 03:58:13,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:13,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204865824] [2019-12-27 03:58:13,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:13,215 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 03:58:13,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204865824] [2019-12-27 03:58:13,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:13,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:58:13,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622695021] [2019-12-27 03:58:13,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:58:13,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:13,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:58:13,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:58:13,218 INFO L87 Difference]: Start difference. First operand 16909 states and 53533 transitions. Second operand 6 states. [2019-12-27 03:58:14,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:14,115 INFO L93 Difference]: Finished difference Result 31543 states and 97867 transitions. [2019-12-27 03:58:14,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:58:14,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 03:58:14,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:14,164 INFO L225 Difference]: With dead ends: 31543 [2019-12-27 03:58:14,164 INFO L226 Difference]: Without dead ends: 31459 [2019-12-27 03:58:14,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:58:14,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31459 states. [2019-12-27 03:58:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31459 to 19853. [2019-12-27 03:58:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19853 states. [2019-12-27 03:58:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19853 states to 19853 states and 62091 transitions. [2019-12-27 03:58:14,557 INFO L78 Accepts]: Start accepts. Automaton has 19853 states and 62091 transitions. Word has length 53 [2019-12-27 03:58:14,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:14,558 INFO L462 AbstractCegarLoop]: Abstraction has 19853 states and 62091 transitions. [2019-12-27 03:58:14,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:58:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 19853 states and 62091 transitions. [2019-12-27 03:58:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:14,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:14,591 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] [2019-12-27 03:58:14,591 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:14,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:14,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1629843107, now seen corresponding path program 6 times [2019-12-27 03:58:14,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:14,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911415424] [2019-12-27 03:58:14,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:14,706 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 03:58:14,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911415424] [2019-12-27 03:58:14,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:14,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:58:14,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112592264] [2019-12-27 03:58:14,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:58:14,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:14,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:58:14,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:58:14,709 INFO L87 Difference]: Start difference. First operand 19853 states and 62091 transitions. Second operand 7 states. [2019-12-27 03:58:15,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:15,718 INFO L93 Difference]: Finished difference Result 31464 states and 95079 transitions. [2019-12-27 03:58:15,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 03:58:15,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 03:58:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:15,765 INFO L225 Difference]: With dead ends: 31464 [2019-12-27 03:58:15,765 INFO L226 Difference]: Without dead ends: 31342 [2019-12-27 03:58:15,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:58:15,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31342 states. [2019-12-27 03:58:16,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31342 to 25003. [2019-12-27 03:58:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25003 states. [2019-12-27 03:58:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25003 states to 25003 states and 77213 transitions. [2019-12-27 03:58:16,418 INFO L78 Accepts]: Start accepts. Automaton has 25003 states and 77213 transitions. Word has length 53 [2019-12-27 03:58:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:16,419 INFO L462 AbstractCegarLoop]: Abstraction has 25003 states and 77213 transitions. [2019-12-27 03:58:16,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:58:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 25003 states and 77213 transitions. [2019-12-27 03:58:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:16,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:16,462 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] [2019-12-27 03:58:16,462 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:16,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:16,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1109995221, now seen corresponding path program 7 times [2019-12-27 03:58:16,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:16,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363083062] [2019-12-27 03:58:16,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:16,582 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 03:58:16,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363083062] [2019-12-27 03:58:16,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:16,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:58:16,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625159385] [2019-12-27 03:58:16,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:58:16,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:16,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:58:16,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:58:16,584 INFO L87 Difference]: Start difference. First operand 25003 states and 77213 transitions. Second operand 9 states. [2019-12-27 03:58:18,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:18,300 INFO L93 Difference]: Finished difference Result 41056 states and 124508 transitions. [2019-12-27 03:58:18,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 03:58:18,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 03:58:18,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:18,369 INFO L225 Difference]: With dead ends: 41056 [2019-12-27 03:58:18,369 INFO L226 Difference]: Without dead ends: 41056 [2019-12-27 03:58:18,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:58:18,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41056 states. [2019-12-27 03:58:18,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41056 to 23556. [2019-12-27 03:58:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23556 states. [2019-12-27 03:58:18,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23556 states to 23556 states and 73044 transitions. [2019-12-27 03:58:18,875 INFO L78 Accepts]: Start accepts. Automaton has 23556 states and 73044 transitions. Word has length 53 [2019-12-27 03:58:18,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:18,875 INFO L462 AbstractCegarLoop]: Abstraction has 23556 states and 73044 transitions. [2019-12-27 03:58:18,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:58:18,876 INFO L276 IsEmpty]: Start isEmpty. Operand 23556 states and 73044 transitions. [2019-12-27 03:58:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:18,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:18,901 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] [2019-12-27 03:58:18,901 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:18,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:18,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2099294685, now seen corresponding path program 8 times [2019-12-27 03:58:18,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:18,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778162696] [2019-12-27 03:58:18,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:18,962 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 03:58:18,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778162696] [2019-12-27 03:58:18,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:18,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:58:18,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826924275] [2019-12-27 03:58:18,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:58:18,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:18,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:58:18,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:58:18,966 INFO L87 Difference]: Start difference. First operand 23556 states and 73044 transitions. Second operand 3 states. [2019-12-27 03:58:19,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:19,041 INFO L93 Difference]: Finished difference Result 17418 states and 53184 transitions. [2019-12-27 03:58:19,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:58:19,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 03:58:19,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:19,073 INFO L225 Difference]: With dead ends: 17418 [2019-12-27 03:58:19,074 INFO L226 Difference]: Without dead ends: 17418 [2019-12-27 03:58:19,074 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 03:58:19,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17418 states. [2019-12-27 03:58:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17418 to 16845. [2019-12-27 03:58:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16845 states. [2019-12-27 03:58:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16845 states to 16845 states and 51304 transitions. [2019-12-27 03:58:19,528 INFO L78 Accepts]: Start accepts. Automaton has 16845 states and 51304 transitions. Word has length 53 [2019-12-27 03:58:19,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:19,528 INFO L462 AbstractCegarLoop]: Abstraction has 16845 states and 51304 transitions. [2019-12-27 03:58:19,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:58:19,528 INFO L276 IsEmpty]: Start isEmpty. Operand 16845 states and 51304 transitions. [2019-12-27 03:58:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:58:19,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:19,546 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] [2019-12-27 03:58:19,546 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:19,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:19,547 INFO L82 PathProgramCache]: Analyzing trace with hash -2130494140, now seen corresponding path program 1 times [2019-12-27 03:58:19,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:19,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723792804] [2019-12-27 03:58:19,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:19,749 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 03:58:19,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723792804] [2019-12-27 03:58:19,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:19,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:58:19,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337170717] [2019-12-27 03:58:19,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:58:19,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:19,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:58:19,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:58:19,751 INFO L87 Difference]: Start difference. First operand 16845 states and 51304 transitions. Second operand 11 states. [2019-12-27 03:58:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:20,847 INFO L93 Difference]: Finished difference Result 34904 states and 106417 transitions. [2019-12-27 03:58:20,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 03:58:20,847 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 03:58:20,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:20,897 INFO L225 Difference]: With dead ends: 34904 [2019-12-27 03:58:20,897 INFO L226 Difference]: Without dead ends: 33854 [2019-12-27 03:58:20,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 03:58:21,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33854 states. [2019-12-27 03:58:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33854 to 21618. [2019-12-27 03:58:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21618 states. [2019-12-27 03:58:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21618 states to 21618 states and 65921 transitions. [2019-12-27 03:58:21,325 INFO L78 Accepts]: Start accepts. Automaton has 21618 states and 65921 transitions. Word has length 54 [2019-12-27 03:58:21,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:21,325 INFO L462 AbstractCegarLoop]: Abstraction has 21618 states and 65921 transitions. [2019-12-27 03:58:21,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:58:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 21618 states and 65921 transitions. [2019-12-27 03:58:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:58:21,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:21,347 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] [2019-12-27 03:58:21,347 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:21,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:21,347 INFO L82 PathProgramCache]: Analyzing trace with hash 211798304, now seen corresponding path program 2 times [2019-12-27 03:58:21,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:21,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898469343] [2019-12-27 03:58:21,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:21,555 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 03:58:21,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898469343] [2019-12-27 03:58:21,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:21,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:58:21,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49878600] [2019-12-27 03:58:21,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:58:21,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:21,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:58:21,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:58:21,558 INFO L87 Difference]: Start difference. First operand 21618 states and 65921 transitions. Second operand 11 states. [2019-12-27 03:58:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:22,522 INFO L93 Difference]: Finished difference Result 34597 states and 104764 transitions. [2019-12-27 03:58:22,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:58:22,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 03:58:22,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:22,562 INFO L225 Difference]: With dead ends: 34597 [2019-12-27 03:58:22,562 INFO L226 Difference]: Without dead ends: 25901 [2019-12-27 03:58:22,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:58:22,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25901 states. [2019-12-27 03:58:22,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25901 to 16668. [2019-12-27 03:58:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16668 states. [2019-12-27 03:58:22,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16668 states to 16668 states and 50247 transitions. [2019-12-27 03:58:22,878 INFO L78 Accepts]: Start accepts. Automaton has 16668 states and 50247 transitions. Word has length 54 [2019-12-27 03:58:22,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:22,878 INFO L462 AbstractCegarLoop]: Abstraction has 16668 states and 50247 transitions. [2019-12-27 03:58:22,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:58:22,878 INFO L276 IsEmpty]: Start isEmpty. Operand 16668 states and 50247 transitions. [2019-12-27 03:58:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:58:23,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:23,132 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] [2019-12-27 03:58:23,132 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:23,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:23,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1398179606, now seen corresponding path program 3 times [2019-12-27 03:58:23,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:23,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318570722] [2019-12-27 03:58:23,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:23,239 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 03:58:23,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318570722] [2019-12-27 03:58:23,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:23,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:58:23,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764182469] [2019-12-27 03:58:23,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:58:23,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:23,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:58:23,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:58:23,241 INFO L87 Difference]: Start difference. First operand 16668 states and 50247 transitions. Second operand 8 states. [2019-12-27 03:58:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:24,908 INFO L93 Difference]: Finished difference Result 24076 states and 70785 transitions. [2019-12-27 03:58:24,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 03:58:24,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 03:58:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:24,941 INFO L225 Difference]: With dead ends: 24076 [2019-12-27 03:58:24,941 INFO L226 Difference]: Without dead ends: 23940 [2019-12-27 03:58:24,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-27 03:58:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23940 states. [2019-12-27 03:58:25,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23940 to 16411. [2019-12-27 03:58:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16411 states. [2019-12-27 03:58:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16411 states to 16411 states and 49483 transitions. [2019-12-27 03:58:25,264 INFO L78 Accepts]: Start accepts. Automaton has 16411 states and 49483 transitions. Word has length 54 [2019-12-27 03:58:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:25,264 INFO L462 AbstractCegarLoop]: Abstraction has 16411 states and 49483 transitions. [2019-12-27 03:58:25,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:58:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 16411 states and 49483 transitions. [2019-12-27 03:58:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:58:25,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:25,281 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] [2019-12-27 03:58:25,281 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:25,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2123645396, now seen corresponding path program 4 times [2019-12-27 03:58:25,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:25,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815519810] [2019-12-27 03:58:25,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:25,395 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 03:58:25,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815519810] [2019-12-27 03:58:25,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:25,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:58:25,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382744950] [2019-12-27 03:58:25,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:58:25,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:25,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:58:25,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:58:25,397 INFO L87 Difference]: Start difference. First operand 16411 states and 49483 transitions. Second operand 9 states. [2019-12-27 03:58:26,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:26,511 INFO L93 Difference]: Finished difference Result 23561 states and 70449 transitions. [2019-12-27 03:58:26,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 03:58:26,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 03:58:26,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:26,554 INFO L225 Difference]: With dead ends: 23561 [2019-12-27 03:58:26,554 INFO L226 Difference]: Without dead ends: 22790 [2019-12-27 03:58:26,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 03:58:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22790 states. [2019-12-27 03:58:26,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22790 to 16167. [2019-12-27 03:58:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16167 states. [2019-12-27 03:58:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16167 states to 16167 states and 48790 transitions. [2019-12-27 03:58:26,880 INFO L78 Accepts]: Start accepts. Automaton has 16167 states and 48790 transitions. Word has length 54 [2019-12-27 03:58:26,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:26,880 INFO L462 AbstractCegarLoop]: Abstraction has 16167 states and 48790 transitions. [2019-12-27 03:58:26,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:58:26,881 INFO L276 IsEmpty]: Start isEmpty. Operand 16167 states and 48790 transitions. [2019-12-27 03:58:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:58:26,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:26,897 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] [2019-12-27 03:58:26,897 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:26,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:26,898 INFO L82 PathProgramCache]: Analyzing trace with hash -139497916, now seen corresponding path program 5 times [2019-12-27 03:58:26,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:26,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760756808] [2019-12-27 03:58:26,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:26,952 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 03:58:26,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760756808] [2019-12-27 03:58:26,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:26,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:58:26,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764851284] [2019-12-27 03:58:26,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:58:26,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:26,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:58:26,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:58:26,954 INFO L87 Difference]: Start difference. First operand 16167 states and 48790 transitions. Second operand 3 states. [2019-12-27 03:58:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:27,021 INFO L93 Difference]: Finished difference Result 16165 states and 48785 transitions. [2019-12-27 03:58:27,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:58:27,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 03:58:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:27,051 INFO L225 Difference]: With dead ends: 16165 [2019-12-27 03:58:27,051 INFO L226 Difference]: Without dead ends: 16165 [2019-12-27 03:58:27,052 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 03:58:27,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16165 states. [2019-12-27 03:58:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16165 to 14735. [2019-12-27 03:58:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14735 states. [2019-12-27 03:58:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14735 states to 14735 states and 44821 transitions. [2019-12-27 03:58:27,306 INFO L78 Accepts]: Start accepts. Automaton has 14735 states and 44821 transitions. Word has length 54 [2019-12-27 03:58:27,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:27,306 INFO L462 AbstractCegarLoop]: Abstraction has 14735 states and 44821 transitions. [2019-12-27 03:58:27,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:58:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 14735 states and 44821 transitions. [2019-12-27 03:58:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:58:27,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:27,321 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] [2019-12-27 03:58:27,322 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:27,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:27,322 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 1 times [2019-12-27 03:58:27,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:27,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220984839] [2019-12-27 03:58:27,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:27,689 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 03:58:27,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220984839] [2019-12-27 03:58:27,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:27,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:58:27,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857970598] [2019-12-27 03:58:27,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:58:27,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:27,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:58:27,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:58:27,691 INFO L87 Difference]: Start difference. First operand 14735 states and 44821 transitions. Second operand 12 states. [2019-12-27 03:58:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:28,582 INFO L93 Difference]: Finished difference Result 23016 states and 69828 transitions. [2019-12-27 03:58:28,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:58:28,583 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-27 03:58:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:28,631 INFO L225 Difference]: With dead ends: 23016 [2019-12-27 03:58:28,631 INFO L226 Difference]: Without dead ends: 22740 [2019-12-27 03:58:28,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 03:58:28,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22740 states. [2019-12-27 03:58:28,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22740 to 14589. [2019-12-27 03:58:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14589 states. [2019-12-27 03:58:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14589 states to 14589 states and 44479 transitions. [2019-12-27 03:58:28,962 INFO L78 Accepts]: Start accepts. Automaton has 14589 states and 44479 transitions. Word has length 55 [2019-12-27 03:58:28,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:28,962 INFO L462 AbstractCegarLoop]: Abstraction has 14589 states and 44479 transitions. [2019-12-27 03:58:28,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:58:28,963 INFO L276 IsEmpty]: Start isEmpty. Operand 14589 states and 44479 transitions. [2019-12-27 03:58:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:58:28,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:28,978 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] [2019-12-27 03:58:28,978 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:28,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:28,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 2 times [2019-12-27 03:58:28,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:28,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166630392] [2019-12-27 03:58:28,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:58:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:58:29,077 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:58:29,077 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:58:29,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2345~0.base_24|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2345~0.base_24| 4)) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t2345~0.base_24|) 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= (store .cse0 |v_ULTIMATE.start_main_~#t2345~0.base_24| 1) |v_#valid_59|) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2345~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2345~0.base_24|) |v_ULTIMATE.start_main_~#t2345~0.offset_18| 0)) |v_#memory_int_23|) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= 0 |v_ULTIMATE.start_main_~#t2345~0.offset_18|) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ULTIMATE.start_main_~#t2345~0.offset=|v_ULTIMATE.start_main_~#t2345~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2347~0.base=|v_ULTIMATE.start_main_~#t2347~0.base_26|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_~#t2346~0.offset=|v_ULTIMATE.start_main_~#t2346~0.offset_19|, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_~#t2346~0.base=|v_ULTIMATE.start_main_~#t2346~0.base_26|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ULTIMATE.start_main_~#t2345~0.base=|v_ULTIMATE.start_main_~#t2345~0.base_24|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t2347~0.offset=|v_ULTIMATE.start_main_~#t2347~0.offset_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2345~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2347~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2346~0.offset, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2346~0.base, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t2345~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2347~0.offset, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:58:29,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2346~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2346~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2346~0.offset_11|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2346~0.base_13| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2346~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2346~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2346~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2346~0.base_13|) |v_ULTIMATE.start_main_~#t2346~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2346~0.offset=|v_ULTIMATE.start_main_~#t2346~0.offset_11|, ULTIMATE.start_main_~#t2346~0.base=|v_ULTIMATE.start_main_~#t2346~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2346~0.offset, ULTIMATE.start_main_~#t2346~0.base] because there is no mapped edge [2019-12-27 03:58:29,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2347~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2347~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2347~0.base_13| 0)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2347~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2347~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2347~0.base_13|) |v_ULTIMATE.start_main_~#t2347~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2347~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2347~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2347~0.base=|v_ULTIMATE.start_main_~#t2347~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t2347~0.offset=|v_ULTIMATE.start_main_~#t2347~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2347~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2347~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 03:58:29,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= |P1Thread1of1ForFork0_#in~arg.offset_In-243735548| P1Thread1of1ForFork0_~arg.offset_Out-243735548) (= ~x$w_buff1~0_Out-243735548 ~x$w_buff0~0_In-243735548) (= ~x$w_buff0_used~0_In-243735548 ~x$w_buff1_used~0_Out-243735548) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-243735548| 1) (= (mod ~x$w_buff1_used~0_Out-243735548 256) 0) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-243735548| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-243735548) (= P1Thread1of1ForFork0_~arg.base_Out-243735548 |P1Thread1of1ForFork0_#in~arg.base_In-243735548|) (= ~x$w_buff0~0_Out-243735548 1) (= 1 ~x$w_buff0_used~0_Out-243735548)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-243735548, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-243735548|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-243735548|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-243735548} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-243735548, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-243735548, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-243735548, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-243735548, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-243735548|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-243735548|, ~x$w_buff1~0=~x$w_buff1~0_Out-243735548, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-243735548|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-243735548, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-243735548} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 03:58:29,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-1387404031 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1387404031 256) 0))) (or (and (= ~x$w_buff1~0_In-1387404031 |P2Thread1of1ForFork1_#t~ite32_Out-1387404031|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-1387404031| ~x~0_In-1387404031)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1387404031, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1387404031, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1387404031, ~x~0=~x~0_In-1387404031} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1387404031|, ~x$w_buff1~0=~x$w_buff1~0_In-1387404031, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1387404031, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1387404031, ~x~0=~x~0_In-1387404031} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 03:58:29,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_29|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 03:58:29,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1446992825 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1446992825 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1446992825 |P2Thread1of1ForFork1_#t~ite34_Out-1446992825|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-1446992825| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1446992825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1446992825} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1446992825|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1446992825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1446992825} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 03:58:29,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1978088056 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1978088056 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1978088056|)) (and (= ~x$w_buff0_used~0_In1978088056 |P1Thread1of1ForFork0_#t~ite28_Out1978088056|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1978088056, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1978088056} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1978088056, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1978088056|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1978088056} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 03:58:29,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1175679417 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1175679417 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1175679417 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1175679417 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out1175679417| ~x$w_buff1_used~0_In1175679417)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1175679417|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1175679417, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1175679417, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1175679417, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1175679417} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1175679417, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1175679417, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1175679417, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1175679417|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1175679417} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 03:58:29,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1931366144 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1931366144 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out1931366144) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In1931366144 ~x$r_buff0_thd2~0_Out1931366144)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1931366144, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1931366144} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1931366144|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1931366144, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1931366144} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 03:58:29,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In1543044252 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1543044252 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1543044252 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1543044252 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1543044252|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite31_Out1543044252| ~x$r_buff1_thd2~0_In1543044252) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1543044252, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1543044252, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1543044252, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1543044252} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1543044252|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1543044252, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1543044252, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1543044252, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1543044252} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 03:58:29,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 03:58:29,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1441369522 256) 0))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1441369522 |P0Thread1of1ForFork2_#t~ite12_Out-1441369522|) (= |P0Thread1of1ForFork2_#t~ite11_In-1441369522| |P0Thread1of1ForFork2_#t~ite11_Out-1441369522|)) (and (= |P0Thread1of1ForFork2_#t~ite12_Out-1441369522| |P0Thread1of1ForFork2_#t~ite11_Out-1441369522|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1441369522 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1441369522 256)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1441369522 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1441369522 256))))) .cse0 (= ~x$w_buff1~0_In-1441369522 |P0Thread1of1ForFork2_#t~ite11_Out-1441369522|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1441369522, ~x$w_buff1~0=~x$w_buff1~0_In-1441369522, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1441369522, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1441369522, ~weak$$choice2~0=~weak$$choice2~0_In-1441369522, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1441369522|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1441369522} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1441369522, ~x$w_buff1~0=~x$w_buff1~0_In-1441369522, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1441369522, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1441369522, ~weak$$choice2~0=~weak$$choice2~0_In-1441369522, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1441369522|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1441369522|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1441369522} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 03:58:29,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In793724580 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In793724580 256)))) (or (= (mod ~x$w_buff0_used~0_In793724580 256) 0) (and (= (mod ~x$w_buff1_used~0_In793724580 256) 0) .cse0) (and (= 0 (mod ~x$r_buff1_thd1~0_In793724580 256)) .cse0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite15_Out793724580| |P0Thread1of1ForFork2_#t~ite14_Out793724580|) (= |P0Thread1of1ForFork2_#t~ite14_Out793724580| ~x$w_buff0_used~0_In793724580)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite15_Out793724580| ~x$w_buff0_used~0_In793724580) (= |P0Thread1of1ForFork2_#t~ite14_In793724580| |P0Thread1of1ForFork2_#t~ite14_Out793724580|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In793724580, ~x$w_buff1_used~0=~x$w_buff1_used~0_In793724580, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In793724580, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In793724580|, ~weak$$choice2~0=~weak$$choice2~0_In793724580, ~x$w_buff0_used~0=~x$w_buff0_used~0_In793724580} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In793724580, ~x$w_buff1_used~0=~x$w_buff1_used~0_In793724580, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out793724580|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In793724580, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out793724580|, ~weak$$choice2~0=~weak$$choice2~0_In793724580, ~x$w_buff0_used~0=~x$w_buff0_used~0_In793724580} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 03:58:29,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2079452448 256) 0))) (or (and (= ~x$w_buff1_used~0_In-2079452448 |P0Thread1of1ForFork2_#t~ite17_Out-2079452448|) .cse0 (= |P0Thread1of1ForFork2_#t~ite18_Out-2079452448| |P0Thread1of1ForFork2_#t~ite17_Out-2079452448|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-2079452448 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In-2079452448 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-2079452448 256))) (= 0 (mod ~x$w_buff0_used~0_In-2079452448 256))))) (and (= ~x$w_buff1_used~0_In-2079452448 |P0Thread1of1ForFork2_#t~ite18_Out-2079452448|) (= |P0Thread1of1ForFork2_#t~ite17_In-2079452448| |P0Thread1of1ForFork2_#t~ite17_Out-2079452448|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2079452448, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-2079452448|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2079452448, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2079452448, ~weak$$choice2~0=~weak$$choice2~0_In-2079452448, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2079452448} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2079452448, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-2079452448|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-2079452448|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2079452448, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2079452448, ~weak$$choice2~0=~weak$$choice2~0_In-2079452448, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2079452448} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 03:58:29,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite23_39| |v_P0Thread1of1ForFork2_#t~ite23_40|) (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_35|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite22_36| |v_P0Thread1of1ForFork2_#t~ite22_35|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_40|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_36|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_35|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_39|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_35|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 03:58:29,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 03:58:29,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd3~0_In-398039473 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-398039473 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-398039473 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-398039473 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite35_Out-398039473| ~x$w_buff1_used~0_In-398039473)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork1_#t~ite35_Out-398039473| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-398039473, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-398039473, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-398039473, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-398039473} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-398039473|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-398039473, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-398039473, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-398039473, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-398039473} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 03:58:29,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In271353594 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In271353594 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out271353594| 0) (not .cse1)) (and (= ~x$r_buff0_thd3~0_In271353594 |P2Thread1of1ForFork1_#t~ite36_Out271353594|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In271353594, ~x$w_buff0_used~0=~x$w_buff0_used~0_In271353594} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out271353594|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In271353594, ~x$w_buff0_used~0=~x$w_buff0_used~0_In271353594} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 03:58:29,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1990048517 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1990048517 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1990048517 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1990048517 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out1990048517| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out1990048517| ~x$r_buff1_thd3~0_In1990048517) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1990048517, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1990048517, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1990048517, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1990048517} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1990048517|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1990048517, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1990048517, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1990048517, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1990048517} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:58:29,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_40|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 03:58:29,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= 3 v_~__unbuffered_cnt~0_39) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:58:29,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1262125699 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1262125699 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1262125699| ~x~0_In1262125699) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In1262125699 |ULTIMATE.start_main_#t~ite41_Out1262125699|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1262125699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1262125699, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1262125699, ~x~0=~x~0_In1262125699} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1262125699|, ~x$w_buff1~0=~x$w_buff1~0_In1262125699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1262125699, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1262125699, ~x~0=~x~0_In1262125699} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 03:58:29,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 03:58:29,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In101264785 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In101264785 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out101264785| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out101264785| ~x$w_buff0_used~0_In101264785)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In101264785, ~x$w_buff0_used~0=~x$w_buff0_used~0_In101264785} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In101264785, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out101264785|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In101264785} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 03:58:29,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In786483104 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In786483104 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In786483104 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In786483104 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out786483104|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out786483104| ~x$w_buff1_used~0_In786483104) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In786483104, ~x$w_buff1_used~0=~x$w_buff1_used~0_In786483104, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In786483104, ~x$w_buff0_used~0=~x$w_buff0_used~0_In786483104} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In786483104, ~x$w_buff1_used~0=~x$w_buff1_used~0_In786483104, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In786483104, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out786483104|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In786483104} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 03:58:29,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In701063939 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In701063939 256)))) (or (and (= ~x$r_buff0_thd0~0_In701063939 |ULTIMATE.start_main_#t~ite45_Out701063939|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out701063939| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In701063939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In701063939} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In701063939, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out701063939|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In701063939} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 03:58:29,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In-1877264045 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1877264045 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1877264045 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1877264045 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1877264045| ~x$r_buff1_thd0~0_In-1877264045) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-1877264045|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1877264045, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1877264045, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1877264045, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1877264045} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1877264045, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1877264045|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1877264045, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1877264045, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1877264045} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 03:58:29,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:58:29,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:58:29 BasicIcfg [2019-12-27 03:58:29,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:58:29,175 INFO L168 Benchmark]: Toolchain (without parser) took 75340.50 ms. Allocated memory was 142.6 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 98.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 833.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:58:29,175 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 142.6 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 03:58:29,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.50 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 98.5 MB in the beginning and 151.5 MB in the end (delta: -53.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:58:29,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.19 ms. Allocated memory is still 199.8 MB. Free memory was 151.5 MB in the beginning and 148.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:58:29,177 INFO L168 Benchmark]: Boogie Preprocessor took 39.25 ms. Allocated memory is still 199.8 MB. Free memory was 148.6 MB in the beginning and 146.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:58:29,177 INFO L168 Benchmark]: RCFGBuilder took 849.91 ms. Allocated memory is still 199.8 MB. Free memory was 146.5 MB in the beginning and 99.4 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:58:29,178 INFO L168 Benchmark]: TraceAbstraction took 73554.54 ms. Allocated memory was 199.8 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 99.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 777.3 MB. Max. memory is 7.1 GB. [2019-12-27 03:58:29,181 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.50 ms. Allocated memory is still 142.6 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 826.50 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 98.5 MB in the beginning and 151.5 MB in the end (delta: -53.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.19 ms. Allocated memory is still 199.8 MB. Free memory was 151.5 MB in the beginning and 148.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.25 ms. Allocated memory is still 199.8 MB. Free memory was 148.6 MB in the beginning and 146.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 849.91 ms. Allocated memory is still 199.8 MB. Free memory was 146.5 MB in the beginning and 99.4 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73554.54 ms. Allocated memory was 199.8 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 99.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 777.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 73.2s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 20.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4649 SDtfs, 5642 SDslu, 16178 SDs, 0 SdLazy, 8215 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 57 SyntacticMatches, 15 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 30.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 144226 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 988 NumberOfCodeBlocks, 988 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 911 ConstructedInterpolants, 0 QuantifiedInterpolants, 166101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...