/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/podwr000_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 03:37:28,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 03:37:28,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 03:37:28,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 03:37:28,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 03:37:28,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 03:37:28,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 03:37:28,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 03:37:28,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 03:37:28,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 03:37:28,800 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 03:37:28,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 03:37:28,802 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 03:37:28,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 03:37:28,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 03:37:28,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 03:37:28,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 03:37:28,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 03:37:28,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 03:37:28,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 03:37:28,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 03:37:28,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 03:37:28,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 03:37:28,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 03:37:28,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 03:37:28,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 03:37:28,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 03:37:28,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 03:37:28,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 03:37:28,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 03:37:28,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 03:37:28,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 03:37:28,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 03:37:28,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 03:37:28,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 03:37:28,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 03:37:28,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 03:37:28,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 03:37:28,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 03:37:28,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 03:37:28,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 03:37:28,839 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-19 03:37:28,867 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 03:37:28,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 03:37:28,877 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 03:37:28,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 03:37:28,877 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 03:37:28,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 03:37:28,878 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 03:37:28,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 03:37:28,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 03:37:28,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 03:37:28,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 03:37:28,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 03:37:28,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 03:37:28,879 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 03:37:28,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 03:37:28,879 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 03:37:28,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 03:37:28,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 03:37:28,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 03:37:28,881 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 03:37:28,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 03:37:28,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 03:37:28,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 03:37:28,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 03:37:28,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 03:37:28,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 03:37:28,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 03:37:28,883 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 03:37:28,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 03:37:28,883 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 03:37:29,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 03:37:29,155 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 03:37:29,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 03:37:29,159 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 03:37:29,160 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 03:37:29,161 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr000_tso.oepc.i [2019-12-19 03:37:29,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc067bfe/f32be498f6f347c8b3a8ff86c83dcdc6/FLAG9dcfe780d [2019-12-19 03:37:29,764 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 03:37:29,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr000_tso.oepc.i [2019-12-19 03:37:29,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc067bfe/f32be498f6f347c8b3a8ff86c83dcdc6/FLAG9dcfe780d [2019-12-19 03:37:30,045 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc067bfe/f32be498f6f347c8b3a8ff86c83dcdc6 [2019-12-19 03:37:30,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 03:37:30,057 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 03:37:30,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 03:37:30,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 03:37:30,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 03:37:30,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:37:30" (1/1) ... [2019-12-19 03:37:30,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:37:30, skipping insertion in model container [2019-12-19 03:37:30,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:37:30" (1/1) ... [2019-12-19 03:37:30,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 03:37:30,137 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 03:37:30,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:37:30,707 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 03:37:30,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:37:30,855 INFO L208 MainTranslator]: Completed translation [2019-12-19 03:37:30,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:37:30 WrapperNode [2019-12-19 03:37:30,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 03:37:30,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 03:37:30,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 03:37:30,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 03:37:30,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:37:30" (1/1) ... [2019-12-19 03:37:30,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:37:30" (1/1) ... [2019-12-19 03:37:30,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 03:37:30,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 03:37:30,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 03:37:30,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 03:37:30,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:37:30" (1/1) ... [2019-12-19 03:37:30,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:37:30" (1/1) ... [2019-12-19 03:37:30,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:37:30" (1/1) ... [2019-12-19 03:37:30,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:37:30" (1/1) ... [2019-12-19 03:37:30,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:37:30" (1/1) ... [2019-12-19 03:37:30,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:37:30" (1/1) ... [2019-12-19 03:37:30,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:37:30" (1/1) ... [2019-12-19 03:37:30,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 03:37:30,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 03:37:30,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 03:37:30,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 03:37:30,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:37:30" (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-19 03:37:31,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 03:37:31,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 03:37:31,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 03:37:31,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 03:37:31,026 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 03:37:31,026 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 03:37:31,026 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 03:37:31,026 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 03:37:31,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 03:37:31,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 03:37:31,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 03:37:31,029 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 03:37:31,724 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 03:37:31,724 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 03:37:31,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:37:31 BoogieIcfgContainer [2019-12-19 03:37:31,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 03:37:31,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 03:37:31,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 03:37:31,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 03:37:31,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:37:30" (1/3) ... [2019-12-19 03:37:31,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bbe8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:37:31, skipping insertion in model container [2019-12-19 03:37:31,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:37:30" (2/3) ... [2019-12-19 03:37:31,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bbe8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:37:31, skipping insertion in model container [2019-12-19 03:37:31,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:37:31" (3/3) ... [2019-12-19 03:37:31,738 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_tso.oepc.i [2019-12-19 03:37:31,749 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 03:37:31,750 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 03:37:31,757 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 03:37:31,758 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 03:37:31,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,795 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,795 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,795 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,796 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,796 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,806 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,806 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,857 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,857 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,857 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,864 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,867 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:37:31,882 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 03:37:31,902 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 03:37:31,902 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 03:37:31,902 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 03:37:31,902 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 03:37:31,902 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 03:37:31,903 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 03:37:31,903 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 03:37:31,903 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 03:37:31,916 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 181 transitions [2019-12-19 03:37:34,087 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32591 states. [2019-12-19 03:37:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 32591 states. [2019-12-19 03:37:34,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-19 03:37:34,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:37:34,097 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] [2019-12-19 03:37:34,097 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:37:34,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:37:34,103 INFO L82 PathProgramCache]: Analyzing trace with hash -211488886, now seen corresponding path program 1 times [2019-12-19 03:37:34,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:37:34,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801567215] [2019-12-19 03:37:34,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:37:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:37:34,379 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-19 03:37:34,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801567215] [2019-12-19 03:37:34,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:37:34,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:37:34,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260756283] [2019-12-19 03:37:34,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:37:34,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:37:34,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:37:34,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:37:34,404 INFO L87 Difference]: Start difference. First operand 32591 states. Second operand 4 states. [2019-12-19 03:37:36,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:37:36,039 INFO L93 Difference]: Finished difference Result 33591 states and 129568 transitions. [2019-12-19 03:37:36,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:37:36,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-19 03:37:36,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:37:36,345 INFO L225 Difference]: With dead ends: 33591 [2019-12-19 03:37:36,346 INFO L226 Difference]: Without dead ends: 25703 [2019-12-19 03:37:36,357 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-19 03:37:36,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-12-19 03:37:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25703. [2019-12-19 03:37:37,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25703 states. [2019-12-19 03:37:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25703 states to 25703 states and 99584 transitions. [2019-12-19 03:37:37,986 INFO L78 Accepts]: Start accepts. Automaton has 25703 states and 99584 transitions. Word has length 34 [2019-12-19 03:37:37,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:37:37,989 INFO L462 AbstractCegarLoop]: Abstraction has 25703 states and 99584 transitions. [2019-12-19 03:37:37,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:37:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 25703 states and 99584 transitions. [2019-12-19 03:37:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-19 03:37:38,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:37:38,004 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] [2019-12-19 03:37:38,005 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:37:38,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:37:38,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1616921250, now seen corresponding path program 1 times [2019-12-19 03:37:38,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:37:38,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656598137] [2019-12-19 03:37:38,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:37:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:37:38,178 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-19 03:37:38,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656598137] [2019-12-19 03:37:38,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:37:38,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:37:38,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748961049] [2019-12-19 03:37:38,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:37:38,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:37:38,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:37:38,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:37:38,183 INFO L87 Difference]: Start difference. First operand 25703 states and 99584 transitions. Second operand 5 states. [2019-12-19 03:37:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:37:39,081 INFO L93 Difference]: Finished difference Result 41081 states and 150431 transitions. [2019-12-19 03:37:39,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:37:39,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-19 03:37:39,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:37:40,519 INFO L225 Difference]: With dead ends: 41081 [2019-12-19 03:37:40,519 INFO L226 Difference]: Without dead ends: 40545 [2019-12-19 03:37:40,520 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-19 03:37:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40545 states. [2019-12-19 03:37:41,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40545 to 38925. [2019-12-19 03:37:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38925 states. [2019-12-19 03:37:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 143581 transitions. [2019-12-19 03:37:41,930 INFO L78 Accepts]: Start accepts. Automaton has 38925 states and 143581 transitions. Word has length 46 [2019-12-19 03:37:41,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:37:41,933 INFO L462 AbstractCegarLoop]: Abstraction has 38925 states and 143581 transitions. [2019-12-19 03:37:41,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:37:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 38925 states and 143581 transitions. [2019-12-19 03:37:41,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-19 03:37:41,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:37:41,943 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-19 03:37:41,943 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:37:41,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:37:41,944 INFO L82 PathProgramCache]: Analyzing trace with hash -7572596, now seen corresponding path program 1 times [2019-12-19 03:37:41,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:37:41,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278516041] [2019-12-19 03:37:41,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:37:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:37:42,080 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-19 03:37:42,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278516041] [2019-12-19 03:37:42,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:37:42,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:37:42,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198572233] [2019-12-19 03:37:42,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:37:42,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:37:42,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:37:42,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:37:42,084 INFO L87 Difference]: Start difference. First operand 38925 states and 143581 transitions. Second operand 5 states. [2019-12-19 03:37:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:37:43,016 INFO L93 Difference]: Finished difference Result 49778 states and 180633 transitions. [2019-12-19 03:37:43,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:37:43,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-19 03:37:43,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:37:43,362 INFO L225 Difference]: With dead ends: 49778 [2019-12-19 03:37:43,363 INFO L226 Difference]: Without dead ends: 49274 [2019-12-19 03:37:43,363 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-19 03:37:43,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49274 states. [2019-12-19 03:37:46,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 42677. [2019-12-19 03:37:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42677 states. [2019-12-19 03:37:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42677 states to 42677 states and 156592 transitions. [2019-12-19 03:37:46,284 INFO L78 Accepts]: Start accepts. Automaton has 42677 states and 156592 transitions. Word has length 47 [2019-12-19 03:37:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:37:46,285 INFO L462 AbstractCegarLoop]: Abstraction has 42677 states and 156592 transitions. [2019-12-19 03:37:46,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:37:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 42677 states and 156592 transitions. [2019-12-19 03:37:46,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-19 03:37:46,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:37:46,295 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] [2019-12-19 03:37:46,295 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:37:46,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:37:46,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2011067022, now seen corresponding path program 1 times [2019-12-19 03:37:46,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:37:46,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387698288] [2019-12-19 03:37:46,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:37:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:37:46,336 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-19 03:37:46,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387698288] [2019-12-19 03:37:46,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:37:46,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:37:46,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470184439] [2019-12-19 03:37:46,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:37:46,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:37:46,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:37:46,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:37:46,338 INFO L87 Difference]: Start difference. First operand 42677 states and 156592 transitions. Second operand 3 states. [2019-12-19 03:37:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:37:46,920 INFO L93 Difference]: Finished difference Result 61087 states and 221430 transitions. [2019-12-19 03:37:46,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:37:46,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-19 03:37:46,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:37:47,093 INFO L225 Difference]: With dead ends: 61087 [2019-12-19 03:37:47,094 INFO L226 Difference]: Without dead ends: 61087 [2019-12-19 03:37:47,094 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-19 03:37:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61087 states. [2019-12-19 03:37:49,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61087 to 48016. [2019-12-19 03:37:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48016 states. [2019-12-19 03:37:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 174179 transitions. [2019-12-19 03:37:50,048 INFO L78 Accepts]: Start accepts. Automaton has 48016 states and 174179 transitions. Word has length 49 [2019-12-19 03:37:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:37:50,048 INFO L462 AbstractCegarLoop]: Abstraction has 48016 states and 174179 transitions. [2019-12-19 03:37:50,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:37:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 48016 states and 174179 transitions. [2019-12-19 03:37:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 03:37:50,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:37:50,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:37:50,066 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:37:50,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:37:50,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1033937592, now seen corresponding path program 1 times [2019-12-19 03:37:50,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:37:50,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140165217] [2019-12-19 03:37:50,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:37:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:37:50,186 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-19 03:37:50,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140165217] [2019-12-19 03:37:50,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:37:50,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:37:50,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917902235] [2019-12-19 03:37:50,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:37:50,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:37:50,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:37:50,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:37:50,188 INFO L87 Difference]: Start difference. First operand 48016 states and 174179 transitions. Second operand 6 states. [2019-12-19 03:37:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:37:51,479 INFO L93 Difference]: Finished difference Result 63756 states and 229379 transitions. [2019-12-19 03:37:51,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:37:51,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-19 03:37:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:37:51,622 INFO L225 Difference]: With dead ends: 63756 [2019-12-19 03:37:51,623 INFO L226 Difference]: Without dead ends: 63756 [2019-12-19 03:37:51,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:37:51,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63756 states. [2019-12-19 03:37:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63756 to 59949. [2019-12-19 03:37:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59949 states. [2019-12-19 03:37:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59949 states to 59949 states and 215672 transitions. [2019-12-19 03:37:54,706 INFO L78 Accepts]: Start accepts. Automaton has 59949 states and 215672 transitions. Word has length 53 [2019-12-19 03:37:54,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:37:54,706 INFO L462 AbstractCegarLoop]: Abstraction has 59949 states and 215672 transitions. [2019-12-19 03:37:54,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:37:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand 59949 states and 215672 transitions. [2019-12-19 03:37:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 03:37:54,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:37:54,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:37:54,723 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:37:54,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:37:54,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1464078345, now seen corresponding path program 1 times [2019-12-19 03:37:54,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:37:54,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414987759] [2019-12-19 03:37:54,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:37:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:37:54,841 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-19 03:37:54,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414987759] [2019-12-19 03:37:54,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:37:54,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:37:54,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412593833] [2019-12-19 03:37:54,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:37:54,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:37:54,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:37:54,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:37:54,845 INFO L87 Difference]: Start difference. First operand 59949 states and 215672 transitions. Second operand 7 states. [2019-12-19 03:37:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:37:56,681 INFO L93 Difference]: Finished difference Result 83685 states and 290097 transitions. [2019-12-19 03:37:56,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:37:56,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-19 03:37:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:37:56,868 INFO L225 Difference]: With dead ends: 83685 [2019-12-19 03:37:56,868 INFO L226 Difference]: Without dead ends: 83685 [2019-12-19 03:37:56,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:37:57,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83685 states. [2019-12-19 03:38:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83685 to 71012. [2019-12-19 03:38:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71012 states. [2019-12-19 03:38:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 249886 transitions. [2019-12-19 03:38:00,683 INFO L78 Accepts]: Start accepts. Automaton has 71012 states and 249886 transitions. Word has length 53 [2019-12-19 03:38:00,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:00,684 INFO L462 AbstractCegarLoop]: Abstraction has 71012 states and 249886 transitions. [2019-12-19 03:38:00,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:38:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 71012 states and 249886 transitions. [2019-12-19 03:38:00,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 03:38:00,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:00,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:38:00,700 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:00,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:00,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1943385270, now seen corresponding path program 1 times [2019-12-19 03:38:00,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:00,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889395198] [2019-12-19 03:38:00,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:00,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-19 03:38:00,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889395198] [2019-12-19 03:38:00,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:00,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:38:00,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38324728] [2019-12-19 03:38:00,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:38:00,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:00,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:38:00,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:38:00,767 INFO L87 Difference]: Start difference. First operand 71012 states and 249886 transitions. Second operand 3 states. [2019-12-19 03:38:01,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:01,025 INFO L93 Difference]: Finished difference Result 54021 states and 188918 transitions. [2019-12-19 03:38:01,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:38:01,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-19 03:38:01,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:01,137 INFO L225 Difference]: With dead ends: 54021 [2019-12-19 03:38:01,137 INFO L226 Difference]: Without dead ends: 54021 [2019-12-19 03:38:01,138 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-19 03:38:01,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54021 states. [2019-12-19 03:38:02,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54021 to 53406. [2019-12-19 03:38:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53406 states. [2019-12-19 03:38:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53406 states to 53406 states and 187037 transitions. [2019-12-19 03:38:02,558 INFO L78 Accepts]: Start accepts. Automaton has 53406 states and 187037 transitions. Word has length 53 [2019-12-19 03:38:02,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:02,558 INFO L462 AbstractCegarLoop]: Abstraction has 53406 states and 187037 transitions. [2019-12-19 03:38:02,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:38:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 53406 states and 187037 transitions. [2019-12-19 03:38:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 03:38:02,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:02,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:38:02,567 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:02,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:02,567 INFO L82 PathProgramCache]: Analyzing trace with hash -870863555, now seen corresponding path program 1 times [2019-12-19 03:38:02,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:02,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821326740] [2019-12-19 03:38:02,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:02,634 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-19 03:38:02,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821326740] [2019-12-19 03:38:02,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:02,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:38:02,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790489920] [2019-12-19 03:38:02,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:38:02,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:02,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:38:02,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:38:02,636 INFO L87 Difference]: Start difference. First operand 53406 states and 187037 transitions. Second operand 6 states. [2019-12-19 03:38:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:03,476 INFO L93 Difference]: Finished difference Result 68646 states and 237301 transitions. [2019-12-19 03:38:03,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 03:38:03,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-19 03:38:03,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:03,630 INFO L225 Difference]: With dead ends: 68646 [2019-12-19 03:38:03,630 INFO L226 Difference]: Without dead ends: 68078 [2019-12-19 03:38:03,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-19 03:38:03,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68078 states. [2019-12-19 03:38:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68078 to 53490. [2019-12-19 03:38:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53490 states. [2019-12-19 03:38:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53490 states to 53490 states and 187734 transitions. [2019-12-19 03:38:07,016 INFO L78 Accepts]: Start accepts. Automaton has 53490 states and 187734 transitions. Word has length 53 [2019-12-19 03:38:07,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:07,017 INFO L462 AbstractCegarLoop]: Abstraction has 53490 states and 187734 transitions. [2019-12-19 03:38:07,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:38:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 53490 states and 187734 transitions. [2019-12-19 03:38:07,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 03:38:07,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:07,027 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-19 03:38:07,028 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:07,028 INFO L82 PathProgramCache]: Analyzing trace with hash 57224143, now seen corresponding path program 1 times [2019-12-19 03:38:07,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:07,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785059310] [2019-12-19 03:38:07,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:07,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-19 03:38:07,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785059310] [2019-12-19 03:38:07,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:07,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:38:07,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403438292] [2019-12-19 03:38:07,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:38:07,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:07,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:38:07,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:38:07,125 INFO L87 Difference]: Start difference. First operand 53490 states and 187734 transitions. Second operand 6 states. [2019-12-19 03:38:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:08,016 INFO L93 Difference]: Finished difference Result 67849 states and 231360 transitions. [2019-12-19 03:38:08,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:38:08,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 03:38:08,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:08,153 INFO L225 Difference]: With dead ends: 67849 [2019-12-19 03:38:08,153 INFO L226 Difference]: Without dead ends: 67849 [2019-12-19 03:38:08,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:38:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67849 states. [2019-12-19 03:38:09,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67849 to 59081. [2019-12-19 03:38:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59081 states. [2019-12-19 03:38:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59081 states to 59081 states and 204130 transitions. [2019-12-19 03:38:09,712 INFO L78 Accepts]: Start accepts. Automaton has 59081 states and 204130 transitions. Word has length 54 [2019-12-19 03:38:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:09,713 INFO L462 AbstractCegarLoop]: Abstraction has 59081 states and 204130 transitions. [2019-12-19 03:38:09,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:38:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 59081 states and 204130 transitions. [2019-12-19 03:38:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 03:38:09,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:09,723 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-19 03:38:09,723 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:09,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:09,724 INFO L82 PathProgramCache]: Analyzing trace with hash 944727824, now seen corresponding path program 1 times [2019-12-19 03:38:09,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:09,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000225121] [2019-12-19 03:38:09,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:09,788 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-19 03:38:09,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000225121] [2019-12-19 03:38:09,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:09,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:38:09,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910766444] [2019-12-19 03:38:09,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:38:09,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:09,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:38:09,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:38:09,790 INFO L87 Difference]: Start difference. First operand 59081 states and 204130 transitions. Second operand 4 states. [2019-12-19 03:38:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:09,852 INFO L93 Difference]: Finished difference Result 10212 states and 31246 transitions. [2019-12-19 03:38:09,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:38:09,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-19 03:38:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:09,871 INFO L225 Difference]: With dead ends: 10212 [2019-12-19 03:38:09,871 INFO L226 Difference]: Without dead ends: 8507 [2019-12-19 03:38:09,872 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-19 03:38:09,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8507 states. [2019-12-19 03:38:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8507 to 8459. [2019-12-19 03:38:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8459 states. [2019-12-19 03:38:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8459 states to 8459 states and 25325 transitions. [2019-12-19 03:38:09,976 INFO L78 Accepts]: Start accepts. Automaton has 8459 states and 25325 transitions. Word has length 54 [2019-12-19 03:38:09,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:09,976 INFO L462 AbstractCegarLoop]: Abstraction has 8459 states and 25325 transitions. [2019-12-19 03:38:09,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:38:09,976 INFO L276 IsEmpty]: Start isEmpty. Operand 8459 states and 25325 transitions. [2019-12-19 03:38:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 03:38:09,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:09,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] [2019-12-19 03:38:09,981 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:09,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:09,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1459800295, now seen corresponding path program 1 times [2019-12-19 03:38:09,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:09,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615346185] [2019-12-19 03:38:09,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:10,033 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-19 03:38:10,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615346185] [2019-12-19 03:38:10,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:10,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:38:10,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299465510] [2019-12-19 03:38:10,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:38:10,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:10,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:38:10,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:38:10,035 INFO L87 Difference]: Start difference. First operand 8459 states and 25325 transitions. Second operand 4 states. [2019-12-19 03:38:10,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:10,166 INFO L93 Difference]: Finished difference Result 9706 states and 29104 transitions. [2019-12-19 03:38:10,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:38:10,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-19 03:38:10,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:10,184 INFO L225 Difference]: With dead ends: 9706 [2019-12-19 03:38:10,184 INFO L226 Difference]: Without dead ends: 9706 [2019-12-19 03:38:10,184 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-19 03:38:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9706 states. [2019-12-19 03:38:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 8879. [2019-12-19 03:38:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8879 states. [2019-12-19 03:38:10,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8879 states to 8879 states and 26588 transitions. [2019-12-19 03:38:10,597 INFO L78 Accepts]: Start accepts. Automaton has 8879 states and 26588 transitions. Word has length 61 [2019-12-19 03:38:10,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:10,597 INFO L462 AbstractCegarLoop]: Abstraction has 8879 states and 26588 transitions. [2019-12-19 03:38:10,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:38:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 8879 states and 26588 transitions. [2019-12-19 03:38:10,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 03:38:10,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:10,601 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] [2019-12-19 03:38:10,601 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:10,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:10,601 INFO L82 PathProgramCache]: Analyzing trace with hash 283010040, now seen corresponding path program 1 times [2019-12-19 03:38:10,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:10,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355366470] [2019-12-19 03:38:10,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:38:10,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355366470] [2019-12-19 03:38:10,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:10,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:38:10,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422522657] [2019-12-19 03:38:10,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:38:10,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:10,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:38:10,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:38:10,714 INFO L87 Difference]: Start difference. First operand 8879 states and 26588 transitions. Second operand 6 states. [2019-12-19 03:38:11,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:11,121 INFO L93 Difference]: Finished difference Result 11195 states and 33075 transitions. [2019-12-19 03:38:11,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 03:38:11,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-19 03:38:11,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:11,137 INFO L225 Difference]: With dead ends: 11195 [2019-12-19 03:38:11,137 INFO L226 Difference]: Without dead ends: 11134 [2019-12-19 03:38:11,137 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-19 03:38:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11134 states. [2019-12-19 03:38:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11134 to 10410. [2019-12-19 03:38:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10410 states. [2019-12-19 03:38:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10410 states to 10410 states and 30942 transitions. [2019-12-19 03:38:11,271 INFO L78 Accepts]: Start accepts. Automaton has 10410 states and 30942 transitions. Word has length 61 [2019-12-19 03:38:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:11,272 INFO L462 AbstractCegarLoop]: Abstraction has 10410 states and 30942 transitions. [2019-12-19 03:38:11,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:38:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 10410 states and 30942 transitions. [2019-12-19 03:38:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:38:11,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:11,277 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] [2019-12-19 03:38:11,277 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:11,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:11,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2090643056, now seen corresponding path program 1 times [2019-12-19 03:38:11,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:11,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179686573] [2019-12-19 03:38:11,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:11,330 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-19 03:38:11,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179686573] [2019-12-19 03:38:11,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:11,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:38:11,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492407092] [2019-12-19 03:38:11,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:38:11,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:11,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:38:11,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:38:11,332 INFO L87 Difference]: Start difference. First operand 10410 states and 30942 transitions. Second operand 4 states. [2019-12-19 03:38:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:11,793 INFO L93 Difference]: Finished difference Result 15178 states and 44225 transitions. [2019-12-19 03:38:11,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:38:11,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-19 03:38:11,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:11,821 INFO L225 Difference]: With dead ends: 15178 [2019-12-19 03:38:11,821 INFO L226 Difference]: Without dead ends: 15178 [2019-12-19 03:38:11,821 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-19 03:38:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15178 states. [2019-12-19 03:38:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15178 to 11727. [2019-12-19 03:38:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2019-12-19 03:38:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 34516 transitions. [2019-12-19 03:38:12,036 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 34516 transitions. Word has length 67 [2019-12-19 03:38:12,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:12,037 INFO L462 AbstractCegarLoop]: Abstraction has 11727 states and 34516 transitions. [2019-12-19 03:38:12,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:38:12,037 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 34516 transitions. [2019-12-19 03:38:12,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:38:12,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:12,044 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] [2019-12-19 03:38:12,044 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:12,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:12,044 INFO L82 PathProgramCache]: Analyzing trace with hash -959559759, now seen corresponding path program 1 times [2019-12-19 03:38:12,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:12,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16312504] [2019-12-19 03:38:12,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:12,128 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-19 03:38:12,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16312504] [2019-12-19 03:38:12,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:12,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:38:12,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91560390] [2019-12-19 03:38:12,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:38:12,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:12,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:38:12,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:38:12,131 INFO L87 Difference]: Start difference. First operand 11727 states and 34516 transitions. Second operand 6 states. [2019-12-19 03:38:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:12,551 INFO L93 Difference]: Finished difference Result 12772 states and 36832 transitions. [2019-12-19 03:38:12,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 03:38:12,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-19 03:38:12,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:12,568 INFO L225 Difference]: With dead ends: 12772 [2019-12-19 03:38:12,568 INFO L226 Difference]: Without dead ends: 12772 [2019-12-19 03:38:12,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:38:12,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12772 states. [2019-12-19 03:38:12,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12772 to 11925. [2019-12-19 03:38:12,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11925 states. [2019-12-19 03:38:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11925 states to 11925 states and 34759 transitions. [2019-12-19 03:38:12,716 INFO L78 Accepts]: Start accepts. Automaton has 11925 states and 34759 transitions. Word has length 67 [2019-12-19 03:38:12,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:12,716 INFO L462 AbstractCegarLoop]: Abstraction has 11925 states and 34759 transitions. [2019-12-19 03:38:12,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:38:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand 11925 states and 34759 transitions. [2019-12-19 03:38:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:38:12,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:12,723 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] [2019-12-19 03:38:12,724 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:12,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:12,724 INFO L82 PathProgramCache]: Analyzing trace with hash -748208846, now seen corresponding path program 1 times [2019-12-19 03:38:12,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:12,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898161908] [2019-12-19 03:38:12,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:12,794 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-19 03:38:12,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898161908] [2019-12-19 03:38:12,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:12,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:38:12,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456331518] [2019-12-19 03:38:12,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:38:12,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:12,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:38:12,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:38:12,796 INFO L87 Difference]: Start difference. First operand 11925 states and 34759 transitions. Second operand 5 states. [2019-12-19 03:38:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:13,173 INFO L93 Difference]: Finished difference Result 15220 states and 44029 transitions. [2019-12-19 03:38:13,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:38:13,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-19 03:38:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:13,194 INFO L225 Difference]: With dead ends: 15220 [2019-12-19 03:38:13,194 INFO L226 Difference]: Without dead ends: 15220 [2019-12-19 03:38:13,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:38:13,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15220 states. [2019-12-19 03:38:13,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15220 to 14156. [2019-12-19 03:38:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14156 states. [2019-12-19 03:38:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14156 states to 14156 states and 40894 transitions. [2019-12-19 03:38:13,378 INFO L78 Accepts]: Start accepts. Automaton has 14156 states and 40894 transitions. Word has length 67 [2019-12-19 03:38:13,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:13,378 INFO L462 AbstractCegarLoop]: Abstraction has 14156 states and 40894 transitions. [2019-12-19 03:38:13,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:38:13,378 INFO L276 IsEmpty]: Start isEmpty. Operand 14156 states and 40894 transitions. [2019-12-19 03:38:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:38:13,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:13,386 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] [2019-12-19 03:38:13,386 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:13,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:13,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1258743023, now seen corresponding path program 1 times [2019-12-19 03:38:13,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:13,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357982586] [2019-12-19 03:38:13,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:13,444 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-19 03:38:13,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357982586] [2019-12-19 03:38:13,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:13,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:38:13,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931209450] [2019-12-19 03:38:13,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:38:13,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:13,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:38:13,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:38:13,449 INFO L87 Difference]: Start difference. First operand 14156 states and 40894 transitions. Second operand 4 states. [2019-12-19 03:38:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:14,339 INFO L93 Difference]: Finished difference Result 17525 states and 50589 transitions. [2019-12-19 03:38:14,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:38:14,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-19 03:38:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:14,361 INFO L225 Difference]: With dead ends: 17525 [2019-12-19 03:38:14,361 INFO L226 Difference]: Without dead ends: 17354 [2019-12-19 03:38:14,362 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-19 03:38:14,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17354 states. [2019-12-19 03:38:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17354 to 16508. [2019-12-19 03:38:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16508 states. [2019-12-19 03:38:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16508 states to 16508 states and 47592 transitions. [2019-12-19 03:38:14,559 INFO L78 Accepts]: Start accepts. Automaton has 16508 states and 47592 transitions. Word has length 67 [2019-12-19 03:38:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:14,560 INFO L462 AbstractCegarLoop]: Abstraction has 16508 states and 47592 transitions. [2019-12-19 03:38:14,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:38:14,560 INFO L276 IsEmpty]: Start isEmpty. Operand 16508 states and 47592 transitions. [2019-12-19 03:38:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:38:14,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:14,568 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] [2019-12-19 03:38:14,569 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:14,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:14,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1239272914, now seen corresponding path program 1 times [2019-12-19 03:38:14,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:14,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217424050] [2019-12-19 03:38:14,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:14,710 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-19 03:38:14,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217424050] [2019-12-19 03:38:14,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:14,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:38:14,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789144367] [2019-12-19 03:38:14,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:38:14,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:14,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:38:14,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:38:14,712 INFO L87 Difference]: Start difference. First operand 16508 states and 47592 transitions. Second operand 7 states. [2019-12-19 03:38:15,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:15,325 INFO L93 Difference]: Finished difference Result 21898 states and 61512 transitions. [2019-12-19 03:38:15,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 03:38:15,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-19 03:38:15,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:15,353 INFO L225 Difference]: With dead ends: 21898 [2019-12-19 03:38:15,353 INFO L226 Difference]: Without dead ends: 21898 [2019-12-19 03:38:15,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:38:15,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2019-12-19 03:38:15,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 18377. [2019-12-19 03:38:15,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18377 states. [2019-12-19 03:38:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18377 states to 18377 states and 51655 transitions. [2019-12-19 03:38:15,586 INFO L78 Accepts]: Start accepts. Automaton has 18377 states and 51655 transitions. Word has length 67 [2019-12-19 03:38:15,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:15,586 INFO L462 AbstractCegarLoop]: Abstraction has 18377 states and 51655 transitions. [2019-12-19 03:38:15,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:38:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 18377 states and 51655 transitions. [2019-12-19 03:38:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:38:15,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:15,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:38:15,594 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:15,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:15,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2126776595, now seen corresponding path program 1 times [2019-12-19 03:38:15,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:15,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694669971] [2019-12-19 03:38:15,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:15,682 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-19 03:38:15,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694669971] [2019-12-19 03:38:15,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:15,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:38:15,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356011484] [2019-12-19 03:38:15,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:38:15,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:15,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:38:15,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:38:15,685 INFO L87 Difference]: Start difference. First operand 18377 states and 51655 transitions. Second operand 5 states. [2019-12-19 03:38:15,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:15,757 INFO L93 Difference]: Finished difference Result 5654 states and 13548 transitions. [2019-12-19 03:38:15,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:38:15,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-19 03:38:15,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:15,765 INFO L225 Difference]: With dead ends: 5654 [2019-12-19 03:38:15,765 INFO L226 Difference]: Without dead ends: 4682 [2019-12-19 03:38:15,765 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-19 03:38:15,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2019-12-19 03:38:15,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 3847. [2019-12-19 03:38:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3847 states. [2019-12-19 03:38:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 9034 transitions. [2019-12-19 03:38:15,824 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 9034 transitions. Word has length 67 [2019-12-19 03:38:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:15,824 INFO L462 AbstractCegarLoop]: Abstraction has 3847 states and 9034 transitions. [2019-12-19 03:38:15,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:38:15,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 9034 transitions. [2019-12-19 03:38:15,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:38:15,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:15,827 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] [2019-12-19 03:38:15,828 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:15,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:15,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1987685399, now seen corresponding path program 1 times [2019-12-19 03:38:15,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:15,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305426734] [2019-12-19 03:38:15,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:15,860 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-19 03:38:15,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305426734] [2019-12-19 03:38:15,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:15,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:38:15,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263871973] [2019-12-19 03:38:15,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:38:15,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:15,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:38:15,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:38:15,862 INFO L87 Difference]: Start difference. First operand 3847 states and 9034 transitions. Second operand 3 states. [2019-12-19 03:38:15,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:15,908 INFO L93 Difference]: Finished difference Result 4819 states and 11125 transitions. [2019-12-19 03:38:15,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:38:15,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-19 03:38:15,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:15,915 INFO L225 Difference]: With dead ends: 4819 [2019-12-19 03:38:15,915 INFO L226 Difference]: Without dead ends: 4819 [2019-12-19 03:38:15,915 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-19 03:38:15,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2019-12-19 03:38:15,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 3790. [2019-12-19 03:38:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3790 states. [2019-12-19 03:38:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 8687 transitions. [2019-12-19 03:38:15,974 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 8687 transitions. Word has length 67 [2019-12-19 03:38:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:15,974 INFO L462 AbstractCegarLoop]: Abstraction has 3790 states and 8687 transitions. [2019-12-19 03:38:15,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:38:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 8687 transitions. [2019-12-19 03:38:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-19 03:38:15,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:15,981 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] [2019-12-19 03:38:15,981 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:15,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:15,981 INFO L82 PathProgramCache]: Analyzing trace with hash -788602436, now seen corresponding path program 1 times [2019-12-19 03:38:15,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:15,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632531443] [2019-12-19 03:38:15,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:16,088 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-19 03:38:16,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632531443] [2019-12-19 03:38:16,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:16,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:38:16,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591768292] [2019-12-19 03:38:16,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:38:16,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:16,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:38:16,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:38:16,091 INFO L87 Difference]: Start difference. First operand 3790 states and 8687 transitions. Second operand 5 states. [2019-12-19 03:38:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:16,262 INFO L93 Difference]: Finished difference Result 4737 states and 10904 transitions. [2019-12-19 03:38:16,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 03:38:16,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-19 03:38:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:16,269 INFO L225 Difference]: With dead ends: 4737 [2019-12-19 03:38:16,269 INFO L226 Difference]: Without dead ends: 4737 [2019-12-19 03:38:16,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:38:16,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4737 states. [2019-12-19 03:38:16,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 4176. [2019-12-19 03:38:16,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4176 states. [2019-12-19 03:38:16,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 9598 transitions. [2019-12-19 03:38:16,330 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 9598 transitions. Word has length 73 [2019-12-19 03:38:16,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:16,330 INFO L462 AbstractCegarLoop]: Abstraction has 4176 states and 9598 transitions. [2019-12-19 03:38:16,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:38:16,330 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 9598 transitions. [2019-12-19 03:38:16,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-19 03:38:16,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:16,335 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] [2019-12-19 03:38:16,336 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:16,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:16,336 INFO L82 PathProgramCache]: Analyzing trace with hash 954207899, now seen corresponding path program 1 times [2019-12-19 03:38:16,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:16,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092022057] [2019-12-19 03:38:16,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:16,403 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-19 03:38:16,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092022057] [2019-12-19 03:38:16,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:16,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:38:16,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017069601] [2019-12-19 03:38:16,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:38:16,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:16,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:38:16,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:38:16,406 INFO L87 Difference]: Start difference. First operand 4176 states and 9598 transitions. Second operand 7 states. [2019-12-19 03:38:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:16,899 INFO L93 Difference]: Finished difference Result 4873 states and 11063 transitions. [2019-12-19 03:38:16,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 03:38:16,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-19 03:38:16,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:16,906 INFO L225 Difference]: With dead ends: 4873 [2019-12-19 03:38:16,907 INFO L226 Difference]: Without dead ends: 4820 [2019-12-19 03:38:16,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-19 03:38:16,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2019-12-19 03:38:16,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 4234. [2019-12-19 03:38:16,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4234 states. [2019-12-19 03:38:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 9647 transitions. [2019-12-19 03:38:16,950 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 9647 transitions. Word has length 73 [2019-12-19 03:38:16,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:16,950 INFO L462 AbstractCegarLoop]: Abstraction has 4234 states and 9647 transitions. [2019-12-19 03:38:16,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:38:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 9647 transitions. [2019-12-19 03:38:16,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 03:38:16,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:16,954 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] [2019-12-19 03:38:16,955 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:16,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:16,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1009148223, now seen corresponding path program 1 times [2019-12-19 03:38:16,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:16,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074094196] [2019-12-19 03:38:16,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:17,004 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-19 03:38:17,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074094196] [2019-12-19 03:38:17,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:17,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:38:17,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751051061] [2019-12-19 03:38:17,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:38:17,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:17,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:38:17,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:38:17,006 INFO L87 Difference]: Start difference. First operand 4234 states and 9647 transitions. Second operand 3 states. [2019-12-19 03:38:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:17,152 INFO L93 Difference]: Finished difference Result 5804 states and 12895 transitions. [2019-12-19 03:38:17,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:38:17,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-19 03:38:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:17,159 INFO L225 Difference]: With dead ends: 5804 [2019-12-19 03:38:17,159 INFO L226 Difference]: Without dead ends: 5513 [2019-12-19 03:38:17,159 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-19 03:38:17,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5513 states. [2019-12-19 03:38:17,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 5040. [2019-12-19 03:38:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5040 states. [2019-12-19 03:38:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5040 states to 5040 states and 11341 transitions. [2019-12-19 03:38:17,209 INFO L78 Accepts]: Start accepts. Automaton has 5040 states and 11341 transitions. Word has length 94 [2019-12-19 03:38:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:17,209 INFO L462 AbstractCegarLoop]: Abstraction has 5040 states and 11341 transitions. [2019-12-19 03:38:17,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:38:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 5040 states and 11341 transitions. [2019-12-19 03:38:17,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 03:38:17,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:17,214 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] [2019-12-19 03:38:17,214 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:17,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:17,214 INFO L82 PathProgramCache]: Analyzing trace with hash -725997759, now seen corresponding path program 1 times [2019-12-19 03:38:17,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:17,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872335388] [2019-12-19 03:38:17,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:17,276 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-19 03:38:17,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872335388] [2019-12-19 03:38:17,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:17,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:38:17,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979901835] [2019-12-19 03:38:17,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:38:17,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:17,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:38:17,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:38:17,284 INFO L87 Difference]: Start difference. First operand 5040 states and 11341 transitions. Second operand 4 states. [2019-12-19 03:38:17,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:17,398 INFO L93 Difference]: Finished difference Result 5316 states and 12003 transitions. [2019-12-19 03:38:17,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:38:17,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-19 03:38:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:17,406 INFO L225 Difference]: With dead ends: 5316 [2019-12-19 03:38:17,406 INFO L226 Difference]: Without dead ends: 5316 [2019-12-19 03:38:17,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:38:17,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5316 states. [2019-12-19 03:38:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5316 to 4773. [2019-12-19 03:38:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4773 states. [2019-12-19 03:38:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4773 states to 4773 states and 10838 transitions. [2019-12-19 03:38:17,733 INFO L78 Accepts]: Start accepts. Automaton has 4773 states and 10838 transitions. Word has length 94 [2019-12-19 03:38:17,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:17,733 INFO L462 AbstractCegarLoop]: Abstraction has 4773 states and 10838 transitions. [2019-12-19 03:38:17,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:38:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 4773 states and 10838 transitions. [2019-12-19 03:38:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:38:17,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:17,738 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] [2019-12-19 03:38:17,738 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:17,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:17,738 INFO L82 PathProgramCache]: Analyzing trace with hash 574359335, now seen corresponding path program 1 times [2019-12-19 03:38:17,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:17,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975462754] [2019-12-19 03:38:17,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:17,814 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-19 03:38:17,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975462754] [2019-12-19 03:38:17,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:17,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:38:17,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363507825] [2019-12-19 03:38:17,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:38:17,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:17,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:38:17,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:38:17,817 INFO L87 Difference]: Start difference. First operand 4773 states and 10838 transitions. Second operand 5 states. [2019-12-19 03:38:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:17,951 INFO L93 Difference]: Finished difference Result 5452 states and 12346 transitions. [2019-12-19 03:38:17,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:38:17,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-19 03:38:17,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:17,959 INFO L225 Difference]: With dead ends: 5452 [2019-12-19 03:38:17,960 INFO L226 Difference]: Without dead ends: 5452 [2019-12-19 03:38:17,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:38:17,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2019-12-19 03:38:18,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 4174. [2019-12-19 03:38:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-12-19 03:38:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 9445 transitions. [2019-12-19 03:38:18,031 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 9445 transitions. Word has length 96 [2019-12-19 03:38:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:18,032 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 9445 transitions. [2019-12-19 03:38:18,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:38:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 9445 transitions. [2019-12-19 03:38:18,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:38:18,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:18,037 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] [2019-12-19 03:38:18,037 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:18,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:18,038 INFO L82 PathProgramCache]: Analyzing trace with hash 585675462, now seen corresponding path program 1 times [2019-12-19 03:38:18,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:18,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096427875] [2019-12-19 03:38:18,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:18,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-19 03:38:18,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096427875] [2019-12-19 03:38:18,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:18,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:38:18,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822286667] [2019-12-19 03:38:18,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:38:18,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:18,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:38:18,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:38:18,113 INFO L87 Difference]: Start difference. First operand 4174 states and 9445 transitions. Second operand 4 states. [2019-12-19 03:38:18,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:18,354 INFO L93 Difference]: Finished difference Result 4884 states and 10994 transitions. [2019-12-19 03:38:18,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:38:18,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-19 03:38:18,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:18,360 INFO L225 Difference]: With dead ends: 4884 [2019-12-19 03:38:18,361 INFO L226 Difference]: Without dead ends: 4828 [2019-12-19 03:38:18,361 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-19 03:38:18,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4828 states. [2019-12-19 03:38:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4828 to 4625. [2019-12-19 03:38:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4625 states. [2019-12-19 03:38:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 10444 transitions. [2019-12-19 03:38:18,405 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 10444 transitions. Word has length 96 [2019-12-19 03:38:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:18,405 INFO L462 AbstractCegarLoop]: Abstraction has 4625 states and 10444 transitions. [2019-12-19 03:38:18,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:38:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 10444 transitions. [2019-12-19 03:38:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:38:18,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:18,413 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] [2019-12-19 03:38:18,414 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:18,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:18,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1491533881, now seen corresponding path program 1 times [2019-12-19 03:38:18,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:18,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349497240] [2019-12-19 03:38:18,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:18,626 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-19 03:38:18,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349497240] [2019-12-19 03:38:18,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:18,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 03:38:18,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919468079] [2019-12-19 03:38:18,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 03:38:18,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:18,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 03:38:18,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:38:18,628 INFO L87 Difference]: Start difference. First operand 4625 states and 10444 transitions. Second operand 9 states. [2019-12-19 03:38:19,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:19,362 INFO L93 Difference]: Finished difference Result 6285 states and 13941 transitions. [2019-12-19 03:38:19,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 03:38:19,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-19 03:38:19,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:19,370 INFO L225 Difference]: With dead ends: 6285 [2019-12-19 03:38:19,370 INFO L226 Difference]: Without dead ends: 6285 [2019-12-19 03:38:19,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-12-19 03:38:19,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6285 states. [2019-12-19 03:38:19,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6285 to 5107. [2019-12-19 03:38:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5107 states. [2019-12-19 03:38:19,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 11442 transitions. [2019-12-19 03:38:19,432 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 11442 transitions. Word has length 96 [2019-12-19 03:38:19,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:19,432 INFO L462 AbstractCegarLoop]: Abstraction has 5107 states and 11442 transitions. [2019-12-19 03:38:19,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 03:38:19,433 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 11442 transitions. [2019-12-19 03:38:19,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:38:19,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:19,438 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] [2019-12-19 03:38:19,438 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:19,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:19,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1280182968, now seen corresponding path program 1 times [2019-12-19 03:38:19,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:19,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284154904] [2019-12-19 03:38:19,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:19,547 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-19 03:38:19,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284154904] [2019-12-19 03:38:19,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:19,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:38:19,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405718843] [2019-12-19 03:38:19,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:38:19,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:19,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:38:19,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:38:19,549 INFO L87 Difference]: Start difference. First operand 5107 states and 11442 transitions. Second operand 5 states. [2019-12-19 03:38:19,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:19,588 INFO L93 Difference]: Finished difference Result 5107 states and 11433 transitions. [2019-12-19 03:38:19,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:38:19,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-19 03:38:19,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:19,596 INFO L225 Difference]: With dead ends: 5107 [2019-12-19 03:38:19,596 INFO L226 Difference]: Without dead ends: 5107 [2019-12-19 03:38:19,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:38:19,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5107 states. [2019-12-19 03:38:19,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5107 to 4871. [2019-12-19 03:38:19,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4871 states. [2019-12-19 03:38:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4871 states to 4871 states and 10906 transitions. [2019-12-19 03:38:19,642 INFO L78 Accepts]: Start accepts. Automaton has 4871 states and 10906 transitions. Word has length 96 [2019-12-19 03:38:19,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:19,643 INFO L462 AbstractCegarLoop]: Abstraction has 4871 states and 10906 transitions. [2019-12-19 03:38:19,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:38:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 10906 transitions. [2019-12-19 03:38:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:38:19,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:19,650 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] [2019-12-19 03:38:19,650 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:19,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:19,651 INFO L82 PathProgramCache]: Analyzing trace with hash -392679287, now seen corresponding path program 1 times [2019-12-19 03:38:19,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:19,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667507041] [2019-12-19 03:38:19,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:38:19,806 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-19 03:38:19,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667507041] [2019-12-19 03:38:19,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:38:19,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 03:38:19,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223168554] [2019-12-19 03:38:19,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 03:38:19,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:38:19,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 03:38:19,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:38:19,808 INFO L87 Difference]: Start difference. First operand 4871 states and 10906 transitions. Second operand 10 states. [2019-12-19 03:38:20,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:38:20,286 INFO L93 Difference]: Finished difference Result 14875 states and 33775 transitions. [2019-12-19 03:38:20,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 03:38:20,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-19 03:38:20,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:38:20,299 INFO L225 Difference]: With dead ends: 14875 [2019-12-19 03:38:20,299 INFO L226 Difference]: Without dead ends: 9691 [2019-12-19 03:38:20,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-19 03:38:20,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9691 states. [2019-12-19 03:38:20,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9691 to 4841. [2019-12-19 03:38:20,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4841 states. [2019-12-19 03:38:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 10747 transitions. [2019-12-19 03:38:20,366 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 10747 transitions. Word has length 96 [2019-12-19 03:38:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:38:20,366 INFO L462 AbstractCegarLoop]: Abstraction has 4841 states and 10747 transitions. [2019-12-19 03:38:20,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 03:38:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 10747 transitions. [2019-12-19 03:38:20,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 03:38:20,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:38:20,371 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] [2019-12-19 03:38:20,371 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:38:20,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:38:20,371 INFO L82 PathProgramCache]: Analyzing trace with hash -325970013, now seen corresponding path program 2 times [2019-12-19 03:38:20,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:38:20,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128953131] [2019-12-19 03:38:20,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:38:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:38:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:38:20,462 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 03:38:20,463 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 03:38:20,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:38:20 BasicIcfg [2019-12-19 03:38:20,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 03:38:20,688 INFO L168 Benchmark]: Toolchain (without parser) took 50631.14 ms. Allocated memory was 145.2 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 101.2 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-19 03:38:20,691 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 03:38:20,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.25 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 100.8 MB in the beginning and 156.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-19 03:38:20,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.48 ms. Allocated memory is still 203.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 03:38:20,695 INFO L168 Benchmark]: Boogie Preprocessor took 41.10 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 03:38:20,698 INFO L168 Benchmark]: RCFGBuilder took 763.84 ms. Allocated memory is still 203.9 MB. Free memory was 151.4 MB in the beginning and 107.0 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-19 03:38:20,698 INFO L168 Benchmark]: TraceAbstraction took 48958.24 ms. Allocated memory was 203.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.3 MB in the beginning and 1.1 GB in the end (delta: -996.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-19 03:38:20,700 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.44 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 798.25 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 100.8 MB in the beginning and 156.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.48 ms. Allocated memory is still 203.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.10 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 763.84 ms. Allocated memory is still 203.9 MB. Free memory was 151.4 MB in the beginning and 107.0 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48958.24 ms. Allocated memory was 203.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.3 MB in the beginning and 1.1 GB in the end (delta: -996.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L793] 0 pthread_t t1557; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L794] FCALL, FORK 0 pthread_create(&t1557, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L795] 0 pthread_t t1558; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L796] FCALL, FORK 0 pthread_create(&t1558, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!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)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!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)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] EXPR 1 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=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 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)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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=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=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 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 [L774] 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=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=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 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=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=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 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 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 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=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 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=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 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=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 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) [L803] 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=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 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 [L805] 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=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L806] 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=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 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 [L809] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 48.5s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 18.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7729 SDtfs, 8592 SDslu, 17159 SDs, 0 SdLazy, 6487 SolverSat, 411 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 75 SyntacticMatches, 17 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71012occurred 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: 24.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 84839 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1997 NumberOfCodeBlocks, 1997 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1873 ConstructedInterpolants, 0 QuantifiedInterpolants, 365587 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...