/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/safe029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 14:23:05,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 14:23:05,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 14:23:05,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 14:23:05,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 14:23:05,924 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 14:23:05,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 14:23:05,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 14:23:05,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 14:23:05,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 14:23:05,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 14:23:05,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 14:23:05,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 14:23:05,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 14:23:05,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 14:23:05,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 14:23:05,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 14:23:05,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 14:23:05,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 14:23:05,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 14:23:05,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 14:23:05,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 14:23:05,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 14:23:05,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 14:23:05,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 14:23:05,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 14:23:05,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 14:23:05,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 14:23:05,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 14:23:05,948 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 14:23:05,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 14:23:05,949 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 14:23:05,950 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 14:23:05,951 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 14:23:05,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 14:23:05,952 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 14:23:05,952 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 14:23:05,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 14:23:05,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 14:23:05,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 14:23:05,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 14:23:05,955 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 14:23:05,969 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 14:23:05,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 14:23:05,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 14:23:05,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 14:23:05,971 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 14:23:05,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 14:23:05,972 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 14:23:05,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 14:23:05,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 14:23:05,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 14:23:05,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 14:23:05,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 14:23:05,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 14:23:05,974 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 14:23:05,975 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 14:23:05,975 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 14:23:05,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 14:23:05,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 14:23:05,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 14:23:05,976 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 14:23:05,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 14:23:05,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 14:23:05,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 14:23:05,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 14:23:05,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 14:23:05,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 14:23:05,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 14:23:05,978 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 14:23:05,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 14:23:05,978 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 14:23:06,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 14:23:06,290 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 14:23:06,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 14:23:06,295 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 14:23:06,296 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 14:23:06,296 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2019-12-27 14:23:06,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad86553ec/27dda16107594cfc8f8cfaa6d19cfd82/FLAG633ddd36f [2019-12-27 14:23:06,949 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 14:23:06,949 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2019-12-27 14:23:06,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad86553ec/27dda16107594cfc8f8cfaa6d19cfd82/FLAG633ddd36f [2019-12-27 14:23:07,218 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad86553ec/27dda16107594cfc8f8cfaa6d19cfd82 [2019-12-27 14:23:07,228 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 14:23:07,230 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 14:23:07,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 14:23:07,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 14:23:07,235 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 14:23:07,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:23:07" (1/1) ... [2019-12-27 14:23:07,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2479233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:07, skipping insertion in model container [2019-12-27 14:23:07,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:23:07" (1/1) ... [2019-12-27 14:23:07,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 14:23:07,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 14:23:07,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 14:23:07,815 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 14:23:07,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 14:23:07,964 INFO L208 MainTranslator]: Completed translation [2019-12-27 14:23:07,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:07 WrapperNode [2019-12-27 14:23:07,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 14:23:07,966 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 14:23:07,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 14:23:07,966 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 14:23:07,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:07" (1/1) ... [2019-12-27 14:23:07,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:07" (1/1) ... [2019-12-27 14:23:08,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 14:23:08,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 14:23:08,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 14:23:08,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 14:23:08,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:07" (1/1) ... [2019-12-27 14:23:08,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:07" (1/1) ... [2019-12-27 14:23:08,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:07" (1/1) ... [2019-12-27 14:23:08,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:07" (1/1) ... [2019-12-27 14:23:08,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:07" (1/1) ... [2019-12-27 14:23:08,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:07" (1/1) ... [2019-12-27 14:23:08,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:07" (1/1) ... [2019-12-27 14:23:08,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 14:23:08,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 14:23:08,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 14:23:08,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 14:23:08,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 14:23:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 14:23:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 14:23:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 14:23:08,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 14:23:08,137 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 14:23:08,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 14:23:08,137 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 14:23:08,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 14:23:08,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 14:23:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 14:23:08,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 14:23:08,140 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 14:23:08,841 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 14:23:08,841 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 14:23:08,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:23:08 BoogieIcfgContainer [2019-12-27 14:23:08,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 14:23:08,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 14:23:08,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 14:23:08,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 14:23:08,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:23:07" (1/3) ... [2019-12-27 14:23:08,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411e1817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:23:08, skipping insertion in model container [2019-12-27 14:23:08,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:07" (2/3) ... [2019-12-27 14:23:08,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411e1817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:23:08, skipping insertion in model container [2019-12-27 14:23:08,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:23:08" (3/3) ... [2019-12-27 14:23:08,852 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2019-12-27 14:23:08,863 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 14:23:08,864 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 14:23:08,872 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 14:23:08,873 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 14:23:08,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,909 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,910 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,919 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,919 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,919 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,920 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,920 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,933 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,933 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,936 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,937 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,937 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:08,955 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 14:23:08,972 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 14:23:08,972 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 14:23:08,972 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 14:23:08,973 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 14:23:08,973 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 14:23:08,973 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 14:23:08,973 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 14:23:08,973 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 14:23:08,988 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145 places, 179 transitions [2019-12-27 14:23:10,807 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22493 states. [2019-12-27 14:23:10,809 INFO L276 IsEmpty]: Start isEmpty. Operand 22493 states. [2019-12-27 14:23:10,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 14:23:10,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:10,820 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] [2019-12-27 14:23:10,820 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:10,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:10,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2054349026, now seen corresponding path program 1 times [2019-12-27 14:23:10,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:10,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594754501] [2019-12-27 14:23:10,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:11,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:11,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594754501] [2019-12-27 14:23:11,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:11,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:23:11,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598177739] [2019-12-27 14:23:11,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:23:11,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:11,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:23:11,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:23:11,203 INFO L87 Difference]: Start difference. First operand 22493 states. Second operand 4 states. [2019-12-27 14:23:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:11,852 INFO L93 Difference]: Finished difference Result 23445 states and 91746 transitions. [2019-12-27 14:23:11,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 14:23:11,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-27 14:23:11,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:12,038 INFO L225 Difference]: With dead ends: 23445 [2019-12-27 14:23:12,038 INFO L226 Difference]: Without dead ends: 21269 [2019-12-27 14:23:12,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:23:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21269 states. [2019-12-27 14:23:13,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21269 to 21269. [2019-12-27 14:23:13,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21269 states. [2019-12-27 14:23:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21269 states to 21269 states and 83770 transitions. [2019-12-27 14:23:14,145 INFO L78 Accepts]: Start accepts. Automaton has 21269 states and 83770 transitions. Word has length 36 [2019-12-27 14:23:14,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:14,146 INFO L462 AbstractCegarLoop]: Abstraction has 21269 states and 83770 transitions. [2019-12-27 14:23:14,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:23:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 21269 states and 83770 transitions. [2019-12-27 14:23:14,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 14:23:14,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:14,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:14,156 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:14,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:14,157 INFO L82 PathProgramCache]: Analyzing trace with hash 99870175, now seen corresponding path program 1 times [2019-12-27 14:23:14,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:14,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081199664] [2019-12-27 14:23:14,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:14,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081199664] [2019-12-27 14:23:14,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:14,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:23:14,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975212271] [2019-12-27 14:23:14,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:23:14,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:14,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:23:14,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:23:14,326 INFO L87 Difference]: Start difference. First operand 21269 states and 83770 transitions. Second operand 5 states. [2019-12-27 14:23:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:15,458 INFO L93 Difference]: Finished difference Result 34703 states and 129062 transitions. [2019-12-27 14:23:15,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:23:15,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 14:23:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:15,605 INFO L225 Difference]: With dead ends: 34703 [2019-12-27 14:23:15,605 INFO L226 Difference]: Without dead ends: 34559 [2019-12-27 14:23:15,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:23:15,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34559 states. [2019-12-27 14:23:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34559 to 33059. [2019-12-27 14:23:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33059 states. [2019-12-27 14:23:18,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33059 states to 33059 states and 123950 transitions. [2019-12-27 14:23:18,078 INFO L78 Accepts]: Start accepts. Automaton has 33059 states and 123950 transitions. Word has length 43 [2019-12-27 14:23:18,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:18,082 INFO L462 AbstractCegarLoop]: Abstraction has 33059 states and 123950 transitions. [2019-12-27 14:23:18,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:23:18,082 INFO L276 IsEmpty]: Start isEmpty. Operand 33059 states and 123950 transitions. [2019-12-27 14:23:18,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 14:23:18,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:18,091 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] [2019-12-27 14:23:18,091 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:18,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:18,092 INFO L82 PathProgramCache]: Analyzing trace with hash 268512672, now seen corresponding path program 1 times [2019-12-27 14:23:18,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:18,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872881791] [2019-12-27 14:23:18,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:18,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:18,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872881791] [2019-12-27 14:23:18,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:18,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:23:18,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806120463] [2019-12-27 14:23:18,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:23:18,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:18,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:23:18,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:23:18,240 INFO L87 Difference]: Start difference. First operand 33059 states and 123950 transitions. Second operand 5 states. [2019-12-27 14:23:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:18,827 INFO L93 Difference]: Finished difference Result 40211 states and 148619 transitions. [2019-12-27 14:23:18,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:23:18,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 14:23:18,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:19,004 INFO L225 Difference]: With dead ends: 40211 [2019-12-27 14:23:19,004 INFO L226 Difference]: Without dead ends: 40051 [2019-12-27 14:23:19,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:23:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40051 states. [2019-12-27 14:23:21,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40051 to 34632. [2019-12-27 14:23:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34632 states. [2019-12-27 14:23:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34632 states to 34632 states and 129246 transitions. [2019-12-27 14:23:21,955 INFO L78 Accepts]: Start accepts. Automaton has 34632 states and 129246 transitions. Word has length 44 [2019-12-27 14:23:21,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:21,956 INFO L462 AbstractCegarLoop]: Abstraction has 34632 states and 129246 transitions. [2019-12-27 14:23:21,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:23:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 34632 states and 129246 transitions. [2019-12-27 14:23:21,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 14:23:21,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:21,969 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] [2019-12-27 14:23:21,970 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:21,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:21,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2144969569, now seen corresponding path program 1 times [2019-12-27 14:23:21,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:21,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086680649] [2019-12-27 14:23:21,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:22,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086680649] [2019-12-27 14:23:22,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:22,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:23:22,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061141199] [2019-12-27 14:23:22,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:23:22,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:22,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:23:22,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:23:22,050 INFO L87 Difference]: Start difference. First operand 34632 states and 129246 transitions. Second operand 6 states. [2019-12-27 14:23:23,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:23,270 INFO L93 Difference]: Finished difference Result 45660 states and 166140 transitions. [2019-12-27 14:23:23,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 14:23:23,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 14:23:23,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:23,435 INFO L225 Difference]: With dead ends: 45660 [2019-12-27 14:23:23,435 INFO L226 Difference]: Without dead ends: 45516 [2019-12-27 14:23:23,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-27 14:23:23,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45516 states. [2019-12-27 14:23:25,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45516 to 33595. [2019-12-27 14:23:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33595 states. [2019-12-27 14:23:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33595 states to 33595 states and 125401 transitions. [2019-12-27 14:23:25,960 INFO L78 Accepts]: Start accepts. Automaton has 33595 states and 125401 transitions. Word has length 51 [2019-12-27 14:23:25,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:25,960 INFO L462 AbstractCegarLoop]: Abstraction has 33595 states and 125401 transitions. [2019-12-27 14:23:25,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:23:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 33595 states and 125401 transitions. [2019-12-27 14:23:25,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 14:23:25,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:25,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:25,992 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:25,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:25,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1490455740, now seen corresponding path program 1 times [2019-12-27 14:23:25,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:25,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795606764] [2019-12-27 14:23:25,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:26,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795606764] [2019-12-27 14:23:26,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:26,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:23:26,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120059015] [2019-12-27 14:23:26,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:23:26,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:26,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:23:26,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:23:26,125 INFO L87 Difference]: Start difference. First operand 33595 states and 125401 transitions. Second operand 6 states. [2019-12-27 14:23:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:26,891 INFO L93 Difference]: Finished difference Result 46067 states and 167834 transitions. [2019-12-27 14:23:26,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 14:23:26,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 14:23:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:27,038 INFO L225 Difference]: With dead ends: 46067 [2019-12-27 14:23:27,039 INFO L226 Difference]: Without dead ends: 45827 [2019-12-27 14:23:27,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 14:23:27,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45827 states. [2019-12-27 14:23:28,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45827 to 39956. [2019-12-27 14:23:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39956 states. [2019-12-27 14:23:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39956 states to 39956 states and 147325 transitions. [2019-12-27 14:23:28,189 INFO L78 Accepts]: Start accepts. Automaton has 39956 states and 147325 transitions. Word has length 58 [2019-12-27 14:23:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:28,190 INFO L462 AbstractCegarLoop]: Abstraction has 39956 states and 147325 transitions. [2019-12-27 14:23:28,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:23:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 39956 states and 147325 transitions. [2019-12-27 14:23:28,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 14:23:28,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:28,227 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:28,227 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:28,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:28,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1015725706, now seen corresponding path program 1 times [2019-12-27 14:23:28,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:28,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187262722] [2019-12-27 14:23:28,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:28,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187262722] [2019-12-27 14:23:28,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:28,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:23:28,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391318898] [2019-12-27 14:23:28,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:23:28,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:28,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:23:28,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:28,285 INFO L87 Difference]: Start difference. First operand 39956 states and 147325 transitions. Second operand 3 states. [2019-12-27 14:23:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:28,864 INFO L93 Difference]: Finished difference Result 50254 states and 182160 transitions. [2019-12-27 14:23:28,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:23:28,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-27 14:23:28,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:28,972 INFO L225 Difference]: With dead ends: 50254 [2019-12-27 14:23:28,973 INFO L226 Difference]: Without dead ends: 50254 [2019-12-27 14:23:28,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:29,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50254 states. [2019-12-27 14:23:31,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50254 to 43886. [2019-12-27 14:23:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43886 states. [2019-12-27 14:23:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43886 states to 43886 states and 160763 transitions. [2019-12-27 14:23:31,566 INFO L78 Accepts]: Start accepts. Automaton has 43886 states and 160763 transitions. Word has length 60 [2019-12-27 14:23:31,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:31,567 INFO L462 AbstractCegarLoop]: Abstraction has 43886 states and 160763 transitions. [2019-12-27 14:23:31,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:23:31,567 INFO L276 IsEmpty]: Start isEmpty. Operand 43886 states and 160763 transitions. [2019-12-27 14:23:31,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 14:23:31,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:31,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:31,604 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:31,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:31,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1067966230, now seen corresponding path program 1 times [2019-12-27 14:23:31,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:31,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940481987] [2019-12-27 14:23:31,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:31,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940481987] [2019-12-27 14:23:31,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:31,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:23:31,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707585637] [2019-12-27 14:23:31,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:23:31,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:31,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:23:31,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:23:31,729 INFO L87 Difference]: Start difference. First operand 43886 states and 160763 transitions. Second operand 7 states. [2019-12-27 14:23:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:32,810 INFO L93 Difference]: Finished difference Result 55882 states and 200497 transitions. [2019-12-27 14:23:32,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 14:23:32,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 14:23:32,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:32,932 INFO L225 Difference]: With dead ends: 55882 [2019-12-27 14:23:32,932 INFO L226 Difference]: Without dead ends: 55642 [2019-12-27 14:23:32,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-27 14:23:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55642 states. [2019-12-27 14:23:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55642 to 45112. [2019-12-27 14:23:34,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45112 states. [2019-12-27 14:23:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45112 states to 45112 states and 164930 transitions. [2019-12-27 14:23:34,192 INFO L78 Accepts]: Start accepts. Automaton has 45112 states and 164930 transitions. Word has length 64 [2019-12-27 14:23:34,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:34,192 INFO L462 AbstractCegarLoop]: Abstraction has 45112 states and 164930 transitions. [2019-12-27 14:23:34,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:23:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand 45112 states and 164930 transitions. [2019-12-27 14:23:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 14:23:34,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:34,228 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] [2019-12-27 14:23:34,228 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:34,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:34,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2097396923, now seen corresponding path program 1 times [2019-12-27 14:23:34,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:34,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944357618] [2019-12-27 14:23:34,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:34,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944357618] [2019-12-27 14:23:34,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:34,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:23:34,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195047646] [2019-12-27 14:23:34,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:23:34,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:34,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:23:34,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:23:34,325 INFO L87 Difference]: Start difference. First operand 45112 states and 164930 transitions. Second operand 7 states. [2019-12-27 14:23:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:35,951 INFO L93 Difference]: Finished difference Result 55096 states and 197674 transitions. [2019-12-27 14:23:35,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 14:23:35,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 14:23:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:36,070 INFO L225 Difference]: With dead ends: 55096 [2019-12-27 14:23:36,071 INFO L226 Difference]: Without dead ends: 54896 [2019-12-27 14:23:36,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-27 14:23:36,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54896 states. [2019-12-27 14:23:38,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54896 to 45990. [2019-12-27 14:23:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45990 states. [2019-12-27 14:23:39,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45990 states to 45990 states and 167801 transitions. [2019-12-27 14:23:39,102 INFO L78 Accepts]: Start accepts. Automaton has 45990 states and 167801 transitions. Word has length 65 [2019-12-27 14:23:39,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:39,103 INFO L462 AbstractCegarLoop]: Abstraction has 45990 states and 167801 transitions. [2019-12-27 14:23:39,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:23:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 45990 states and 167801 transitions. [2019-12-27 14:23:39,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 14:23:39,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:39,139 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-27 14:23:39,139 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:39,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:39,139 INFO L82 PathProgramCache]: Analyzing trace with hash 823868575, now seen corresponding path program 1 times [2019-12-27 14:23:39,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:39,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651578041] [2019-12-27 14:23:39,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:39,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:39,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651578041] [2019-12-27 14:23:39,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:39,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:23:39,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319626732] [2019-12-27 14:23:39,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:23:39,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:39,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:23:39,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:23:39,266 INFO L87 Difference]: Start difference. First operand 45990 states and 167801 transitions. Second operand 6 states. [2019-12-27 14:23:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:40,070 INFO L93 Difference]: Finished difference Result 65550 states and 237328 transitions. [2019-12-27 14:23:40,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:23:40,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 14:23:40,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:40,215 INFO L225 Difference]: With dead ends: 65550 [2019-12-27 14:23:40,215 INFO L226 Difference]: Without dead ends: 64906 [2019-12-27 14:23:40,216 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-27 14:23:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64906 states. [2019-12-27 14:23:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64906 to 56040. [2019-12-27 14:23:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56040 states. [2019-12-27 14:23:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56040 states to 56040 states and 204331 transitions. [2019-12-27 14:23:41,667 INFO L78 Accepts]: Start accepts. Automaton has 56040 states and 204331 transitions. Word has length 67 [2019-12-27 14:23:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:41,667 INFO L462 AbstractCegarLoop]: Abstraction has 56040 states and 204331 transitions. [2019-12-27 14:23:41,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:23:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand 56040 states and 204331 transitions. [2019-12-27 14:23:41,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 14:23:41,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:41,720 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-27 14:23:41,720 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:41,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:41,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1785482592, now seen corresponding path program 1 times [2019-12-27 14:23:41,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:41,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591125746] [2019-12-27 14:23:41,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:41,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591125746] [2019-12-27 14:23:41,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:41,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:23:41,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13551608] [2019-12-27 14:23:41,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:23:41,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:41,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:23:41,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:23:41,829 INFO L87 Difference]: Start difference. First operand 56040 states and 204331 transitions. Second operand 7 states. [2019-12-27 14:23:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:43,018 INFO L93 Difference]: Finished difference Result 83028 states and 292759 transitions. [2019-12-27 14:23:43,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 14:23:43,019 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 14:23:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:43,806 INFO L225 Difference]: With dead ends: 83028 [2019-12-27 14:23:43,806 INFO L226 Difference]: Without dead ends: 83028 [2019-12-27 14:23:43,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 14:23:44,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83028 states. [2019-12-27 14:23:45,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83028 to 76077. [2019-12-27 14:23:45,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76077 states. [2019-12-27 14:23:48,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76077 states to 76077 states and 270626 transitions. [2019-12-27 14:23:48,380 INFO L78 Accepts]: Start accepts. Automaton has 76077 states and 270626 transitions. Word has length 67 [2019-12-27 14:23:48,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:48,381 INFO L462 AbstractCegarLoop]: Abstraction has 76077 states and 270626 transitions. [2019-12-27 14:23:48,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:23:48,381 INFO L276 IsEmpty]: Start isEmpty. Operand 76077 states and 270626 transitions. [2019-12-27 14:23:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 14:23:48,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:48,460 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-27 14:23:48,460 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:48,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:48,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1264720223, now seen corresponding path program 1 times [2019-12-27 14:23:48,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:48,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057762370] [2019-12-27 14:23:48,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:48,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:48,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057762370] [2019-12-27 14:23:48,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:48,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:23:48,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169841742] [2019-12-27 14:23:48,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:23:48,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:48,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:23:48,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:23:48,563 INFO L87 Difference]: Start difference. First operand 76077 states and 270626 transitions. Second operand 5 states. [2019-12-27 14:23:48,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:48,685 INFO L93 Difference]: Finished difference Result 17222 states and 54504 transitions. [2019-12-27 14:23:48,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 14:23:48,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-27 14:23:48,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:48,723 INFO L225 Difference]: With dead ends: 17222 [2019-12-27 14:23:48,724 INFO L226 Difference]: Without dead ends: 16744 [2019-12-27 14:23:48,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:23:48,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16744 states. [2019-12-27 14:23:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16744 to 16732. [2019-12-27 14:23:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16732 states. [2019-12-27 14:23:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16732 states to 16732 states and 52999 transitions. [2019-12-27 14:23:48,992 INFO L78 Accepts]: Start accepts. Automaton has 16732 states and 52999 transitions. Word has length 67 [2019-12-27 14:23:48,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:48,992 INFO L462 AbstractCegarLoop]: Abstraction has 16732 states and 52999 transitions. [2019-12-27 14:23:48,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:23:48,992 INFO L276 IsEmpty]: Start isEmpty. Operand 16732 states and 52999 transitions. [2019-12-27 14:23:49,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 14:23:49,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:49,005 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] [2019-12-27 14:23:49,005 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:49,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:49,005 INFO L82 PathProgramCache]: Analyzing trace with hash -357405743, now seen corresponding path program 1 times [2019-12-27 14:23:49,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:49,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832362939] [2019-12-27 14:23:49,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:49,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832362939] [2019-12-27 14:23:49,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:49,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:23:49,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132418756] [2019-12-27 14:23:49,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:23:49,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:49,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:23:49,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:23:49,063 INFO L87 Difference]: Start difference. First operand 16732 states and 52999 transitions. Second operand 4 states. [2019-12-27 14:23:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:49,338 INFO L93 Difference]: Finished difference Result 22096 states and 69080 transitions. [2019-12-27 14:23:49,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:23:49,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-27 14:23:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:49,378 INFO L225 Difference]: With dead ends: 22096 [2019-12-27 14:23:49,378 INFO L226 Difference]: Without dead ends: 22096 [2019-12-27 14:23:49,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:23:49,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22096 states. [2019-12-27 14:23:49,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22096 to 17608. [2019-12-27 14:23:49,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17608 states. [2019-12-27 14:23:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17608 states to 17608 states and 55558 transitions. [2019-12-27 14:23:49,647 INFO L78 Accepts]: Start accepts. Automaton has 17608 states and 55558 transitions. Word has length 77 [2019-12-27 14:23:49,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:49,647 INFO L462 AbstractCegarLoop]: Abstraction has 17608 states and 55558 transitions. [2019-12-27 14:23:49,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:23:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand 17608 states and 55558 transitions. [2019-12-27 14:23:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 14:23:49,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:49,661 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] [2019-12-27 14:23:49,661 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:49,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:49,661 INFO L82 PathProgramCache]: Analyzing trace with hash -612142288, now seen corresponding path program 1 times [2019-12-27 14:23:49,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:49,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278442982] [2019-12-27 14:23:49,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:49,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278442982] [2019-12-27 14:23:49,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:49,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 14:23:49,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7757295] [2019-12-27 14:23:49,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 14:23:49,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:49,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 14:23:49,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:23:49,760 INFO L87 Difference]: Start difference. First operand 17608 states and 55558 transitions. Second operand 8 states. [2019-12-27 14:23:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:50,933 INFO L93 Difference]: Finished difference Result 19702 states and 61634 transitions. [2019-12-27 14:23:50,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 14:23:50,934 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-12-27 14:23:50,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:50,965 INFO L225 Difference]: With dead ends: 19702 [2019-12-27 14:23:50,965 INFO L226 Difference]: Without dead ends: 19654 [2019-12-27 14:23:50,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-27 14:23:51,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19654 states. [2019-12-27 14:23:51,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19654 to 15526. [2019-12-27 14:23:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15526 states. [2019-12-27 14:23:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15526 states to 15526 states and 49292 transitions. [2019-12-27 14:23:51,477 INFO L78 Accepts]: Start accepts. Automaton has 15526 states and 49292 transitions. Word has length 77 [2019-12-27 14:23:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:51,478 INFO L462 AbstractCegarLoop]: Abstraction has 15526 states and 49292 transitions. [2019-12-27 14:23:51,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 14:23:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 15526 states and 49292 transitions. [2019-12-27 14:23:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 14:23:51,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:51,497 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] [2019-12-27 14:23:51,497 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:51,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:51,497 INFO L82 PathProgramCache]: Analyzing trace with hash -2124522827, now seen corresponding path program 1 times [2019-12-27 14:23:51,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:51,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112857657] [2019-12-27 14:23:51,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:51,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112857657] [2019-12-27 14:23:51,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:51,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:23:51,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698638597] [2019-12-27 14:23:51,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:23:51,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:51,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:23:51,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:51,534 INFO L87 Difference]: Start difference. First operand 15526 states and 49292 transitions. Second operand 3 states. [2019-12-27 14:23:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:51,781 INFO L93 Difference]: Finished difference Result 16790 states and 53005 transitions. [2019-12-27 14:23:51,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:23:51,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-12-27 14:23:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:51,807 INFO L225 Difference]: With dead ends: 16790 [2019-12-27 14:23:51,807 INFO L226 Difference]: Without dead ends: 16790 [2019-12-27 14:23:51,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:51,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16790 states. [2019-12-27 14:23:52,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16790 to 16142. [2019-12-27 14:23:52,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16142 states. [2019-12-27 14:23:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16142 states to 16142 states and 51106 transitions. [2019-12-27 14:23:52,037 INFO L78 Accepts]: Start accepts. Automaton has 16142 states and 51106 transitions. Word has length 78 [2019-12-27 14:23:52,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:52,037 INFO L462 AbstractCegarLoop]: Abstraction has 16142 states and 51106 transitions. [2019-12-27 14:23:52,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:23:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 16142 states and 51106 transitions. [2019-12-27 14:23:52,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-27 14:23:52,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:52,051 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] [2019-12-27 14:23:52,051 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:52,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:52,052 INFO L82 PathProgramCache]: Analyzing trace with hash 2047654897, now seen corresponding path program 1 times [2019-12-27 14:23:52,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:52,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375844456] [2019-12-27 14:23:52,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:52,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375844456] [2019-12-27 14:23:52,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:52,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:23:52,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875648637] [2019-12-27 14:23:52,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:23:52,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:52,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:23:52,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:23:52,111 INFO L87 Difference]: Start difference. First operand 16142 states and 51106 transitions. Second operand 4 states. [2019-12-27 14:23:52,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:52,465 INFO L93 Difference]: Finished difference Result 19270 states and 60152 transitions. [2019-12-27 14:23:52,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 14:23:52,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-12-27 14:23:52,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:52,508 INFO L225 Difference]: With dead ends: 19270 [2019-12-27 14:23:52,508 INFO L226 Difference]: Without dead ends: 19270 [2019-12-27 14:23:52,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:23:52,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19270 states. [2019-12-27 14:23:52,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19270 to 18247. [2019-12-27 14:23:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18247 states. [2019-12-27 14:23:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18247 states to 18247 states and 57268 transitions. [2019-12-27 14:23:52,848 INFO L78 Accepts]: Start accepts. Automaton has 18247 states and 57268 transitions. Word has length 79 [2019-12-27 14:23:52,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:52,849 INFO L462 AbstractCegarLoop]: Abstraction has 18247 states and 57268 transitions. [2019-12-27 14:23:52,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:23:52,849 INFO L276 IsEmpty]: Start isEmpty. Operand 18247 states and 57268 transitions. [2019-12-27 14:23:52,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-27 14:23:52,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:52,865 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] [2019-12-27 14:23:52,865 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:52,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:52,865 INFO L82 PathProgramCache]: Analyzing trace with hash 111994610, now seen corresponding path program 1 times [2019-12-27 14:23:52,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:52,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076330821] [2019-12-27 14:23:52,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:52,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076330821] [2019-12-27 14:23:52,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:52,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:23:52,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481540749] [2019-12-27 14:23:52,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:23:52,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:52,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:23:52,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:52,905 INFO L87 Difference]: Start difference. First operand 18247 states and 57268 transitions. Second operand 3 states. [2019-12-27 14:23:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:53,146 INFO L93 Difference]: Finished difference Result 19578 states and 61167 transitions. [2019-12-27 14:23:53,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:23:53,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-12-27 14:23:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:53,176 INFO L225 Difference]: With dead ends: 19578 [2019-12-27 14:23:53,176 INFO L226 Difference]: Without dead ends: 19578 [2019-12-27 14:23:53,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:53,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19578 states. [2019-12-27 14:23:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19578 to 18919. [2019-12-27 14:23:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18919 states. [2019-12-27 14:23:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18919 states to 18919 states and 59232 transitions. [2019-12-27 14:23:53,437 INFO L78 Accepts]: Start accepts. Automaton has 18919 states and 59232 transitions. Word has length 79 [2019-12-27 14:23:53,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:53,437 INFO L462 AbstractCegarLoop]: Abstraction has 18919 states and 59232 transitions. [2019-12-27 14:23:53,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:23:53,437 INFO L276 IsEmpty]: Start isEmpty. Operand 18919 states and 59232 transitions. [2019-12-27 14:23:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:23:53,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:53,750 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] [2019-12-27 14:23:53,750 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:53,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:53,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1909076484, now seen corresponding path program 1 times [2019-12-27 14:23:53,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:53,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091169208] [2019-12-27 14:23:53,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:53,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091169208] [2019-12-27 14:23:53,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:53,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:23:53,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168031861] [2019-12-27 14:23:53,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:23:53,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:53,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:23:53,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:23:53,889 INFO L87 Difference]: Start difference. First operand 18919 states and 59232 transitions. Second operand 6 states. [2019-12-27 14:23:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:54,638 INFO L93 Difference]: Finished difference Result 30232 states and 93411 transitions. [2019-12-27 14:23:54,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 14:23:54,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-27 14:23:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:54,685 INFO L225 Difference]: With dead ends: 30232 [2019-12-27 14:23:54,685 INFO L226 Difference]: Without dead ends: 30232 [2019-12-27 14:23:54,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 14:23:54,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30232 states. [2019-12-27 14:23:54,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30232 to 21553. [2019-12-27 14:23:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21553 states. [2019-12-27 14:23:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21553 states to 21553 states and 66907 transitions. [2019-12-27 14:23:55,040 INFO L78 Accepts]: Start accepts. Automaton has 21553 states and 66907 transitions. Word has length 80 [2019-12-27 14:23:55,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:55,040 INFO L462 AbstractCegarLoop]: Abstraction has 21553 states and 66907 transitions. [2019-12-27 14:23:55,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:23:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 21553 states and 66907 transitions. [2019-12-27 14:23:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:23:55,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:55,059 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] [2019-12-27 14:23:55,060 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:55,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:55,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1141126331, now seen corresponding path program 1 times [2019-12-27 14:23:55,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:55,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120556337] [2019-12-27 14:23:55,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:55,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120556337] [2019-12-27 14:23:55,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:55,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:23:55,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287558827] [2019-12-27 14:23:55,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:23:55,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:55,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:23:55,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:23:55,141 INFO L87 Difference]: Start difference. First operand 21553 states and 66907 transitions. Second operand 4 states. [2019-12-27 14:23:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:55,820 INFO L93 Difference]: Finished difference Result 28569 states and 87453 transitions. [2019-12-27 14:23:55,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:23:55,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-27 14:23:55,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:55,863 INFO L225 Difference]: With dead ends: 28569 [2019-12-27 14:23:55,864 INFO L226 Difference]: Without dead ends: 28569 [2019-12-27 14:23:55,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:23:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28569 states. [2019-12-27 14:23:56,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28569 to 25906. [2019-12-27 14:23:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25906 states. [2019-12-27 14:23:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25906 states to 25906 states and 79893 transitions. [2019-12-27 14:23:56,230 INFO L78 Accepts]: Start accepts. Automaton has 25906 states and 79893 transitions. Word has length 80 [2019-12-27 14:23:56,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:56,230 INFO L462 AbstractCegarLoop]: Abstraction has 25906 states and 79893 transitions. [2019-12-27 14:23:56,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:23:56,230 INFO L276 IsEmpty]: Start isEmpty. Operand 25906 states and 79893 transitions. [2019-12-27 14:23:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:23:56,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:56,253 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] [2019-12-27 14:23:56,253 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:56,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:56,253 INFO L82 PathProgramCache]: Analyzing trace with hash -502495842, now seen corresponding path program 1 times [2019-12-27 14:23:56,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:56,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023844825] [2019-12-27 14:23:56,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:56,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:56,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023844825] [2019-12-27 14:23:56,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:56,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:23:56,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135101276] [2019-12-27 14:23:56,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:23:56,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:56,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:23:56,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:56,327 INFO L87 Difference]: Start difference. First operand 25906 states and 79893 transitions. Second operand 3 states. [2019-12-27 14:23:56,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:56,424 INFO L93 Difference]: Finished difference Result 24700 states and 74782 transitions. [2019-12-27 14:23:56,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:23:56,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-27 14:23:56,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:56,463 INFO L225 Difference]: With dead ends: 24700 [2019-12-27 14:23:56,464 INFO L226 Difference]: Without dead ends: 24700 [2019-12-27 14:23:56,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24700 states. [2019-12-27 14:23:57,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24700 to 23473. [2019-12-27 14:23:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23473 states. [2019-12-27 14:23:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23473 states to 23473 states and 71381 transitions. [2019-12-27 14:23:57,110 INFO L78 Accepts]: Start accepts. Automaton has 23473 states and 71381 transitions. Word has length 80 [2019-12-27 14:23:57,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:57,111 INFO L462 AbstractCegarLoop]: Abstraction has 23473 states and 71381 transitions. [2019-12-27 14:23:57,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:23:57,111 INFO L276 IsEmpty]: Start isEmpty. Operand 23473 states and 71381 transitions. [2019-12-27 14:23:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:23:57,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:57,133 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] [2019-12-27 14:23:57,133 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:57,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:57,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1017053084, now seen corresponding path program 1 times [2019-12-27 14:23:57,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:57,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983025498] [2019-12-27 14:23:57,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:57,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983025498] [2019-12-27 14:23:57,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:57,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:23:57,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207680964] [2019-12-27 14:23:57,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:23:57,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:57,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:23:57,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:23:57,249 INFO L87 Difference]: Start difference. First operand 23473 states and 71381 transitions. Second operand 6 states. [2019-12-27 14:23:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:57,782 INFO L93 Difference]: Finished difference Result 24021 states and 72777 transitions. [2019-12-27 14:23:57,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:23:57,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-27 14:23:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:57,846 INFO L225 Difference]: With dead ends: 24021 [2019-12-27 14:23:57,846 INFO L226 Difference]: Without dead ends: 24021 [2019-12-27 14:23:57,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:23:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24021 states. [2019-12-27 14:23:58,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24021 to 23419. [2019-12-27 14:23:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23419 states. [2019-12-27 14:23:58,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23419 states to 23419 states and 71162 transitions. [2019-12-27 14:23:58,388 INFO L78 Accepts]: Start accepts. Automaton has 23419 states and 71162 transitions. Word has length 80 [2019-12-27 14:23:58,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:58,388 INFO L462 AbstractCegarLoop]: Abstraction has 23419 states and 71162 transitions. [2019-12-27 14:23:58,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:23:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand 23419 states and 71162 transitions. [2019-12-27 14:23:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:23:58,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:58,419 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] [2019-12-27 14:23:58,420 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:58,420 INFO L82 PathProgramCache]: Analyzing trace with hash 615750915, now seen corresponding path program 1 times [2019-12-27 14:23:58,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:58,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350118681] [2019-12-27 14:23:58,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:58,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350118681] [2019-12-27 14:23:58,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:58,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:23:58,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547847186] [2019-12-27 14:23:58,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:23:58,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:58,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:23:58,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:23:58,576 INFO L87 Difference]: Start difference. First operand 23419 states and 71162 transitions. Second operand 5 states. [2019-12-27 14:23:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:58,773 INFO L93 Difference]: Finished difference Result 23362 states and 70971 transitions. [2019-12-27 14:23:58,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:23:58,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-27 14:23:58,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:58,812 INFO L225 Difference]: With dead ends: 23362 [2019-12-27 14:23:58,812 INFO L226 Difference]: Without dead ends: 23362 [2019-12-27 14:23:58,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:23:58,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23362 states. [2019-12-27 14:23:59,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23362 to 23323. [2019-12-27 14:23:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23323 states. [2019-12-27 14:23:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23323 states to 23323 states and 70867 transitions. [2019-12-27 14:23:59,122 INFO L78 Accepts]: Start accepts. Automaton has 23323 states and 70867 transitions. Word has length 80 [2019-12-27 14:23:59,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:59,123 INFO L462 AbstractCegarLoop]: Abstraction has 23323 states and 70867 transitions. [2019-12-27 14:23:59,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:23:59,123 INFO L276 IsEmpty]: Start isEmpty. Operand 23323 states and 70867 transitions. [2019-12-27 14:23:59,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:23:59,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:59,145 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] [2019-12-27 14:23:59,145 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:59,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:59,145 INFO L82 PathProgramCache]: Analyzing trace with hash 332600451, now seen corresponding path program 1 times [2019-12-27 14:23:59,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:59,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341993541] [2019-12-27 14:23:59,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:59,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341993541] [2019-12-27 14:23:59,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:59,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:23:59,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950216183] [2019-12-27 14:23:59,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:23:59,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:59,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:23:59,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:23:59,211 INFO L87 Difference]: Start difference. First operand 23323 states and 70867 transitions. Second operand 5 states. [2019-12-27 14:23:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:59,267 INFO L93 Difference]: Finished difference Result 3175 states and 7725 transitions. [2019-12-27 14:23:59,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 14:23:59,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-27 14:23:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:59,271 INFO L225 Difference]: With dead ends: 3175 [2019-12-27 14:23:59,272 INFO L226 Difference]: Without dead ends: 2657 [2019-12-27 14:23:59,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:23:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2657 states. [2019-12-27 14:23:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2657 to 2500. [2019-12-27 14:23:59,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2019-12-27 14:23:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 6046 transitions. [2019-12-27 14:23:59,308 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 6046 transitions. Word has length 80 [2019-12-27 14:23:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:59,309 INFO L462 AbstractCegarLoop]: Abstraction has 2500 states and 6046 transitions. [2019-12-27 14:23:59,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:23:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 6046 transitions. [2019-12-27 14:23:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:23:59,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:59,312 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] [2019-12-27 14:23:59,313 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:59,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash -972148400, now seen corresponding path program 1 times [2019-12-27 14:23:59,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:59,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461763148] [2019-12-27 14:23:59,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:59,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461763148] [2019-12-27 14:23:59,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:59,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:23:59,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725481362] [2019-12-27 14:23:59,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:23:59,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:59,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:23:59,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:23:59,376 INFO L87 Difference]: Start difference. First operand 2500 states and 6046 transitions. Second operand 5 states. [2019-12-27 14:23:59,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:59,610 INFO L93 Difference]: Finished difference Result 2838 states and 6804 transitions. [2019-12-27 14:23:59,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:23:59,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-12-27 14:23:59,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:59,615 INFO L225 Difference]: With dead ends: 2838 [2019-12-27 14:23:59,615 INFO L226 Difference]: Without dead ends: 2838 [2019-12-27 14:23:59,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:23:59,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2019-12-27 14:23:59,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2578. [2019-12-27 14:23:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2019-12-27 14:23:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 6210 transitions. [2019-12-27 14:23:59,641 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 6210 transitions. Word has length 92 [2019-12-27 14:23:59,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:59,641 INFO L462 AbstractCegarLoop]: Abstraction has 2578 states and 6210 transitions. [2019-12-27 14:23:59,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:23:59,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 6210 transitions. [2019-12-27 14:23:59,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:23:59,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:59,646 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] [2019-12-27 14:23:59,647 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:59,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:59,647 INFO L82 PathProgramCache]: Analyzing trace with hash 38995794, now seen corresponding path program 1 times [2019-12-27 14:23:59,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:59,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218985071] [2019-12-27 14:23:59,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:59,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218985071] [2019-12-27 14:23:59,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:59,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:23:59,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786525567] [2019-12-27 14:23:59,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:23:59,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:59,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:23:59,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:23:59,788 INFO L87 Difference]: Start difference. First operand 2578 states and 6210 transitions. Second operand 7 states. [2019-12-27 14:24:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:00,182 INFO L93 Difference]: Finished difference Result 2374 states and 5670 transitions. [2019-12-27 14:24:00,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:24:00,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-27 14:24:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:00,187 INFO L225 Difference]: With dead ends: 2374 [2019-12-27 14:24:00,187 INFO L226 Difference]: Without dead ends: 2374 [2019-12-27 14:24:00,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-27 14:24:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2019-12-27 14:24:00,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 2305. [2019-12-27 14:24:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2019-12-27 14:24:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 5525 transitions. [2019-12-27 14:24:00,210 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 5525 transitions. Word has length 92 [2019-12-27 14:24:00,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:00,210 INFO L462 AbstractCegarLoop]: Abstraction has 2305 states and 5525 transitions. [2019-12-27 14:24:00,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:24:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 5525 transitions. [2019-12-27 14:24:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:24:00,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:00,212 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] [2019-12-27 14:24:00,212 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:00,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:00,212 INFO L82 PathProgramCache]: Analyzing trace with hash -869143036, now seen corresponding path program 1 times [2019-12-27 14:24:00,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:00,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573697337] [2019-12-27 14:24:00,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:00,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573697337] [2019-12-27 14:24:00,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:00,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:24:00,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023440639] [2019-12-27 14:24:00,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:24:00,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:00,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:24:00,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:24:00,327 INFO L87 Difference]: Start difference. First operand 2305 states and 5525 transitions. Second operand 6 states. [2019-12-27 14:24:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:00,434 INFO L93 Difference]: Finished difference Result 2566 states and 6034 transitions. [2019-12-27 14:24:00,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 14:24:00,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-27 14:24:00,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:00,439 INFO L225 Difference]: With dead ends: 2566 [2019-12-27 14:24:00,440 INFO L226 Difference]: Without dead ends: 2538 [2019-12-27 14:24:00,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:24:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2019-12-27 14:24:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2332. [2019-12-27 14:24:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2332 states. [2019-12-27 14:24:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 5556 transitions. [2019-12-27 14:24:00,482 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 5556 transitions. Word has length 92 [2019-12-27 14:24:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:00,483 INFO L462 AbstractCegarLoop]: Abstraction has 2332 states and 5556 transitions. [2019-12-27 14:24:00,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:24:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 5556 transitions. [2019-12-27 14:24:00,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:24:00,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:00,486 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] [2019-12-27 14:24:00,486 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:00,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:00,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1404367329, now seen corresponding path program 1 times [2019-12-27 14:24:00,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:00,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197405128] [2019-12-27 14:24:00,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:00,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197405128] [2019-12-27 14:24:00,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:00,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:24:00,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763483597] [2019-12-27 14:24:00,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:24:00,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:00,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:24:00,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:24:00,806 INFO L87 Difference]: Start difference. First operand 2332 states and 5556 transitions. Second operand 6 states. [2019-12-27 14:24:01,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:01,080 INFO L93 Difference]: Finished difference Result 4292 states and 10403 transitions. [2019-12-27 14:24:01,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 14:24:01,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-27 14:24:01,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:01,087 INFO L225 Difference]: With dead ends: 4292 [2019-12-27 14:24:01,088 INFO L226 Difference]: Without dead ends: 4292 [2019-12-27 14:24:01,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:24:01,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2019-12-27 14:24:01,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 2347. [2019-12-27 14:24:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2347 states. [2019-12-27 14:24:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 5591 transitions. [2019-12-27 14:24:01,119 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 5591 transitions. Word has length 92 [2019-12-27 14:24:01,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:01,119 INFO L462 AbstractCegarLoop]: Abstraction has 2347 states and 5591 transitions. [2019-12-27 14:24:01,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:24:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 5591 transitions. [2019-12-27 14:24:01,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:24:01,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:01,121 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] [2019-12-27 14:24:01,121 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:01,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:01,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1528440576, now seen corresponding path program 1 times [2019-12-27 14:24:01,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:01,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532467828] [2019-12-27 14:24:01,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:01,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532467828] [2019-12-27 14:24:01,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:01,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:24:01,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170869038] [2019-12-27 14:24:01,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:24:01,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:01,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:24:01,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:24:01,237 INFO L87 Difference]: Start difference. First operand 2347 states and 5591 transitions. Second operand 7 states. [2019-12-27 14:24:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:01,691 INFO L93 Difference]: Finished difference Result 3281 states and 7693 transitions. [2019-12-27 14:24:01,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 14:24:01,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-27 14:24:01,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:01,697 INFO L225 Difference]: With dead ends: 3281 [2019-12-27 14:24:01,697 INFO L226 Difference]: Without dead ends: 3245 [2019-12-27 14:24:01,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 14:24:01,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2019-12-27 14:24:01,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 2665. [2019-12-27 14:24:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2665 states. [2019-12-27 14:24:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 6299 transitions. [2019-12-27 14:24:01,726 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 6299 transitions. Word has length 92 [2019-12-27 14:24:01,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:01,726 INFO L462 AbstractCegarLoop]: Abstraction has 2665 states and 6299 transitions. [2019-12-27 14:24:01,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:24:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 6299 transitions. [2019-12-27 14:24:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:24:01,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:01,728 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] [2019-12-27 14:24:01,729 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:01,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:01,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1245290112, now seen corresponding path program 1 times [2019-12-27 14:24:01,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:01,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194397083] [2019-12-27 14:24:01,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:01,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194397083] [2019-12-27 14:24:01,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:01,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:24:01,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118716179] [2019-12-27 14:24:01,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:24:01,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:01,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:24:01,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:24:01,812 INFO L87 Difference]: Start difference. First operand 2665 states and 6299 transitions. Second operand 7 states. [2019-12-27 14:24:02,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:02,146 INFO L93 Difference]: Finished difference Result 3529 states and 8309 transitions. [2019-12-27 14:24:02,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:24:02,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-27 14:24:02,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:02,152 INFO L225 Difference]: With dead ends: 3529 [2019-12-27 14:24:02,152 INFO L226 Difference]: Without dead ends: 3529 [2019-12-27 14:24:02,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 14:24:02,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3529 states. [2019-12-27 14:24:02,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3529 to 2901. [2019-12-27 14:24:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2901 states. [2019-12-27 14:24:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 6889 transitions. [2019-12-27 14:24:02,203 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 6889 transitions. Word has length 92 [2019-12-27 14:24:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:02,204 INFO L462 AbstractCegarLoop]: Abstraction has 2901 states and 6889 transitions. [2019-12-27 14:24:02,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:24:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 6889 transitions. [2019-12-27 14:24:02,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:24:02,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:02,210 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] [2019-12-27 14:24:02,210 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:02,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:02,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1804912703, now seen corresponding path program 1 times [2019-12-27 14:24:02,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:02,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430553753] [2019-12-27 14:24:02,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:02,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:02,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430553753] [2019-12-27 14:24:02,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:02,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:24:02,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934784283] [2019-12-27 14:24:02,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:24:02,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:02,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:24:02,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:24:02,285 INFO L87 Difference]: Start difference. First operand 2901 states and 6889 transitions. Second operand 3 states. [2019-12-27 14:24:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:02,377 INFO L93 Difference]: Finished difference Result 2739 states and 6403 transitions. [2019-12-27 14:24:02,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:24:02,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-12-27 14:24:02,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:02,383 INFO L225 Difference]: With dead ends: 2739 [2019-12-27 14:24:02,383 INFO L226 Difference]: Without dead ends: 2721 [2019-12-27 14:24:02,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:24:02,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2019-12-27 14:24:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 2335. [2019-12-27 14:24:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2335 states. [2019-12-27 14:24:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 5471 transitions. [2019-12-27 14:24:02,430 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 5471 transitions. Word has length 92 [2019-12-27 14:24:02,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:02,431 INFO L462 AbstractCegarLoop]: Abstraction has 2335 states and 5471 transitions. [2019-12-27 14:24:02,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:24:02,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 5471 transitions. [2019-12-27 14:24:02,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:24:02,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:02,436 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-27 14:24:02,436 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:02,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:02,437 INFO L82 PathProgramCache]: Analyzing trace with hash -436198428, now seen corresponding path program 1 times [2019-12-27 14:24:02,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:02,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259528752] [2019-12-27 14:24:02,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:02,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259528752] [2019-12-27 14:24:02,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:02,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:24:02,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517060343] [2019-12-27 14:24:02,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:24:02,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:02,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:24:02,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:24:02,576 INFO L87 Difference]: Start difference. First operand 2335 states and 5471 transitions. Second operand 6 states. [2019-12-27 14:24:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:02,780 INFO L93 Difference]: Finished difference Result 2575 states and 5940 transitions. [2019-12-27 14:24:02,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 14:24:02,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 14:24:02,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:02,786 INFO L225 Difference]: With dead ends: 2575 [2019-12-27 14:24:02,786 INFO L226 Difference]: Without dead ends: 2575 [2019-12-27 14:24:02,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 14:24:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-12-27 14:24:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2395. [2019-12-27 14:24:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2395 states. [2019-12-27 14:24:02,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 5582 transitions. [2019-12-27 14:24:02,835 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 5582 transitions. Word has length 94 [2019-12-27 14:24:02,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:02,836 INFO L462 AbstractCegarLoop]: Abstraction has 2395 states and 5582 transitions. [2019-12-27 14:24:02,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:24:02,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 5582 transitions. [2019-12-27 14:24:02,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:24:02,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:02,841 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-27 14:24:02,841 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:02,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:02,841 INFO L82 PathProgramCache]: Analyzing trace with hash -106432667, now seen corresponding path program 1 times [2019-12-27 14:24:02,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:02,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901415536] [2019-12-27 14:24:02,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:02,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901415536] [2019-12-27 14:24:02,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:02,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:24:02,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695748774] [2019-12-27 14:24:02,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:24:02,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:02,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:24:02,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:24:02,914 INFO L87 Difference]: Start difference. First operand 2395 states and 5582 transitions. Second operand 4 states. [2019-12-27 14:24:03,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:03,029 INFO L93 Difference]: Finished difference Result 2395 states and 5546 transitions. [2019-12-27 14:24:03,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:24:03,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-27 14:24:03,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:03,034 INFO L225 Difference]: With dead ends: 2395 [2019-12-27 14:24:03,035 INFO L226 Difference]: Without dead ends: 2395 [2019-12-27 14:24:03,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-27 14:24:03,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2019-12-27 14:24:03,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 1922. [2019-12-27 14:24:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2019-12-27 14:24:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 4532 transitions. [2019-12-27 14:24:03,078 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 4532 transitions. Word has length 94 [2019-12-27 14:24:03,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:03,079 INFO L462 AbstractCegarLoop]: Abstraction has 1922 states and 4532 transitions. [2019-12-27 14:24:03,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:24:03,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 4532 transitions. [2019-12-27 14:24:03,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:24:03,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:03,083 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-27 14:24:03,083 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:03,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:03,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1154922491, now seen corresponding path program 1 times [2019-12-27 14:24:03,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:03,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685307209] [2019-12-27 14:24:03,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:03,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685307209] [2019-12-27 14:24:03,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:03,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:24:03,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591712940] [2019-12-27 14:24:03,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:24:03,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:03,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:24:03,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:24:03,186 INFO L87 Difference]: Start difference. First operand 1922 states and 4532 transitions. Second operand 5 states. [2019-12-27 14:24:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:03,466 INFO L93 Difference]: Finished difference Result 2174 states and 5111 transitions. [2019-12-27 14:24:03,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 14:24:03,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-27 14:24:03,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:03,471 INFO L225 Difference]: With dead ends: 2174 [2019-12-27 14:24:03,472 INFO L226 Difference]: Without dead ends: 2156 [2019-12-27 14:24:03,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-27 14:24:03,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2019-12-27 14:24:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 1949. [2019-12-27 14:24:03,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-12-27 14:24:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 4586 transitions. [2019-12-27 14:24:03,515 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 4586 transitions. Word has length 94 [2019-12-27 14:24:03,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:03,515 INFO L462 AbstractCegarLoop]: Abstraction has 1949 states and 4586 transitions. [2019-12-27 14:24:03,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:24:03,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 4586 transitions. [2019-12-27 14:24:03,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:24:03,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:03,520 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-27 14:24:03,520 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:03,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:03,520 INFO L82 PathProgramCache]: Analyzing trace with hash 89841990, now seen corresponding path program 1 times [2019-12-27 14:24:03,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:03,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746158601] [2019-12-27 14:24:03,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:03,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746158601] [2019-12-27 14:24:03,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:03,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:24:03,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680427911] [2019-12-27 14:24:03,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:24:03,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:03,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:24:03,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:24:03,652 INFO L87 Difference]: Start difference. First operand 1949 states and 4586 transitions. Second operand 6 states. [2019-12-27 14:24:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:03,755 INFO L93 Difference]: Finished difference Result 3109 states and 7432 transitions. [2019-12-27 14:24:03,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 14:24:03,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 14:24:03,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:03,758 INFO L225 Difference]: With dead ends: 3109 [2019-12-27 14:24:03,759 INFO L226 Difference]: Without dead ends: 1229 [2019-12-27 14:24:03,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 14:24:03,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2019-12-27 14:24:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1229. [2019-12-27 14:24:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2019-12-27 14:24:03,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 2953 transitions. [2019-12-27 14:24:03,788 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 2953 transitions. Word has length 94 [2019-12-27 14:24:03,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:03,788 INFO L462 AbstractCegarLoop]: Abstraction has 1229 states and 2953 transitions. [2019-12-27 14:24:03,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:24:03,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 2953 transitions. [2019-12-27 14:24:03,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:24:03,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:03,790 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-27 14:24:03,790 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:03,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:03,791 INFO L82 PathProgramCache]: Analyzing trace with hash 373162808, now seen corresponding path program 1 times [2019-12-27 14:24:03,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:03,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33696494] [2019-12-27 14:24:03,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:03,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33696494] [2019-12-27 14:24:03,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:03,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:24:03,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94817362] [2019-12-27 14:24:03,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:24:03,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:03,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:24:03,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:24:03,854 INFO L87 Difference]: Start difference. First operand 1229 states and 2953 transitions. Second operand 5 states. [2019-12-27 14:24:04,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:04,270 INFO L93 Difference]: Finished difference Result 3090 states and 7647 transitions. [2019-12-27 14:24:04,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 14:24:04,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-27 14:24:04,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:04,275 INFO L225 Difference]: With dead ends: 3090 [2019-12-27 14:24:04,275 INFO L226 Difference]: Without dead ends: 3090 [2019-12-27 14:24:04,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:24:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2019-12-27 14:24:04,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 1221. [2019-12-27 14:24:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-12-27 14:24:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 2937 transitions. [2019-12-27 14:24:04,299 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 2937 transitions. Word has length 94 [2019-12-27 14:24:04,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:04,299 INFO L462 AbstractCegarLoop]: Abstraction has 1221 states and 2937 transitions. [2019-12-27 14:24:04,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:24:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 2937 transitions. [2019-12-27 14:24:04,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:24:04,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:04,301 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-27 14:24:04,301 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:04,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:04,301 INFO L82 PathProgramCache]: Analyzing trace with hash 104916029, now seen corresponding path program 1 times [2019-12-27 14:24:04,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:04,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583738523] [2019-12-27 14:24:04,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:04,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583738523] [2019-12-27 14:24:04,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:04,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:24:04,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676751299] [2019-12-27 14:24:04,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:24:04,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:04,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:24:04,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:24:04,386 INFO L87 Difference]: Start difference. First operand 1221 states and 2937 transitions. Second operand 5 states. [2019-12-27 14:24:04,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:04,422 INFO L93 Difference]: Finished difference Result 1221 states and 2902 transitions. [2019-12-27 14:24:04,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:24:04,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-27 14:24:04,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:04,425 INFO L225 Difference]: With dead ends: 1221 [2019-12-27 14:24:04,425 INFO L226 Difference]: Without dead ends: 1221 [2019-12-27 14:24:04,425 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-27 14:24:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-12-27 14:24:04,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1181. [2019-12-27 14:24:04,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2019-12-27 14:24:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 2826 transitions. [2019-12-27 14:24:04,441 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 2826 transitions. Word has length 94 [2019-12-27 14:24:04,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:04,442 INFO L462 AbstractCegarLoop]: Abstraction has 1181 states and 2826 transitions. [2019-12-27 14:24:04,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:24:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 2826 transitions. [2019-12-27 14:24:04,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:24:04,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:04,444 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-27 14:24:04,444 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:04,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:04,444 INFO L82 PathProgramCache]: Analyzing trace with hash -919777892, now seen corresponding path program 2 times [2019-12-27 14:24:04,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:04,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754333747] [2019-12-27 14:24:04,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:04,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754333747] [2019-12-27 14:24:04,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:04,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 14:24:04,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339932691] [2019-12-27 14:24:04,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 14:24:04,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:04,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 14:24:04,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-27 14:24:04,577 INFO L87 Difference]: Start difference. First operand 1181 states and 2826 transitions. Second operand 11 states. [2019-12-27 14:24:04,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:04,822 INFO L93 Difference]: Finished difference Result 2271 states and 5486 transitions. [2019-12-27 14:24:04,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 14:24:04,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-12-27 14:24:04,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:04,827 INFO L225 Difference]: With dead ends: 2271 [2019-12-27 14:24:04,827 INFO L226 Difference]: Without dead ends: 1632 [2019-12-27 14:24:04,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-27 14:24:04,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2019-12-27 14:24:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1534. [2019-12-27 14:24:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1534 states. [2019-12-27 14:24:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 3570 transitions. [2019-12-27 14:24:04,851 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 3570 transitions. Word has length 94 [2019-12-27 14:24:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:04,852 INFO L462 AbstractCegarLoop]: Abstraction has 1534 states and 3570 transitions. [2019-12-27 14:24:04,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 14:24:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 3570 transitions. [2019-12-27 14:24:04,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:24:04,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:04,855 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-27 14:24:04,855 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:04,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:04,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1370490878, now seen corresponding path program 3 times [2019-12-27 14:24:04,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:04,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326876424] [2019-12-27 14:24:04,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 14:24:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 14:24:05,000 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 14:24:05,000 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 14:24:05,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:24:05 BasicIcfg [2019-12-27 14:24:05,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 14:24:05,248 INFO L168 Benchmark]: Toolchain (without parser) took 58017.26 ms. Allocated memory was 145.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 102.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 14:24:05,248 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 14:24:05,249 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.91 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.9 MB in the beginning and 157.3 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 14:24:05,249 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.82 ms. Allocated memory is still 202.9 MB. Free memory was 157.3 MB in the beginning and 154.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 14:24:05,250 INFO L168 Benchmark]: Boogie Preprocessor took 36.10 ms. Allocated memory is still 202.9 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 14:24:05,250 INFO L168 Benchmark]: RCFGBuilder took 770.23 ms. Allocated memory is still 202.9 MB. Free memory was 151.9 MB in the beginning and 107.7 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-27 14:24:05,251 INFO L168 Benchmark]: TraceAbstraction took 56400.72 ms. Allocated memory was 202.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 107.7 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 14:24:05,254 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 733.91 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.9 MB in the beginning and 157.3 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.82 ms. Allocated memory is still 202.9 MB. Free memory was 157.3 MB in the beginning and 154.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.10 ms. Allocated memory is still 202.9 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 770.23 ms. Allocated memory is still 202.9 MB. Free memory was 151.9 MB in the beginning and 107.7 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 56400.72 ms. Allocated memory was 202.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 107.7 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.5 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] [L695] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L696] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L698] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L699] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L700] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L701] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L702] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L703] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L704] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L705] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L706] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L707] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L708] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L709] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L710] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L711] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L712] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L715] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L716] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 0 pthread_t t2475; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 0 pthread_t t2476; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 2 x$w_buff1 = x$w_buff0 [L741] 2 x$w_buff0 = 2 [L742] 2 x$w_buff1_used = x$w_buff0_used [L743] 2 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 y = 2 [L723] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L755] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=2] [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=2] [L726] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L727] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L728] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L733] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L756] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L757] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L758] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L786] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L797] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L798] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L799] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L802] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 x = x$flush_delayed ? x$mem_tmp : x [L805] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 56.0s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9037 SDtfs, 8844 SDslu, 19471 SDs, 0 SdLazy, 8462 SolverSat, 541 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 106 SyntacticMatches, 23 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76077occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.6s AutomataMinimizationTime, 36 MinimizatonAttempts, 97598 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2888 NumberOfCodeBlocks, 2888 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2758 ConstructedInterpolants, 0 QuantifiedInterpolants, 514060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...