/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-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi010_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 13:11:01,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 13:11:01,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 13:11:01,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 13:11:01,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 13:11:01,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 13:11:01,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 13:11:01,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 13:11:01,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 13:11:01,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 13:11:01,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 13:11:01,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 13:11:01,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 13:11:01,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 13:11:01,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 13:11:01,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 13:11:01,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 13:11:01,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 13:11:01,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 13:11:01,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 13:11:01,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 13:11:01,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 13:11:01,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 13:11:01,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 13:11:01,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 13:11:01,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 13:11:01,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 13:11:01,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 13:11:01,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 13:11:01,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 13:11:01,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 13:11:01,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 13:11:01,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 13:11:01,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 13:11:01,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 13:11:01,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 13:11:01,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 13:11:01,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 13:11:01,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 13:11:01,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 13:11:01,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 13:11:01,623 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-NoLbe.epf [2019-12-27 13:11:01,643 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 13:11:01,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 13:11:01,648 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 13:11:01,648 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 13:11:01,649 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 13:11:01,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 13:11:01,649 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 13:11:01,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 13:11:01,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 13:11:01,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 13:11:01,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 13:11:01,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 13:11:01,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 13:11:01,652 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 13:11:01,652 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 13:11:01,652 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 13:11:01,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 13:11:01,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 13:11:01,653 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 13:11:01,653 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 13:11:01,653 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 13:11:01,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 13:11:01,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 13:11:01,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 13:11:01,654 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 13:11:01,654 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 13:11:01,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 13:11:01,654 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 13:11:01,654 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 13:11:01,655 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 13:11:01,964 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 13:11:01,978 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 13:11:01,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 13:11:01,983 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 13:11:01,983 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 13:11:01,984 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi010_rmo.opt.i [2019-12-27 13:11:02,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c91ca215/e01b0dd5045c4cb59da560fd99ef7e96/FLAG37923cb6f [2019-12-27 13:11:02,612 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 13:11:02,612 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi010_rmo.opt.i [2019-12-27 13:11:02,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c91ca215/e01b0dd5045c4cb59da560fd99ef7e96/FLAG37923cb6f [2019-12-27 13:11:02,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c91ca215/e01b0dd5045c4cb59da560fd99ef7e96 [2019-12-27 13:11:02,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 13:11:02,868 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 13:11:02,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 13:11:02,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 13:11:02,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 13:11:02,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:11:02" (1/1) ... [2019-12-27 13:11:02,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:11:02, skipping insertion in model container [2019-12-27 13:11:02,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:11:02" (1/1) ... [2019-12-27 13:11:02,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 13:11:02,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 13:11:03,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 13:11:03,496 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 13:11:03,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 13:11:03,660 INFO L208 MainTranslator]: Completed translation [2019-12-27 13:11:03,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:11:03 WrapperNode [2019-12-27 13:11:03,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 13:11:03,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 13:11:03,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 13:11:03,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 13:11:03,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:11:03" (1/1) ... [2019-12-27 13:11:03,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:11:03" (1/1) ... [2019-12-27 13:11:03,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 13:11:03,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 13:11:03,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 13:11:03,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 13:11:03,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:11:03" (1/1) ... [2019-12-27 13:11:03,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:11:03" (1/1) ... [2019-12-27 13:11:03,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:11:03" (1/1) ... [2019-12-27 13:11:03,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:11:03" (1/1) ... [2019-12-27 13:11:03,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:11:03" (1/1) ... [2019-12-27 13:11:03,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:11:03" (1/1) ... [2019-12-27 13:11:03,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:11:03" (1/1) ... [2019-12-27 13:11:03,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 13:11:03,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 13:11:03,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 13:11:03,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 13:11:03,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:11:03" (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 13:11:03,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 13:11:03,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 13:11:03,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 13:11:03,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 13:11:03,861 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 13:11:03,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 13:11:03,861 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 13:11:03,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 13:11:03,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 13:11:03,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 13:11:03,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 13:11:03,865 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 13:11:04,826 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 13:11:04,826 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 13:11:04,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:11:04 BoogieIcfgContainer [2019-12-27 13:11:04,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 13:11:04,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 13:11:04,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 13:11:04,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 13:11:04,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:11:02" (1/3) ... [2019-12-27 13:11:04,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f185bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:11:04, skipping insertion in model container [2019-12-27 13:11:04,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:11:03" (2/3) ... [2019-12-27 13:11:04,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f185bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:11:04, skipping insertion in model container [2019-12-27 13:11:04,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:11:04" (3/3) ... [2019-12-27 13:11:04,837 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi010_rmo.opt.i [2019-12-27 13:11:04,846 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 13:11:04,846 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 13:11:04,854 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 13:11:04,855 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 13:11:04,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,916 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,916 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,952 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,952 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,953 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,953 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,954 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,995 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:04,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,016 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,017 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,018 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:11:05,032 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 13:11:05,049 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 13:11:05,049 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 13:11:05,049 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 13:11:05,049 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 13:11:05,049 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 13:11:05,050 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 13:11:05,050 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 13:11:05,050 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 13:11:05,061 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 178 places, 227 transitions [2019-12-27 13:11:13,587 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80072 states. [2019-12-27 13:11:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 80072 states. [2019-12-27 13:11:13,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 13:11:13,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:11:13,600 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 13:11:13,601 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:11:13,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:11:13,607 INFO L82 PathProgramCache]: Analyzing trace with hash 71050137, now seen corresponding path program 1 times [2019-12-27 13:11:13,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:11:13,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089345838] [2019-12-27 13:11:13,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:11:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:11:13,941 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 13:11:13,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089345838] [2019-12-27 13:11:14,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:11:14,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:11:14,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375721472] [2019-12-27 13:11:14,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:11:14,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:11:14,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:11:14,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:11:14,722 INFO L87 Difference]: Start difference. First operand 80072 states. Second operand 4 states. [2019-12-27 13:11:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:11:16,086 INFO L93 Difference]: Finished difference Result 80712 states and 324637 transitions. [2019-12-27 13:11:16,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 13:11:16,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 13:11:16,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:11:18,118 INFO L225 Difference]: With dead ends: 80712 [2019-12-27 13:11:18,118 INFO L226 Difference]: Without dead ends: 59000 [2019-12-27 13:11:18,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:11:19,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59000 states. [2019-12-27 13:11:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59000 to 59000. [2019-12-27 13:11:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59000 states. [2019-12-27 13:11:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59000 states to 59000 states and 240125 transitions. [2019-12-27 13:11:21,584 INFO L78 Accepts]: Start accepts. Automaton has 59000 states and 240125 transitions. Word has length 39 [2019-12-27 13:11:21,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:11:21,585 INFO L462 AbstractCegarLoop]: Abstraction has 59000 states and 240125 transitions. [2019-12-27 13:11:21,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:11:21,585 INFO L276 IsEmpty]: Start isEmpty. Operand 59000 states and 240125 transitions. [2019-12-27 13:11:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 13:11:21,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:11:21,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:11:21,595 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:11:21,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:11:21,595 INFO L82 PathProgramCache]: Analyzing trace with hash -256602995, now seen corresponding path program 1 times [2019-12-27 13:11:21,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:11:21,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061495821] [2019-12-27 13:11:21,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:11:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:11:21,763 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 13:11:21,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061495821] [2019-12-27 13:11:21,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:11:21,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:11:21,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644560512] [2019-12-27 13:11:21,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:11:21,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:11:21,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:11:21,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:11:21,767 INFO L87 Difference]: Start difference. First operand 59000 states and 240125 transitions. Second operand 5 states. [2019-12-27 13:11:25,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:11:25,646 INFO L93 Difference]: Finished difference Result 95594 states and 363716 transitions. [2019-12-27 13:11:25,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:11:25,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 13:11:25,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:11:26,170 INFO L225 Difference]: With dead ends: 95594 [2019-12-27 13:11:26,171 INFO L226 Difference]: Without dead ends: 95042 [2019-12-27 13:11:26,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:11:27,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95042 states. [2019-12-27 13:11:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95042 to 93164. [2019-12-27 13:11:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93164 states. [2019-12-27 13:11:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93164 states to 93164 states and 356302 transitions. [2019-12-27 13:11:29,348 INFO L78 Accepts]: Start accepts. Automaton has 93164 states and 356302 transitions. Word has length 47 [2019-12-27 13:11:29,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:11:29,350 INFO L462 AbstractCegarLoop]: Abstraction has 93164 states and 356302 transitions. [2019-12-27 13:11:29,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:11:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand 93164 states and 356302 transitions. [2019-12-27 13:11:29,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 13:11:29,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:11:29,355 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] [2019-12-27 13:11:29,355 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:11:29,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:11:29,356 INFO L82 PathProgramCache]: Analyzing trace with hash -85893698, now seen corresponding path program 1 times [2019-12-27 13:11:29,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:11:29,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333755527] [2019-12-27 13:11:29,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:11:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:11:29,439 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 13:11:29,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333755527] [2019-12-27 13:11:29,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:11:29,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:11:29,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068579495] [2019-12-27 13:11:29,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:11:29,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:11:29,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:11:29,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:11:29,442 INFO L87 Difference]: Start difference. First operand 93164 states and 356302 transitions. Second operand 5 states. [2019-12-27 13:11:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:11:33,305 INFO L93 Difference]: Finished difference Result 118508 states and 442883 transitions. [2019-12-27 13:11:33,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:11:33,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-27 13:11:33,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:11:33,675 INFO L225 Difference]: With dead ends: 118508 [2019-12-27 13:11:33,675 INFO L226 Difference]: Without dead ends: 118060 [2019-12-27 13:11:33,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:11:35,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118060 states. [2019-12-27 13:11:36,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118060 to 104153. [2019-12-27 13:11:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104153 states. [2019-12-27 13:11:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104153 states to 104153 states and 394236 transitions. [2019-12-27 13:11:37,932 INFO L78 Accepts]: Start accepts. Automaton has 104153 states and 394236 transitions. Word has length 48 [2019-12-27 13:11:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:11:37,932 INFO L462 AbstractCegarLoop]: Abstraction has 104153 states and 394236 transitions. [2019-12-27 13:11:37,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:11:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 104153 states and 394236 transitions. [2019-12-27 13:11:37,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 13:11:37,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:11:37,946 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] [2019-12-27 13:11:37,946 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:11:37,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:11:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1345260124, now seen corresponding path program 1 times [2019-12-27 13:11:37,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:11:37,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585607806] [2019-12-27 13:11:37,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:11:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:11:37,999 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 13:11:38,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585607806] [2019-12-27 13:11:38,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:11:38,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:11:38,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351007328] [2019-12-27 13:11:38,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:11:38,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:11:38,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:11:38,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:11:38,002 INFO L87 Difference]: Start difference. First operand 104153 states and 394236 transitions. Second operand 3 states. [2019-12-27 13:11:38,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:11:38,763 INFO L93 Difference]: Finished difference Result 170911 states and 627058 transitions. [2019-12-27 13:11:38,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:11:38,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 13:11:38,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:11:43,693 INFO L225 Difference]: With dead ends: 170911 [2019-12-27 13:11:43,693 INFO L226 Difference]: Without dead ends: 170911 [2019-12-27 13:11:43,693 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 13:11:45,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170911 states. [2019-12-27 13:11:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170911 to 157189. [2019-12-27 13:11:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157189 states. [2019-12-27 13:11:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157189 states to 157189 states and 581290 transitions. [2019-12-27 13:11:48,799 INFO L78 Accepts]: Start accepts. Automaton has 157189 states and 581290 transitions. Word has length 50 [2019-12-27 13:11:48,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:11:48,799 INFO L462 AbstractCegarLoop]: Abstraction has 157189 states and 581290 transitions. [2019-12-27 13:11:48,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:11:48,799 INFO L276 IsEmpty]: Start isEmpty. Operand 157189 states and 581290 transitions. [2019-12-27 13:11:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 13:11:48,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:11:48,824 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 13:11:48,825 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:11:48,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:11:48,825 INFO L82 PathProgramCache]: Analyzing trace with hash 246072175, now seen corresponding path program 1 times [2019-12-27 13:11:48,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:11:48,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047013894] [2019-12-27 13:11:48,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:11:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:11:48,951 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 13:11:48,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047013894] [2019-12-27 13:11:48,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:11:48,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:11:48,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510347269] [2019-12-27 13:11:48,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:11:48,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:11:48,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:11:48,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:11:48,953 INFO L87 Difference]: Start difference. First operand 157189 states and 581290 transitions. Second operand 6 states. [2019-12-27 13:11:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:11:55,073 INFO L93 Difference]: Finished difference Result 212573 states and 766172 transitions. [2019-12-27 13:11:55,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 13:11:55,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 13:11:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:11:55,578 INFO L225 Difference]: With dead ends: 212573 [2019-12-27 13:11:55,579 INFO L226 Difference]: Without dead ends: 212053 [2019-12-27 13:11:55,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 13:11:57,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212053 states. [2019-12-27 13:12:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212053 to 157971. [2019-12-27 13:12:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157971 states. [2019-12-27 13:12:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157971 states to 157971 states and 584227 transitions. [2019-12-27 13:12:01,489 INFO L78 Accepts]: Start accepts. Automaton has 157971 states and 584227 transitions. Word has length 54 [2019-12-27 13:12:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:01,489 INFO L462 AbstractCegarLoop]: Abstraction has 157971 states and 584227 transitions. [2019-12-27 13:12:01,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:12:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 157971 states and 584227 transitions. [2019-12-27 13:12:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 13:12:01,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:01,512 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 13:12:01,513 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:01,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:01,513 INFO L82 PathProgramCache]: Analyzing trace with hash 104351519, now seen corresponding path program 1 times [2019-12-27 13:12:01,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:01,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296743608] [2019-12-27 13:12:01,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:01,624 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 13:12:01,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296743608] [2019-12-27 13:12:01,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:01,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:12:01,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930887189] [2019-12-27 13:12:01,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:12:01,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:01,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:12:01,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:12:01,627 INFO L87 Difference]: Start difference. First operand 157971 states and 584227 transitions. Second operand 7 states. [2019-12-27 13:12:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:09,270 INFO L93 Difference]: Finished difference Result 264420 states and 941443 transitions. [2019-12-27 13:12:09,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 13:12:09,270 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 13:12:09,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:09,957 INFO L225 Difference]: With dead ends: 264420 [2019-12-27 13:12:09,957 INFO L226 Difference]: Without dead ends: 264420 [2019-12-27 13:12:09,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 13:12:12,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264420 states. [2019-12-27 13:12:15,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264420 to 196980. [2019-12-27 13:12:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196980 states. [2019-12-27 13:12:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196980 states to 196980 states and 717858 transitions. [2019-12-27 13:12:17,650 INFO L78 Accepts]: Start accepts. Automaton has 196980 states and 717858 transitions. Word has length 54 [2019-12-27 13:12:17,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:17,650 INFO L462 AbstractCegarLoop]: Abstraction has 196980 states and 717858 transitions. [2019-12-27 13:12:17,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:12:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 196980 states and 717858 transitions. [2019-12-27 13:12:17,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 13:12:17,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:17,680 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 13:12:17,680 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:17,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:17,680 INFO L82 PathProgramCache]: Analyzing trace with hash 991855200, now seen corresponding path program 1 times [2019-12-27 13:12:17,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:17,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47936720] [2019-12-27 13:12:17,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:12:17,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47936720] [2019-12-27 13:12:17,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:17,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:12:17,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210502753] [2019-12-27 13:12:17,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:12:17,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:17,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:12:17,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:12:17,774 INFO L87 Difference]: Start difference. First operand 196980 states and 717858 transitions. Second operand 3 states. [2019-12-27 13:12:18,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:18,644 INFO L93 Difference]: Finished difference Result 159700 states and 576108 transitions. [2019-12-27 13:12:18,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:12:18,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 13:12:18,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:19,040 INFO L225 Difference]: With dead ends: 159700 [2019-12-27 13:12:19,041 INFO L226 Difference]: Without dead ends: 159700 [2019-12-27 13:12:19,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:12:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159700 states. [2019-12-27 13:12:28,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159700 to 154918. [2019-12-27 13:12:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154918 states. [2019-12-27 13:12:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154918 states to 154918 states and 560287 transitions. [2019-12-27 13:12:30,158 INFO L78 Accepts]: Start accepts. Automaton has 154918 states and 560287 transitions. Word has length 54 [2019-12-27 13:12:30,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:30,159 INFO L462 AbstractCegarLoop]: Abstraction has 154918 states and 560287 transitions. [2019-12-27 13:12:30,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:12:30,159 INFO L276 IsEmpty]: Start isEmpty. Operand 154918 states and 560287 transitions. [2019-12-27 13:12:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 13:12:30,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:30,179 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 13:12:30,179 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:30,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:30,180 INFO L82 PathProgramCache]: Analyzing trace with hash -82060277, now seen corresponding path program 1 times [2019-12-27 13:12:30,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:30,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235156795] [2019-12-27 13:12:30,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:30,245 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 13:12:30,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235156795] [2019-12-27 13:12:30,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:30,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:12:30,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451295086] [2019-12-27 13:12:30,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:12:30,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:30,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:12:30,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:12:30,247 INFO L87 Difference]: Start difference. First operand 154918 states and 560287 transitions. Second operand 4 states. [2019-12-27 13:12:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:30,388 INFO L93 Difference]: Finished difference Result 24457 states and 76333 transitions. [2019-12-27 13:12:30,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:12:30,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-27 13:12:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:30,427 INFO L225 Difference]: With dead ends: 24457 [2019-12-27 13:12:30,428 INFO L226 Difference]: Without dead ends: 18438 [2019-12-27 13:12:30,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 13:12:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18438 states. [2019-12-27 13:12:30,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18438 to 18191. [2019-12-27 13:12:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18191 states. [2019-12-27 13:12:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18191 states to 18191 states and 54574 transitions. [2019-12-27 13:12:30,734 INFO L78 Accepts]: Start accepts. Automaton has 18191 states and 54574 transitions. Word has length 55 [2019-12-27 13:12:30,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:30,734 INFO L462 AbstractCegarLoop]: Abstraction has 18191 states and 54574 transitions. [2019-12-27 13:12:30,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:12:30,734 INFO L276 IsEmpty]: Start isEmpty. Operand 18191 states and 54574 transitions. [2019-12-27 13:12:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 13:12:30,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:30,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:12:30,740 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:30,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:30,741 INFO L82 PathProgramCache]: Analyzing trace with hash -274013666, now seen corresponding path program 1 times [2019-12-27 13:12:30,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:30,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611095174] [2019-12-27 13:12:30,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:30,822 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 13:12:30,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611095174] [2019-12-27 13:12:30,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:30,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:12:30,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635298998] [2019-12-27 13:12:30,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:12:30,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:30,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:12:30,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:12:30,825 INFO L87 Difference]: Start difference. First operand 18191 states and 54574 transitions. Second operand 4 states. [2019-12-27 13:12:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:31,141 INFO L93 Difference]: Finished difference Result 23511 states and 70752 transitions. [2019-12-27 13:12:31,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:12:31,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 13:12:31,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:31,195 INFO L225 Difference]: With dead ends: 23511 [2019-12-27 13:12:31,195 INFO L226 Difference]: Without dead ends: 23511 [2019-12-27 13:12:31,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:12:31,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23511 states. [2019-12-27 13:12:31,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23511 to 21213. [2019-12-27 13:12:31,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21213 states. [2019-12-27 13:12:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21213 states to 21213 states and 63559 transitions. [2019-12-27 13:12:31,534 INFO L78 Accepts]: Start accepts. Automaton has 21213 states and 63559 transitions. Word has length 64 [2019-12-27 13:12:31,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:31,534 INFO L462 AbstractCegarLoop]: Abstraction has 21213 states and 63559 transitions. [2019-12-27 13:12:31,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:12:31,534 INFO L276 IsEmpty]: Start isEmpty. Operand 21213 states and 63559 transitions. [2019-12-27 13:12:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 13:12:31,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:31,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:12:31,541 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:31,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:31,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1468796669, now seen corresponding path program 1 times [2019-12-27 13:12:31,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:31,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839959850] [2019-12-27 13:12:31,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:31,630 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 13:12:31,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839959850] [2019-12-27 13:12:31,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:31,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:12:31,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940329967] [2019-12-27 13:12:31,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:12:31,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:31,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:12:31,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:12:31,633 INFO L87 Difference]: Start difference. First operand 21213 states and 63559 transitions. Second operand 6 states. [2019-12-27 13:12:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:33,720 INFO L93 Difference]: Finished difference Result 30325 states and 89099 transitions. [2019-12-27 13:12:33,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 13:12:33,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 13:12:33,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:33,764 INFO L225 Difference]: With dead ends: 30325 [2019-12-27 13:12:33,765 INFO L226 Difference]: Without dead ends: 30277 [2019-12-27 13:12:33,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 13:12:33,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30277 states. [2019-12-27 13:12:34,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30277 to 27630. [2019-12-27 13:12:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27630 states. [2019-12-27 13:12:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27630 states to 27630 states and 81446 transitions. [2019-12-27 13:12:34,144 INFO L78 Accepts]: Start accepts. Automaton has 27630 states and 81446 transitions. Word has length 64 [2019-12-27 13:12:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:34,144 INFO L462 AbstractCegarLoop]: Abstraction has 27630 states and 81446 transitions. [2019-12-27 13:12:34,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:12:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 27630 states and 81446 transitions. [2019-12-27 13:12:34,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 13:12:34,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:34,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:12:34,159 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:34,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:34,159 INFO L82 PathProgramCache]: Analyzing trace with hash -466486930, now seen corresponding path program 1 times [2019-12-27 13:12:34,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:34,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351425542] [2019-12-27 13:12:34,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:34,197 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 13:12:34,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351425542] [2019-12-27 13:12:34,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:34,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:12:34,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824508555] [2019-12-27 13:12:34,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:12:34,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:34,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:12:34,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:12:34,199 INFO L87 Difference]: Start difference. First operand 27630 states and 81446 transitions. Second operand 3 states. [2019-12-27 13:12:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:34,344 INFO L93 Difference]: Finished difference Result 30273 states and 87660 transitions. [2019-12-27 13:12:34,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:12:34,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-27 13:12:34,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:34,388 INFO L225 Difference]: With dead ends: 30273 [2019-12-27 13:12:34,388 INFO L226 Difference]: Without dead ends: 30273 [2019-12-27 13:12:34,388 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 13:12:34,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30273 states. [2019-12-27 13:12:34,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30273 to 26778. [2019-12-27 13:12:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26778 states. [2019-12-27 13:12:34,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26778 states to 26778 states and 76974 transitions. [2019-12-27 13:12:34,774 INFO L78 Accepts]: Start accepts. Automaton has 26778 states and 76974 transitions. Word has length 70 [2019-12-27 13:12:34,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:34,774 INFO L462 AbstractCegarLoop]: Abstraction has 26778 states and 76974 transitions. [2019-12-27 13:12:34,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:12:34,775 INFO L276 IsEmpty]: Start isEmpty. Operand 26778 states and 76974 transitions. [2019-12-27 13:12:34,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 13:12:34,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:34,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:12:34,788 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:34,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:34,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1471156380, now seen corresponding path program 1 times [2019-12-27 13:12:34,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:34,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913202106] [2019-12-27 13:12:34,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:34,927 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 13:12:34,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913202106] [2019-12-27 13:12:34,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:34,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 13:12:34,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332450447] [2019-12-27 13:12:34,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 13:12:34,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:34,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 13:12:34,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:12:34,928 INFO L87 Difference]: Start difference. First operand 26778 states and 76974 transitions. Second operand 8 states. [2019-12-27 13:12:36,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:36,153 INFO L93 Difference]: Finished difference Result 31593 states and 89546 transitions. [2019-12-27 13:12:36,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 13:12:36,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-12-27 13:12:36,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:36,197 INFO L225 Difference]: With dead ends: 31593 [2019-12-27 13:12:36,198 INFO L226 Difference]: Without dead ends: 31593 [2019-12-27 13:12:36,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 13:12:36,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31593 states. [2019-12-27 13:12:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31593 to 29050. [2019-12-27 13:12:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29050 states. [2019-12-27 13:12:36,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29050 states to 29050 states and 82882 transitions. [2019-12-27 13:12:36,597 INFO L78 Accepts]: Start accepts. Automaton has 29050 states and 82882 transitions. Word has length 72 [2019-12-27 13:12:36,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:36,597 INFO L462 AbstractCegarLoop]: Abstraction has 29050 states and 82882 transitions. [2019-12-27 13:12:36,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 13:12:36,597 INFO L276 IsEmpty]: Start isEmpty. Operand 29050 states and 82882 transitions. [2019-12-27 13:12:36,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 13:12:36,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:36,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:12:36,609 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:36,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:36,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1936307235, now seen corresponding path program 1 times [2019-12-27 13:12:36,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:36,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252929459] [2019-12-27 13:12:36,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:36,703 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 13:12:36,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252929459] [2019-12-27 13:12:36,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:36,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:12:36,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352514832] [2019-12-27 13:12:36,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:12:36,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:36,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:12:36,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:12:36,706 INFO L87 Difference]: Start difference. First operand 29050 states and 82882 transitions. Second operand 5 states. [2019-12-27 13:12:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:36,774 INFO L93 Difference]: Finished difference Result 10753 states and 26725 transitions. [2019-12-27 13:12:36,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 13:12:36,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-27 13:12:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:36,789 INFO L225 Difference]: With dead ends: 10753 [2019-12-27 13:12:36,789 INFO L226 Difference]: Without dead ends: 9370 [2019-12-27 13:12:36,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 13:12:36,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9370 states. [2019-12-27 13:12:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9370 to 7101. [2019-12-27 13:12:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7101 states. [2019-12-27 13:12:36,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7101 states to 7101 states and 17699 transitions. [2019-12-27 13:12:36,921 INFO L78 Accepts]: Start accepts. Automaton has 7101 states and 17699 transitions. Word has length 72 [2019-12-27 13:12:36,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:36,922 INFO L462 AbstractCegarLoop]: Abstraction has 7101 states and 17699 transitions. [2019-12-27 13:12:36,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:12:36,922 INFO L276 IsEmpty]: Start isEmpty. Operand 7101 states and 17699 transitions. [2019-12-27 13:12:36,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-27 13:12:36,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:36,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:36,932 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:36,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:36,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1268369208, now seen corresponding path program 1 times [2019-12-27 13:12:36,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:36,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457426286] [2019-12-27 13:12:36,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:36,990 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 13:12:36,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457426286] [2019-12-27 13:12:36,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:36,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:12:36,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984179085] [2019-12-27 13:12:36,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:12:36,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:36,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:12:36,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:12:36,992 INFO L87 Difference]: Start difference. First operand 7101 states and 17699 transitions. Second operand 3 states. [2019-12-27 13:12:37,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:37,094 INFO L93 Difference]: Finished difference Result 7155 states and 17825 transitions. [2019-12-27 13:12:37,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:12:37,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-12-27 13:12:37,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:37,103 INFO L225 Difference]: With dead ends: 7155 [2019-12-27 13:12:37,104 INFO L226 Difference]: Without dead ends: 7155 [2019-12-27 13:12:37,104 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 13:12:37,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7155 states. [2019-12-27 13:12:37,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7155 to 7146. [2019-12-27 13:12:37,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7146 states. [2019-12-27 13:12:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7146 states to 7146 states and 17804 transitions. [2019-12-27 13:12:37,184 INFO L78 Accepts]: Start accepts. Automaton has 7146 states and 17804 transitions. Word has length 101 [2019-12-27 13:12:37,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:37,184 INFO L462 AbstractCegarLoop]: Abstraction has 7146 states and 17804 transitions. [2019-12-27 13:12:37,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:12:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 7146 states and 17804 transitions. [2019-12-27 13:12:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-27 13:12:37,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:37,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:37,192 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:37,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:37,192 INFO L82 PathProgramCache]: Analyzing trace with hash 528582151, now seen corresponding path program 1 times [2019-12-27 13:12:37,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:37,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047521670] [2019-12-27 13:12:37,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:37,278 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 13:12:37,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047521670] [2019-12-27 13:12:37,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:37,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:12:37,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158135913] [2019-12-27 13:12:37,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:12:37,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:37,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:12:37,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:12:37,280 INFO L87 Difference]: Start difference. First operand 7146 states and 17804 transitions. Second operand 4 states. [2019-12-27 13:12:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:37,516 INFO L93 Difference]: Finished difference Result 8302 states and 20315 transitions. [2019-12-27 13:12:37,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 13:12:37,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-27 13:12:37,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:37,527 INFO L225 Difference]: With dead ends: 8302 [2019-12-27 13:12:37,527 INFO L226 Difference]: Without dead ends: 8302 [2019-12-27 13:12:37,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:12:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8302 states. [2019-12-27 13:12:37,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8302 to 7768. [2019-12-27 13:12:37,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7768 states. [2019-12-27 13:12:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7768 states to 7768 states and 19156 transitions. [2019-12-27 13:12:37,615 INFO L78 Accepts]: Start accepts. Automaton has 7768 states and 19156 transitions. Word has length 101 [2019-12-27 13:12:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:37,615 INFO L462 AbstractCegarLoop]: Abstraction has 7768 states and 19156 transitions. [2019-12-27 13:12:37,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:12:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 7768 states and 19156 transitions. [2019-12-27 13:12:37,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-27 13:12:37,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:37,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:37,623 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:37,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:37,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1773346632, now seen corresponding path program 1 times [2019-12-27 13:12:37,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:37,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329640698] [2019-12-27 13:12:37,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:37,844 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 13:12:37,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329640698] [2019-12-27 13:12:37,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:37,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 13:12:37,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466834506] [2019-12-27 13:12:37,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 13:12:37,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:37,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 13:12:37,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:12:37,848 INFO L87 Difference]: Start difference. First operand 7768 states and 19156 transitions. Second operand 8 states. [2019-12-27 13:12:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:39,776 INFO L93 Difference]: Finished difference Result 16832 states and 39816 transitions. [2019-12-27 13:12:39,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 13:12:39,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-12-27 13:12:39,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:39,796 INFO L225 Difference]: With dead ends: 16832 [2019-12-27 13:12:39,796 INFO L226 Difference]: Without dead ends: 16741 [2019-12-27 13:12:39,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2019-12-27 13:12:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16741 states. [2019-12-27 13:12:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16741 to 13349. [2019-12-27 13:12:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13349 states. [2019-12-27 13:12:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13349 states to 13349 states and 32307 transitions. [2019-12-27 13:12:39,963 INFO L78 Accepts]: Start accepts. Automaton has 13349 states and 32307 transitions. Word has length 101 [2019-12-27 13:12:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:39,964 INFO L462 AbstractCegarLoop]: Abstraction has 13349 states and 32307 transitions. [2019-12-27 13:12:39,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 13:12:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 13349 states and 32307 transitions. [2019-12-27 13:12:39,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-27 13:12:39,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:39,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:39,980 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:39,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:39,981 INFO L82 PathProgramCache]: Analyzing trace with hash -303862711, now seen corresponding path program 1 times [2019-12-27 13:12:39,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:39,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862881930] [2019-12-27 13:12:39,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:12:40,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862881930] [2019-12-27 13:12:40,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:40,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:12:40,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57967946] [2019-12-27 13:12:40,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:12:40,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:40,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:12:40,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:12:40,102 INFO L87 Difference]: Start difference. First operand 13349 states and 32307 transitions. Second operand 7 states. [2019-12-27 13:12:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:40,758 INFO L93 Difference]: Finished difference Result 18327 states and 42575 transitions. [2019-12-27 13:12:40,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 13:12:40,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-12-27 13:12:40,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:40,777 INFO L225 Difference]: With dead ends: 18327 [2019-12-27 13:12:40,777 INFO L226 Difference]: Without dead ends: 18327 [2019-12-27 13:12:40,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 13:12:40,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18327 states. [2019-12-27 13:12:40,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18327 to 15631. [2019-12-27 13:12:40,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15631 states. [2019-12-27 13:12:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15631 states to 15631 states and 36824 transitions. [2019-12-27 13:12:40,977 INFO L78 Accepts]: Start accepts. Automaton has 15631 states and 36824 transitions. Word has length 101 [2019-12-27 13:12:40,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:40,977 INFO L462 AbstractCegarLoop]: Abstraction has 15631 states and 36824 transitions. [2019-12-27 13:12:40,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:12:40,977 INFO L276 IsEmpty]: Start isEmpty. Operand 15631 states and 36824 transitions. [2019-12-27 13:12:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-27 13:12:40,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:40,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:40,994 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:40,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:40,995 INFO L82 PathProgramCache]: Analyzing trace with hash -92511798, now seen corresponding path program 1 times [2019-12-27 13:12:40,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:40,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823356907] [2019-12-27 13:12:40,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:41,089 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 13:12:41,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823356907] [2019-12-27 13:12:41,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:41,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:12:41,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446041371] [2019-12-27 13:12:41,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:12:41,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:41,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:12:41,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:12:41,091 INFO L87 Difference]: Start difference. First operand 15631 states and 36824 transitions. Second operand 7 states. [2019-12-27 13:12:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:42,188 INFO L93 Difference]: Finished difference Result 19332 states and 44797 transitions. [2019-12-27 13:12:42,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 13:12:42,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-12-27 13:12:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:42,206 INFO L225 Difference]: With dead ends: 19332 [2019-12-27 13:12:42,206 INFO L226 Difference]: Without dead ends: 19332 [2019-12-27 13:12:42,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-12-27 13:12:42,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19332 states. [2019-12-27 13:12:42,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19332 to 16146. [2019-12-27 13:12:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16146 states. [2019-12-27 13:12:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16146 states to 16146 states and 37947 transitions. [2019-12-27 13:12:42,393 INFO L78 Accepts]: Start accepts. Automaton has 16146 states and 37947 transitions. Word has length 101 [2019-12-27 13:12:42,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:42,393 INFO L462 AbstractCegarLoop]: Abstraction has 16146 states and 37947 transitions. [2019-12-27 13:12:42,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:12:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 16146 states and 37947 transitions. [2019-12-27 13:12:42,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-27 13:12:42,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:42,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:42,408 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:42,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:42,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1894969962, now seen corresponding path program 1 times [2019-12-27 13:12:42,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:42,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950960503] [2019-12-27 13:12:42,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:42,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 13:12:42,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950960503] [2019-12-27 13:12:42,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:42,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:12:42,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379489659] [2019-12-27 13:12:42,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:12:42,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:42,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:12:42,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:12:42,557 INFO L87 Difference]: Start difference. First operand 16146 states and 37947 transitions. Second operand 7 states. [2019-12-27 13:12:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:42,976 INFO L93 Difference]: Finished difference Result 16863 states and 39425 transitions. [2019-12-27 13:12:42,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 13:12:42,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-12-27 13:12:42,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:43,007 INFO L225 Difference]: With dead ends: 16863 [2019-12-27 13:12:43,008 INFO L226 Difference]: Without dead ends: 16863 [2019-12-27 13:12:43,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-27 13:12:43,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16863 states. [2019-12-27 13:12:43,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16863 to 15838. [2019-12-27 13:12:43,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15838 states. [2019-12-27 13:12:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15838 states to 15838 states and 37229 transitions. [2019-12-27 13:12:43,376 INFO L78 Accepts]: Start accepts. Automaton has 15838 states and 37229 transitions. Word has length 101 [2019-12-27 13:12:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:43,377 INFO L462 AbstractCegarLoop]: Abstraction has 15838 states and 37229 transitions. [2019-12-27 13:12:43,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:12:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 15838 states and 37229 transitions. [2019-12-27 13:12:43,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-27 13:12:43,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:43,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:43,403 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:43,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:43,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1512493653, now seen corresponding path program 1 times [2019-12-27 13:12:43,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:43,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57457310] [2019-12-27 13:12:43,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:43,457 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 13:12:43,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57457310] [2019-12-27 13:12:43,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:43,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:12:43,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303060123] [2019-12-27 13:12:43,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:12:43,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:43,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:12:43,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:12:43,460 INFO L87 Difference]: Start difference. First operand 15838 states and 37229 transitions. Second operand 3 states. [2019-12-27 13:12:43,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:43,562 INFO L93 Difference]: Finished difference Result 18821 states and 44096 transitions. [2019-12-27 13:12:43,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:12:43,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-12-27 13:12:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:43,597 INFO L225 Difference]: With dead ends: 18821 [2019-12-27 13:12:43,597 INFO L226 Difference]: Without dead ends: 18821 [2019-12-27 13:12:43,598 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 13:12:43,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18821 states. [2019-12-27 13:12:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18821 to 18754. [2019-12-27 13:12:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18754 states. [2019-12-27 13:12:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18754 states to 18754 states and 43953 transitions. [2019-12-27 13:12:43,997 INFO L78 Accepts]: Start accepts. Automaton has 18754 states and 43953 transitions. Word has length 101 [2019-12-27 13:12:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:43,998 INFO L462 AbstractCegarLoop]: Abstraction has 18754 states and 43953 transitions. [2019-12-27 13:12:43,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:12:43,998 INFO L276 IsEmpty]: Start isEmpty. Operand 18754 states and 43953 transitions. [2019-12-27 13:12:44,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-27 13:12:44,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:44,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:44,029 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:44,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:44,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1161693716, now seen corresponding path program 1 times [2019-12-27 13:12:44,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:44,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721031637] [2019-12-27 13:12:44,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:44,123 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 13:12:44,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721031637] [2019-12-27 13:12:44,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:44,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:12:44,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205156410] [2019-12-27 13:12:44,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:12:44,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:44,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:12:44,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:12:44,126 INFO L87 Difference]: Start difference. First operand 18754 states and 43953 transitions. Second operand 4 states. [2019-12-27 13:12:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:44,455 INFO L93 Difference]: Finished difference Result 18899 states and 44279 transitions. [2019-12-27 13:12:44,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 13:12:44,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-27 13:12:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:44,483 INFO L225 Difference]: With dead ends: 18899 [2019-12-27 13:12:44,483 INFO L226 Difference]: Without dead ends: 18899 [2019-12-27 13:12:44,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 13:12:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18899 states. [2019-12-27 13:12:44,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18899 to 18028. [2019-12-27 13:12:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18028 states. [2019-12-27 13:12:44,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18028 states to 18028 states and 42345 transitions. [2019-12-27 13:12:44,987 INFO L78 Accepts]: Start accepts. Automaton has 18028 states and 42345 transitions. Word has length 101 [2019-12-27 13:12:44,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:44,988 INFO L462 AbstractCegarLoop]: Abstraction has 18028 states and 42345 transitions. [2019-12-27 13:12:44,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:12:44,988 INFO L276 IsEmpty]: Start isEmpty. Operand 18028 states and 42345 transitions. [2019-12-27 13:12:45,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-27 13:12:45,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:45,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:45,018 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:45,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:45,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1712112647, now seen corresponding path program 1 times [2019-12-27 13:12:45,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:45,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336217498] [2019-12-27 13:12:45,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:45,111 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 13:12:45,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336217498] [2019-12-27 13:12:45,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:45,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:12:45,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155790373] [2019-12-27 13:12:45,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:12:45,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:45,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:12:45,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:12:45,117 INFO L87 Difference]: Start difference. First operand 18028 states and 42345 transitions. Second operand 5 states. [2019-12-27 13:12:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:45,591 INFO L93 Difference]: Finished difference Result 19978 states and 46304 transitions. [2019-12-27 13:12:45,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 13:12:45,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-12-27 13:12:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:45,628 INFO L225 Difference]: With dead ends: 19978 [2019-12-27 13:12:45,628 INFO L226 Difference]: Without dead ends: 19978 [2019-12-27 13:12:45,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:12:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19978 states. [2019-12-27 13:12:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19978 to 18225. [2019-12-27 13:12:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18225 states. [2019-12-27 13:12:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18225 states to 18225 states and 42752 transitions. [2019-12-27 13:12:45,930 INFO L78 Accepts]: Start accepts. Automaton has 18225 states and 42752 transitions. Word has length 101 [2019-12-27 13:12:45,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:45,931 INFO L462 AbstractCegarLoop]: Abstraction has 18225 states and 42752 transitions. [2019-12-27 13:12:45,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:12:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 18225 states and 42752 transitions. [2019-12-27 13:12:45,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-27 13:12:45,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:45,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:45,948 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:45,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:45,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1458103061, now seen corresponding path program 2 times [2019-12-27 13:12:45,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:45,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805819855] [2019-12-27 13:12:45,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:46,062 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 13:12:46,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805819855] [2019-12-27 13:12:46,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:46,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 13:12:46,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379792131] [2019-12-27 13:12:46,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 13:12:46,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:46,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 13:12:46,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:12:46,072 INFO L87 Difference]: Start difference. First operand 18225 states and 42752 transitions. Second operand 8 states. [2019-12-27 13:12:47,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:47,813 INFO L93 Difference]: Finished difference Result 23836 states and 54988 transitions. [2019-12-27 13:12:47,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 13:12:47,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-12-27 13:12:47,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:47,841 INFO L225 Difference]: With dead ends: 23836 [2019-12-27 13:12:47,842 INFO L226 Difference]: Without dead ends: 23756 [2019-12-27 13:12:47,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-12-27 13:12:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23756 states. [2019-12-27 13:12:48,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23756 to 18425. [2019-12-27 13:12:48,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18425 states. [2019-12-27 13:12:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18425 states to 18425 states and 43165 transitions. [2019-12-27 13:12:48,076 INFO L78 Accepts]: Start accepts. Automaton has 18425 states and 43165 transitions. Word has length 101 [2019-12-27 13:12:48,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:48,076 INFO L462 AbstractCegarLoop]: Abstraction has 18425 states and 43165 transitions. [2019-12-27 13:12:48,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 13:12:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 18425 states and 43165 transitions. [2019-12-27 13:12:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-27 13:12:48,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:48,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:48,094 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:48,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:48,094 INFO L82 PathProgramCache]: Analyzing trace with hash 759654892, now seen corresponding path program 2 times [2019-12-27 13:12:48,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:48,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264234961] [2019-12-27 13:12:48,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:48,157 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 13:12:48,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264234961] [2019-12-27 13:12:48,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:48,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:12:48,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749696951] [2019-12-27 13:12:48,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:12:48,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:48,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:12:48,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:12:48,160 INFO L87 Difference]: Start difference. First operand 18425 states and 43165 transitions. Second operand 5 states. [2019-12-27 13:12:48,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:48,903 INFO L93 Difference]: Finished difference Result 21718 states and 50598 transitions. [2019-12-27 13:12:48,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:12:48,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-12-27 13:12:48,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:48,936 INFO L225 Difference]: With dead ends: 21718 [2019-12-27 13:12:48,936 INFO L226 Difference]: Without dead ends: 21718 [2019-12-27 13:12:48,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:12:48,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21718 states. [2019-12-27 13:12:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21718 to 18345. [2019-12-27 13:12:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18345 states. [2019-12-27 13:12:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18345 states to 18345 states and 42896 transitions. [2019-12-27 13:12:49,248 INFO L78 Accepts]: Start accepts. Automaton has 18345 states and 42896 transitions. Word has length 101 [2019-12-27 13:12:49,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:49,248 INFO L462 AbstractCegarLoop]: Abstraction has 18345 states and 42896 transitions. [2019-12-27 13:12:49,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:12:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 18345 states and 42896 transitions. [2019-12-27 13:12:49,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 13:12:49,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:49,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:49,274 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:49,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:49,274 INFO L82 PathProgramCache]: Analyzing trace with hash -218448047, now seen corresponding path program 1 times [2019-12-27 13:12:49,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:49,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698904710] [2019-12-27 13:12:49,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:49,536 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 13:12:49,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698904710] [2019-12-27 13:12:49,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:49,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 13:12:49,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263832597] [2019-12-27 13:12:49,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 13:12:49,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:49,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 13:12:49,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-27 13:12:49,539 INFO L87 Difference]: Start difference. First operand 18345 states and 42896 transitions. Second operand 11 states. [2019-12-27 13:12:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:50,323 INFO L93 Difference]: Finished difference Result 26443 states and 61208 transitions. [2019-12-27 13:12:50,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 13:12:50,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2019-12-27 13:12:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:50,360 INFO L225 Difference]: With dead ends: 26443 [2019-12-27 13:12:50,360 INFO L226 Difference]: Without dead ends: 24687 [2019-12-27 13:12:50,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-27 13:12:50,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24687 states. [2019-12-27 13:12:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24687 to 22620. [2019-12-27 13:12:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22620 states. [2019-12-27 13:12:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22620 states to 22620 states and 52924 transitions. [2019-12-27 13:12:50,730 INFO L78 Accepts]: Start accepts. Automaton has 22620 states and 52924 transitions. Word has length 103 [2019-12-27 13:12:50,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:50,730 INFO L462 AbstractCegarLoop]: Abstraction has 22620 states and 52924 transitions. [2019-12-27 13:12:50,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 13:12:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand 22620 states and 52924 transitions. [2019-12-27 13:12:50,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 13:12:50,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:50,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:50,753 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:50,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:50,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1205242523, now seen corresponding path program 1 times [2019-12-27 13:12:50,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:50,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644604644] [2019-12-27 13:12:50,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:50,903 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 13:12:50,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644604644] [2019-12-27 13:12:50,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:50,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 13:12:50,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977686158] [2019-12-27 13:12:50,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 13:12:50,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:50,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 13:12:50,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:12:50,907 INFO L87 Difference]: Start difference. First operand 22620 states and 52924 transitions. Second operand 8 states. [2019-12-27 13:12:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:51,082 INFO L93 Difference]: Finished difference Result 23161 states and 54113 transitions. [2019-12-27 13:12:51,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:12:51,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-12-27 13:12:51,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:51,088 INFO L225 Difference]: With dead ends: 23161 [2019-12-27 13:12:51,088 INFO L226 Difference]: Without dead ends: 3280 [2019-12-27 13:12:51,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 13:12:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3280 states. [2019-12-27 13:12:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3280 to 3278. [2019-12-27 13:12:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3278 states. [2019-12-27 13:12:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 7704 transitions. [2019-12-27 13:12:51,138 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 7704 transitions. Word has length 103 [2019-12-27 13:12:51,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:51,138 INFO L462 AbstractCegarLoop]: Abstraction has 3278 states and 7704 transitions. [2019-12-27 13:12:51,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 13:12:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 7704 transitions. [2019-12-27 13:12:51,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 13:12:51,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:51,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:51,143 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:51,144 INFO L82 PathProgramCache]: Analyzing trace with hash 368428420, now seen corresponding path program 1 times [2019-12-27 13:12:51,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:51,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684324327] [2019-12-27 13:12:51,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:12:51,303 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 13:12:51,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684324327] [2019-12-27 13:12:51,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:12:51,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 13:12:51,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932516076] [2019-12-27 13:12:51,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 13:12:51,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:12:51,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 13:12:51,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-27 13:12:51,306 INFO L87 Difference]: Start difference. First operand 3278 states and 7704 transitions. Second operand 11 states. [2019-12-27 13:12:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:12:51,903 INFO L93 Difference]: Finished difference Result 6274 states and 14366 transitions. [2019-12-27 13:12:51,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 13:12:51,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2019-12-27 13:12:51,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:12:51,909 INFO L225 Difference]: With dead ends: 6274 [2019-12-27 13:12:51,910 INFO L226 Difference]: Without dead ends: 4479 [2019-12-27 13:12:51,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2019-12-27 13:12:51,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4479 states. [2019-12-27 13:12:51,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4479 to 3316. [2019-12-27 13:12:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3316 states. [2019-12-27 13:12:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 7727 transitions. [2019-12-27 13:12:51,965 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 7727 transitions. Word has length 103 [2019-12-27 13:12:51,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:12:51,966 INFO L462 AbstractCegarLoop]: Abstraction has 3316 states and 7727 transitions. [2019-12-27 13:12:51,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 13:12:51,966 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 7727 transitions. [2019-12-27 13:12:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 13:12:51,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:12:51,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:51,971 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:12:51,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:12:51,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1899206436, now seen corresponding path program 2 times [2019-12-27 13:12:51,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:12:51,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337350876] [2019-12-27 13:12:51,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:12:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 13:12:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 13:12:52,082 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 13:12:52,082 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 13:12:52,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:12:52 BasicIcfg [2019-12-27 13:12:52,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 13:12:52,295 INFO L168 Benchmark]: Toolchain (without parser) took 109426.82 ms. Allocated memory was 145.8 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 13:12:52,296 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 13:12:52,296 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.05 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.5 MB in the beginning and 156.6 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 13:12:52,297 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.24 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 153.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 13:12:52,297 INFO L168 Benchmark]: Boogie Preprocessor took 42.70 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 150.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 13:12:52,298 INFO L168 Benchmark]: RCFGBuilder took 1047.77 ms. Allocated memory is still 202.9 MB. Free memory was 150.6 MB in the beginning and 98.2 MB in the end (delta: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 7.1 GB. [2019-12-27 13:12:52,298 INFO L168 Benchmark]: TraceAbstraction took 107464.26 ms. Allocated memory was 202.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 97.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 13:12:52,300 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.20 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.05 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.5 MB in the beginning and 156.6 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.24 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 153.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.70 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 150.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1047.77 ms. Allocated memory is still 202.9 MB. Free memory was 150.6 MB in the beginning and 98.2 MB in the end (delta: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107464.26 ms. Allocated memory was 202.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 97.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L709] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L710] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L711] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L712] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 0 pthread_t t1771; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] FCALL, FORK 0 pthread_create(&t1771, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 0 pthread_t t1772; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] FCALL, FORK 0 pthread_create(&t1772, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff1 = y$w_buff0 [L758] 2 y$w_buff0 = 1 [L759] 2 y$w_buff1_used = y$w_buff0_used [L760] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L763] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L764] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = (_Bool)1 [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 [L784] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L825] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 107.0s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 47.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10195 SDtfs, 11464 SDslu, 26554 SDs, 0 SdLazy, 9761 SolverSat, 590 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 80 SyntacticMatches, 13 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196980occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 45.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 194779 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2266 NumberOfCodeBlocks, 2266 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2136 ConstructedInterpolants, 0 QuantifiedInterpolants, 457227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...