/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 10:29:01,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 10:29:01,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 10:29:01,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 10:29:01,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 10:29:01,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 10:29:01,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 10:29:01,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 10:29:01,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 10:29:01,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 10:29:01,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 10:29:01,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 10:29:01,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 10:29:01,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 10:29:01,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 10:29:01,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 10:29:01,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 10:29:01,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 10:29:01,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 10:29:01,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 10:29:01,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 10:29:01,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 10:29:01,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 10:29:01,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 10:29:01,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 10:29:01,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 10:29:01,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 10:29:01,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 10:29:01,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 10:29:01,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 10:29:01,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 10:29:01,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 10:29:01,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 10:29:01,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 10:29:01,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 10:29:01,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 10:29:01,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 10:29:01,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 10:29:01,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 10:29:01,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 10:29:01,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 10:29:01,252 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-Separate.epf [2021-06-05 10:29:01,288 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 10:29:01,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 10:29:01,288 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 10:29:01,289 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 10:29:01,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 10:29:01,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 10:29:01,291 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 10:29:01,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 10:29:01,292 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 10:29:01,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 10:29:01,292 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 10:29:01,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 10:29:01,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 10:29:01,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 10:29:01,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 10:29:01,293 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 10:29:01,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 10:29:01,293 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 10:29:01,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 10:29:01,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 10:29:01,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 10:29:01,294 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 10:29:01,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 10:29:01,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 10:29:01,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 10:29:01,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 10:29:01,294 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 10:29:01,294 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 10:29:01,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 10:29:01,295 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 10:29:01,295 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 10:29:01,295 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 10:29:01,295 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 10:29:01,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 10:29:01,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 10:29:01,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 10:29:01,674 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 10:29:01,678 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 10:29:01,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2021-06-05 10:29:01,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2085e2c4b/2a776ebcfd8b4e9b8a1570e54cab9851/FLAG7b5fca957 [2021-06-05 10:29:02,285 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 10:29:02,286 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2021-06-05 10:29:02,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2085e2c4b/2a776ebcfd8b4e9b8a1570e54cab9851/FLAG7b5fca957 [2021-06-05 10:29:02,752 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2085e2c4b/2a776ebcfd8b4e9b8a1570e54cab9851 [2021-06-05 10:29:02,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 10:29:02,755 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 10:29:02,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 10:29:02,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 10:29:02,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 10:29:02,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 10:29:02" (1/1) ... [2021-06-05 10:29:02,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41562939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:29:02, skipping insertion in model container [2021-06-05 10:29:02,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 10:29:02" (1/1) ... [2021-06-05 10:29:02,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 10:29:02,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 10:29:02,967 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-05 10:29:03,516 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2021-06-05 10:29:03,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 10:29:03,550 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 10:29:03,560 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-05 10:29:03,595 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2021-06-05 10:29:03,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 10:29:03,912 INFO L208 MainTranslator]: Completed translation [2021-06-05 10:29:03,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:29:03 WrapperNode [2021-06-05 10:29:03,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 10:29:03,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 10:29:03,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 10:29:03,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 10:29:03,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:29:03" (1/1) ... [2021-06-05 10:29:03,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:29:03" (1/1) ... [2021-06-05 10:29:03,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 10:29:03,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 10:29:03,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 10:29:03,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 10:29:03,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:29:03" (1/1) ... [2021-06-05 10:29:03,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:29:03" (1/1) ... [2021-06-05 10:29:04,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:29:03" (1/1) ... [2021-06-05 10:29:04,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:29:03" (1/1) ... [2021-06-05 10:29:04,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:29:03" (1/1) ... [2021-06-05 10:29:04,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:29:03" (1/1) ... [2021-06-05 10:29:04,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:29:03" (1/1) ... [2021-06-05 10:29:04,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 10:29:04,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 10:29:04,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 10:29:04,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 10:29:04,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:29:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 10:29:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 10:29:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 10:29:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 10:29:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 10:29:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-06-05 10:29:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 10:29:04,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 10:29:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-06-05 10:29:04,097 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-06-05 10:29:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 10:29:04,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 10:29:04,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 10:29:04,099 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 10:29:04,674 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 10:29:04,674 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-06-05 10:29:04,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:29:04 BoogieIcfgContainer [2021-06-05 10:29:04,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 10:29:04,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 10:29:04,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 10:29:04,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 10:29:04,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 10:29:02" (1/3) ... [2021-06-05 10:29:04,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff7734c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:29:04, skipping insertion in model container [2021-06-05 10:29:04,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:29:03" (2/3) ... [2021-06-05 10:29:04,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff7734c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:29:04, skipping insertion in model container [2021-06-05 10:29:04,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:29:04" (3/3) ... [2021-06-05 10:29:04,682 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2021-06-05 10:29:04,687 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 10:29:04,687 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 10:29:04,687 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-06-05 10:29:04,688 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 10:29:04,727 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,727 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,728 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,728 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,728 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,728 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,728 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,728 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,728 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,729 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,729 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,729 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,730 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,730 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,730 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,730 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,730 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,730 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,730 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,730 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,731 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,731 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,731 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,731 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,731 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,731 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,732 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,732 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,732 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,732 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,733 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,733 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,733 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,733 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,733 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,733 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,734 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,734 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,734 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,734 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,734 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,734 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,735 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,735 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,735 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,735 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,735 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,735 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,735 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,736 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,736 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,736 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,736 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,736 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,736 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,736 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,737 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,737 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,737 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,737 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,737 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,737 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,738 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,738 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,738 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,738 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,738 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,738 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,738 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,738 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,739 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,739 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,740 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,740 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,740 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,740 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,740 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,740 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,741 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,741 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,741 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,741 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,741 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,741 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,741 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,742 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,742 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,742 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,742 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,742 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,743 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,743 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,745 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,746 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,746 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,747 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,749 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,749 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,750 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,750 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,754 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,754 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,756 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,757 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,757 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,757 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,757 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,757 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,757 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,757 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,758 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,758 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:29:04,770 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-05 10:29:04,790 INFO L255 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-06-05 10:29:04,815 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 10:29:04,815 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 10:29:04,815 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 10:29:04,815 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 10:29:04,816 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 10:29:04,816 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 10:29:04,816 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 10:29:04,816 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 10:29:04,833 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158 places, 162 transitions, 346 flow [2021-06-05 10:29:04,997 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4278 states, 4267 states have (on average 2.7492383407546286) internal successors, (11731), 4277 states have internal predecessors, (11731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:05,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 4278 states, 4267 states have (on average 2.7492383407546286) internal successors, (11731), 4277 states have internal predecessors, (11731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-06-05 10:29:05,016 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:05,016 INFO L521 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] [2021-06-05 10:29:05,017 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:05,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:05,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1369970770, now seen corresponding path program 1 times [2021-06-05 10:29:05,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:05,032 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323834949] [2021-06-05 10:29:05,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:05,441 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:05,442 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323834949] [2021-06-05 10:29:05,442 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323834949] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:05,442 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:05,443 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:29:05,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37554919] [2021-06-05 10:29:05,448 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:29:05,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:05,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:29:05,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:29:05,474 INFO L87 Difference]: Start difference. First operand has 4278 states, 4267 states have (on average 2.7492383407546286) internal successors, (11731), 4277 states have internal predecessors, (11731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:05,733 INFO L93 Difference]: Finished difference Result 4075 states and 10961 transitions. [2021-06-05 10:29:05,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:29:05,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-06-05 10:29:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:05,761 INFO L225 Difference]: With dead ends: 4075 [2021-06-05 10:29:05,761 INFO L226 Difference]: Without dead ends: 3358 [2021-06-05 10:29:05,762 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 84.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:29:05,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3358 states. [2021-06-05 10:29:05,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3358 to 3357. [2021-06-05 10:29:05,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 3350 states have (on average 2.681492537313433) internal successors, (8983), 3356 states have internal predecessors, (8983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 8983 transitions. [2021-06-05 10:29:05,943 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 8983 transitions. Word has length 36 [2021-06-05 10:29:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:05,943 INFO L482 AbstractCegarLoop]: Abstraction has 3357 states and 8983 transitions. [2021-06-05 10:29:05,944 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 8983 transitions. [2021-06-05 10:29:05,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 10:29:05,945 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:05,945 INFO L521 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] [2021-06-05 10:29:05,945 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 10:29:05,945 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:05,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:05,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1499060535, now seen corresponding path program 1 times [2021-06-05 10:29:05,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:05,946 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858353339] [2021-06-05 10:29:05,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:06,048 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:06,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858353339] [2021-06-05 10:29:06,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858353339] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:06,049 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:06,049 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:29:06,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174519725] [2021-06-05 10:29:06,050 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:29:06,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:06,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:29:06,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:29:06,051 INFO L87 Difference]: Start difference. First operand 3357 states and 8983 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:06,248 INFO L93 Difference]: Finished difference Result 3359 states and 8985 transitions. [2021-06-05 10:29:06,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 10:29:06,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-06-05 10:29:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:06,267 INFO L225 Difference]: With dead ends: 3359 [2021-06-05 10:29:06,268 INFO L226 Difference]: Without dead ends: 3359 [2021-06-05 10:29:06,269 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 56.6ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 10:29:06,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2021-06-05 10:29:06,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 3355. [2021-06-05 10:29:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3355 states, 3349 states have (on average 2.6816960286652733) internal successors, (8981), 3354 states have internal predecessors, (8981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 8981 transitions. [2021-06-05 10:29:06,364 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 8981 transitions. Word has length 42 [2021-06-05 10:29:06,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:06,365 INFO L482 AbstractCegarLoop]: Abstraction has 3355 states and 8981 transitions. [2021-06-05 10:29:06,365 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 8981 transitions. [2021-06-05 10:29:06,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 10:29:06,368 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:06,369 INFO L521 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] [2021-06-05 10:29:06,369 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 10:29:06,369 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:06,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:06,376 INFO L82 PathProgramCache]: Analyzing trace with hash 709377487, now seen corresponding path program 1 times [2021-06-05 10:29:06,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:06,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122283775] [2021-06-05 10:29:06,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:06,524 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:06,524 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122283775] [2021-06-05 10:29:06,524 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122283775] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:06,525 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:06,525 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:29:06,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949867543] [2021-06-05 10:29:06,525 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:29:06,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:06,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:29:06,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:29:06,526 INFO L87 Difference]: Start difference. First operand 3355 states and 8981 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:06,806 INFO L93 Difference]: Finished difference Result 4878 states and 13059 transitions. [2021-06-05 10:29:06,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 10:29:06,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-05 10:29:06,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:06,830 INFO L225 Difference]: With dead ends: 4878 [2021-06-05 10:29:06,830 INFO L226 Difference]: Without dead ends: 4878 [2021-06-05 10:29:06,831 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 100.0ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-06-05 10:29:06,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2021-06-05 10:29:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 3753. [2021-06-05 10:29:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3753 states, 3748 states have (on average 2.683831376734258) internal successors, (10059), 3752 states have internal predecessors, (10059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 10059 transitions. [2021-06-05 10:29:06,943 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 10059 transitions. Word has length 60 [2021-06-05 10:29:06,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:06,945 INFO L482 AbstractCegarLoop]: Abstraction has 3753 states and 10059 transitions. [2021-06-05 10:29:06,945 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:06,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 10059 transitions. [2021-06-05 10:29:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 10:29:06,952 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:06,952 INFO L521 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] [2021-06-05 10:29:06,953 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 10:29:06,953 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:06,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:06,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1924610094, now seen corresponding path program 1 times [2021-06-05 10:29:06,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:06,954 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479061335] [2021-06-05 10:29:06,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:07,082 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:07,082 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479061335] [2021-06-05 10:29:07,082 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479061335] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:07,083 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:07,083 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:29:07,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76329647] [2021-06-05 10:29:07,083 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:29:07,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:07,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:29:07,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:29:07,087 INFO L87 Difference]: Start difference. First operand 3753 states and 10059 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:07,330 INFO L93 Difference]: Finished difference Result 5276 states and 14062 transitions. [2021-06-05 10:29:07,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 10:29:07,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-05 10:29:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:07,349 INFO L225 Difference]: With dead ends: 5276 [2021-06-05 10:29:07,350 INFO L226 Difference]: Without dead ends: 4475 [2021-06-05 10:29:07,350 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 69.0ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 10:29:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4475 states. [2021-06-05 10:29:07,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4475 to 4325. [2021-06-05 10:29:07,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4325 states, 4321 states have (on average 2.6931265910668825) internal successors, (11637), 4324 states have internal predecessors, (11637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 11637 transitions. [2021-06-05 10:29:07,512 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 11637 transitions. Word has length 66 [2021-06-05 10:29:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:07,514 INFO L482 AbstractCegarLoop]: Abstraction has 4325 states and 11637 transitions. [2021-06-05 10:29:07,514 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 11637 transitions. [2021-06-05 10:29:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-05 10:29:07,519 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:07,520 INFO L521 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] [2021-06-05 10:29:07,520 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 10:29:07,520 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:07,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:07,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1721881747, now seen corresponding path program 1 times [2021-06-05 10:29:07,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:07,521 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224638585] [2021-06-05 10:29:07,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:07,625 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:07,625 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224638585] [2021-06-05 10:29:07,625 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224638585] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:07,625 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:07,625 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 10:29:07,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849696658] [2021-06-05 10:29:07,626 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 10:29:07,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:07,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 10:29:07,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 10:29:07,627 INFO L87 Difference]: Start difference. First operand 4325 states and 11637 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:07,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:07,658 INFO L93 Difference]: Finished difference Result 1631 states and 4196 transitions. [2021-06-05 10:29:07,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 10:29:07,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-06-05 10:29:07,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:07,665 INFO L225 Difference]: With dead ends: 1631 [2021-06-05 10:29:07,665 INFO L226 Difference]: Without dead ends: 1631 [2021-06-05 10:29:07,665 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 23.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-05 10:29:07,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2021-06-05 10:29:07,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2021-06-05 10:29:07,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 2.575813382443217) internal successors, (4196), 1630 states have internal predecessors, (4196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 4196 transitions. [2021-06-05 10:29:07,700 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 4196 transitions. Word has length 78 [2021-06-05 10:29:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:07,701 INFO L482 AbstractCegarLoop]: Abstraction has 1631 states and 4196 transitions. [2021-06-05 10:29:07,701 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:07,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 4196 transitions. [2021-06-05 10:29:07,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:07,704 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:07,704 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:07,705 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 10:29:07,705 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:07,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:07,705 INFO L82 PathProgramCache]: Analyzing trace with hash 648694468, now seen corresponding path program 1 times [2021-06-05 10:29:07,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:07,705 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542264740] [2021-06-05 10:29:07,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:08,337 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:08,337 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542264740] [2021-06-05 10:29:08,338 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542264740] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:08,338 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:08,338 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-06-05 10:29:08,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923505908] [2021-06-05 10:29:08,338 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 10:29:08,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:08,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 10:29:08,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-06-05 10:29:08,339 INFO L87 Difference]: Start difference. First operand 1631 states and 4196 transitions. Second operand has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 17 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:09,689 INFO L93 Difference]: Finished difference Result 1676 states and 4279 transitions. [2021-06-05 10:29:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 10:29:09,689 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 17 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:09,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:09,694 INFO L225 Difference]: With dead ends: 1676 [2021-06-05 10:29:09,694 INFO L226 Difference]: Without dead ends: 1676 [2021-06-05 10:29:09,695 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 999.6ms TimeCoverageRelationStatistics Valid=369, Invalid=1037, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 10:29:09,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2021-06-05 10:29:09,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1656. [2021-06-05 10:29:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1654 states have (on average 2.564087061668682) internal successors, (4241), 1655 states have internal predecessors, (4241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 4241 transitions. [2021-06-05 10:29:09,729 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 4241 transitions. Word has length 105 [2021-06-05 10:29:09,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:09,729 INFO L482 AbstractCegarLoop]: Abstraction has 1656 states and 4241 transitions. [2021-06-05 10:29:09,729 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 17 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 4241 transitions. [2021-06-05 10:29:09,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:09,732 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:09,733 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:09,733 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 10:29:09,733 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:09,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:09,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1294904632, now seen corresponding path program 1 times [2021-06-05 10:29:09,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:09,734 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925605280] [2021-06-05 10:29:09,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:10,355 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:10,355 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925605280] [2021-06-05 10:29:10,356 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925605280] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:10,356 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:10,356 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 10:29:10,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155670248] [2021-06-05 10:29:10,356 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 10:29:10,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:10,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 10:29:10,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:29:10,357 INFO L87 Difference]: Start difference. First operand 1656 states and 4241 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:11,965 INFO L93 Difference]: Finished difference Result 2238 states and 5466 transitions. [2021-06-05 10:29:11,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 10:29:11,966 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:11,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:11,971 INFO L225 Difference]: With dead ends: 2238 [2021-06-05 10:29:11,972 INFO L226 Difference]: Without dead ends: 2238 [2021-06-05 10:29:11,972 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1263.6ms TimeCoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:29:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2021-06-05 10:29:12,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2021. [2021-06-05 10:29:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2021 states, 2019 states have (on average 2.50222882615156) internal successors, (5052), 2020 states have internal predecessors, (5052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 5052 transitions. [2021-06-05 10:29:12,018 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 5052 transitions. Word has length 105 [2021-06-05 10:29:12,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:12,018 INFO L482 AbstractCegarLoop]: Abstraction has 2021 states and 5052 transitions. [2021-06-05 10:29:12,018 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 5052 transitions. [2021-06-05 10:29:12,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:12,023 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:12,023 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:12,023 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 10:29:12,023 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:12,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:12,024 INFO L82 PathProgramCache]: Analyzing trace with hash -564509166, now seen corresponding path program 2 times [2021-06-05 10:29:12,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:12,024 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733982501] [2021-06-05 10:29:12,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:12,688 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:12,688 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733982501] [2021-06-05 10:29:12,688 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733982501] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:12,688 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:12,688 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-05 10:29:12,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195450173] [2021-06-05 10:29:12,689 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 10:29:12,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:12,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 10:29:12,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2021-06-05 10:29:12,689 INFO L87 Difference]: Start difference. First operand 2021 states and 5052 transitions. Second operand has 21 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:15,659 INFO L93 Difference]: Finished difference Result 4296 states and 10687 transitions. [2021-06-05 10:29:15,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-05 10:29:15,659 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:15,667 INFO L225 Difference]: With dead ends: 4296 [2021-06-05 10:29:15,667 INFO L226 Difference]: Without dead ends: 4211 [2021-06-05 10:29:15,668 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2155.8ms TimeCoverageRelationStatistics Valid=913, Invalid=2993, Unknown=0, NotChecked=0, Total=3906 [2021-06-05 10:29:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4211 states. [2021-06-05 10:29:15,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4211 to 3403. [2021-06-05 10:29:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3403 states, 3401 states have (on average 2.5960011761246693) internal successors, (8829), 3402 states have internal predecessors, (8829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 8829 transitions. [2021-06-05 10:29:15,746 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 8829 transitions. Word has length 105 [2021-06-05 10:29:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:15,747 INFO L482 AbstractCegarLoop]: Abstraction has 3403 states and 8829 transitions. [2021-06-05 10:29:15,747 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 8829 transitions. [2021-06-05 10:29:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:15,755 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:15,755 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:15,755 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 10:29:15,755 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:15,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:15,756 INFO L82 PathProgramCache]: Analyzing trace with hash 659717812, now seen corresponding path program 2 times [2021-06-05 10:29:15,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:15,756 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882791460] [2021-06-05 10:29:15,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:16,089 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:16,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882791460] [2021-06-05 10:29:16,089 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882791460] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:16,089 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:16,089 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 10:29:16,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827121193] [2021-06-05 10:29:16,090 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 10:29:16,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:16,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 10:29:16,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-06-05 10:29:16,090 INFO L87 Difference]: Start difference. First operand 3403 states and 8829 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:16,725 INFO L93 Difference]: Finished difference Result 4878 states and 12398 transitions. [2021-06-05 10:29:16,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 10:29:16,726 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:16,734 INFO L225 Difference]: With dead ends: 4878 [2021-06-05 10:29:16,734 INFO L226 Difference]: Without dead ends: 4878 [2021-06-05 10:29:16,734 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 466.7ms TimeCoverageRelationStatistics Valid=213, Invalid=489, Unknown=0, NotChecked=0, Total=702 [2021-06-05 10:29:16,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2021-06-05 10:29:16,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 3569. [2021-06-05 10:29:16,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3569 states, 3567 states have (on average 2.5957387160078498) internal successors, (9259), 3568 states have internal predecessors, (9259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3569 states to 3569 states and 9259 transitions. [2021-06-05 10:29:16,809 INFO L78 Accepts]: Start accepts. Automaton has 3569 states and 9259 transitions. Word has length 105 [2021-06-05 10:29:16,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:16,809 INFO L482 AbstractCegarLoop]: Abstraction has 3569 states and 9259 transitions. [2021-06-05 10:29:16,809 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:16,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3569 states and 9259 transitions. [2021-06-05 10:29:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:16,816 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:16,816 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:16,817 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 10:29:16,817 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:16,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:16,817 INFO L82 PathProgramCache]: Analyzing trace with hash 205708624, now seen corresponding path program 3 times [2021-06-05 10:29:16,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:16,817 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531231815] [2021-06-05 10:29:16,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:17,150 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:17,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531231815] [2021-06-05 10:29:17,150 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531231815] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:17,150 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:17,151 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 10:29:17,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441579776] [2021-06-05 10:29:17,151 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 10:29:17,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:17,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 10:29:17,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 10:29:17,152 INFO L87 Difference]: Start difference. First operand 3569 states and 9259 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:17,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:17,847 INFO L93 Difference]: Finished difference Result 5217 states and 13022 transitions. [2021-06-05 10:29:17,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 10:29:17,848 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:17,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:17,856 INFO L225 Difference]: With dead ends: 5217 [2021-06-05 10:29:17,857 INFO L226 Difference]: Without dead ends: 5217 [2021-06-05 10:29:17,857 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 532.4ms TimeCoverageRelationStatistics Valid=232, Invalid=580, Unknown=0, NotChecked=0, Total=812 [2021-06-05 10:29:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5217 states. [2021-06-05 10:29:17,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5217 to 3593. [2021-06-05 10:29:17,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3593 states, 3591 states have (on average 2.596212754107491) internal successors, (9323), 3592 states have internal predecessors, (9323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 9323 transitions. [2021-06-05 10:29:17,930 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 9323 transitions. Word has length 105 [2021-06-05 10:29:17,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:17,931 INFO L482 AbstractCegarLoop]: Abstraction has 3593 states and 9323 transitions. [2021-06-05 10:29:17,931 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:17,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 9323 transitions. [2021-06-05 10:29:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:17,938 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:17,938 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:17,938 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 10:29:17,939 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:17,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:17,939 INFO L82 PathProgramCache]: Analyzing trace with hash 549020954, now seen corresponding path program 4 times [2021-06-05 10:29:17,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:17,939 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292419116] [2021-06-05 10:29:17,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:18,538 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:18,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292419116] [2021-06-05 10:29:18,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292419116] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:18,538 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:18,539 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 10:29:18,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013930793] [2021-06-05 10:29:18,539 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 10:29:18,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:18,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 10:29:18,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:29:18,540 INFO L87 Difference]: Start difference. First operand 3593 states and 9323 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:20,185 INFO L93 Difference]: Finished difference Result 4729 states and 11919 transitions. [2021-06-05 10:29:20,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 10:29:20,186 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:20,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:20,193 INFO L225 Difference]: With dead ends: 4729 [2021-06-05 10:29:20,193 INFO L226 Difference]: Without dead ends: 4729 [2021-06-05 10:29:20,194 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1503.5ms TimeCoverageRelationStatistics Valid=417, Invalid=1143, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 10:29:20,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4729 states. [2021-06-05 10:29:20,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4729 to 3653. [2021-06-05 10:29:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3653 states, 3651 states have (on average 2.5995617639003012) internal successors, (9491), 3652 states have internal predecessors, (9491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 9491 transitions. [2021-06-05 10:29:20,264 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 9491 transitions. Word has length 105 [2021-06-05 10:29:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:20,264 INFO L482 AbstractCegarLoop]: Abstraction has 3653 states and 9491 transitions. [2021-06-05 10:29:20,264 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 9491 transitions. [2021-06-05 10:29:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:20,271 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:20,271 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:20,271 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 10:29:20,271 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:20,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:20,272 INFO L82 PathProgramCache]: Analyzing trace with hash -845299678, now seen corresponding path program 5 times [2021-06-05 10:29:20,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:20,272 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315745852] [2021-06-05 10:29:20,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:20,667 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:20,667 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315745852] [2021-06-05 10:29:20,668 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315745852] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:20,668 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:20,668 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:20,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131267120] [2021-06-05 10:29:20,668 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:20,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:20,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:20,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:20,669 INFO L87 Difference]: Start difference. First operand 3653 states and 9491 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:21,860 INFO L93 Difference]: Finished difference Result 4795 states and 12232 transitions. [2021-06-05 10:29:21,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 10:29:21,860 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:21,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:21,867 INFO L225 Difference]: With dead ends: 4795 [2021-06-05 10:29:21,867 INFO L226 Difference]: Without dead ends: 4795 [2021-06-05 10:29:21,868 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 987.2ms TimeCoverageRelationStatistics Valid=279, Invalid=713, Unknown=0, NotChecked=0, Total=992 [2021-06-05 10:29:21,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2021-06-05 10:29:21,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 3848. [2021-06-05 10:29:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3848 states, 3846 states have (on average 2.6136245449817994) internal successors, (10052), 3847 states have internal predecessors, (10052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 10052 transitions. [2021-06-05 10:29:21,947 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 10052 transitions. Word has length 105 [2021-06-05 10:29:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:21,948 INFO L482 AbstractCegarLoop]: Abstraction has 3848 states and 10052 transitions. [2021-06-05 10:29:21,948 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 10052 transitions. [2021-06-05 10:29:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:21,955 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:21,955 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:21,955 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 10:29:21,956 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:21,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1381004282, now seen corresponding path program 6 times [2021-06-05 10:29:21,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:21,956 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865685243] [2021-06-05 10:29:21,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:22,387 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:22,387 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865685243] [2021-06-05 10:29:22,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865685243] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:22,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:22,387 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:22,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942832320] [2021-06-05 10:29:22,388 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:22,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:22,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:22,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:22,388 INFO L87 Difference]: Start difference. First operand 3848 states and 10052 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:23,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:23,782 INFO L93 Difference]: Finished difference Result 4572 states and 11662 transitions. [2021-06-05 10:29:23,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 10:29:23,785 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:23,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:23,791 INFO L225 Difference]: With dead ends: 4572 [2021-06-05 10:29:23,791 INFO L226 Difference]: Without dead ends: 4572 [2021-06-05 10:29:23,792 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1141.9ms TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 10:29:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4572 states. [2021-06-05 10:29:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4572 to 3850. [2021-06-05 10:29:23,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3850 states, 3848 states have (on average 2.6135654885654884) internal successors, (10057), 3849 states have internal predecessors, (10057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 10057 transitions. [2021-06-05 10:29:23,859 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 10057 transitions. Word has length 105 [2021-06-05 10:29:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:23,859 INFO L482 AbstractCegarLoop]: Abstraction has 3850 states and 10057 transitions. [2021-06-05 10:29:23,859 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 10057 transitions. [2021-06-05 10:29:23,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:23,866 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:23,867 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:23,867 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 10:29:23,867 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:23,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:23,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1036005680, now seen corresponding path program 7 times [2021-06-05 10:29:23,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:23,867 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501148113] [2021-06-05 10:29:23,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:24,141 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:24,141 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501148113] [2021-06-05 10:29:24,141 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501148113] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:24,141 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:24,141 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 10:29:24,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186141481] [2021-06-05 10:29:24,142 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 10:29:24,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:24,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 10:29:24,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 10:29:24,143 INFO L87 Difference]: Start difference. First operand 3850 states and 10057 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:24,874 INFO L93 Difference]: Finished difference Result 4263 states and 10873 transitions. [2021-06-05 10:29:24,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 10:29:24,875 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:24,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:24,879 INFO L225 Difference]: With dead ends: 4263 [2021-06-05 10:29:24,879 INFO L226 Difference]: Without dead ends: 4263 [2021-06-05 10:29:24,879 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 543.2ms TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2021-06-05 10:29:24,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2021-06-05 10:29:24,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 3846. [2021-06-05 10:29:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3846 states, 3844 states have (on average 2.6152445369406867) internal successors, (10053), 3845 states have internal predecessors, (10053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 10053 transitions. [2021-06-05 10:29:24,949 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 10053 transitions. Word has length 105 [2021-06-05 10:29:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:24,949 INFO L482 AbstractCegarLoop]: Abstraction has 3846 states and 10053 transitions. [2021-06-05 10:29:24,949 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 10053 transitions. [2021-06-05 10:29:24,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:24,960 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:24,960 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:24,960 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 10:29:24,960 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:24,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:24,960 INFO L82 PathProgramCache]: Analyzing trace with hash 419287134, now seen corresponding path program 8 times [2021-06-05 10:29:24,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:24,961 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544130226] [2021-06-05 10:29:24,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:25,334 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:25,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544130226] [2021-06-05 10:29:25,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544130226] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:25,334 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:25,334 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:25,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521477868] [2021-06-05 10:29:25,334 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:25,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:25,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:25,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:25,335 INFO L87 Difference]: Start difference. First operand 3846 states and 10053 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:26,442 INFO L93 Difference]: Finished difference Result 4504 states and 11381 transitions. [2021-06-05 10:29:26,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 10:29:26,443 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:26,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:26,447 INFO L225 Difference]: With dead ends: 4504 [2021-06-05 10:29:26,447 INFO L226 Difference]: Without dead ends: 4504 [2021-06-05 10:29:26,448 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 989.4ms TimeCoverageRelationStatistics Valid=284, Invalid=838, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:29:26,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4504 states. [2021-06-05 10:29:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4504 to 3854. [2021-06-05 10:29:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3854 states, 3852 states have (on average 2.6150051921079958) internal successors, (10073), 3853 states have internal predecessors, (10073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3854 states to 3854 states and 10073 transitions. [2021-06-05 10:29:26,516 INFO L78 Accepts]: Start accepts. Automaton has 3854 states and 10073 transitions. Word has length 105 [2021-06-05 10:29:26,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:26,516 INFO L482 AbstractCegarLoop]: Abstraction has 3854 states and 10073 transitions. [2021-06-05 10:29:26,516 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:26,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3854 states and 10073 transitions. [2021-06-05 10:29:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:26,522 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:26,523 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:26,523 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 10:29:26,523 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:26,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:26,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1866032802, now seen corresponding path program 9 times [2021-06-05 10:29:26,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:26,523 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169359367] [2021-06-05 10:29:26,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:27,247 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:27,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169359367] [2021-06-05 10:29:27,250 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169359367] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:27,250 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:27,250 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 10:29:27,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449775623] [2021-06-05 10:29:27,250 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 10:29:27,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:27,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 10:29:27,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:29:27,253 INFO L87 Difference]: Start difference. First operand 3854 states and 10073 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:28,716 INFO L93 Difference]: Finished difference Result 4806 states and 12131 transitions. [2021-06-05 10:29:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 10:29:28,717 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:28,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:28,722 INFO L225 Difference]: With dead ends: 4806 [2021-06-05 10:29:28,723 INFO L226 Difference]: Without dead ends: 4806 [2021-06-05 10:29:28,723 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1463.0ms TimeCoverageRelationStatistics Valid=326, Invalid=1006, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 10:29:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2021-06-05 10:29:28,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 3862. [2021-06-05 10:29:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3862 states, 3860 states have (on average 2.6147668393782384) internal successors, (10093), 3861 states have internal predecessors, (10093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 10093 transitions. [2021-06-05 10:29:28,802 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 10093 transitions. Word has length 105 [2021-06-05 10:29:28,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:28,802 INFO L482 AbstractCegarLoop]: Abstraction has 3862 states and 10093 transitions. [2021-06-05 10:29:28,802 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:28,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 10093 transitions. [2021-06-05 10:29:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:28,808 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:28,808 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:28,809 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 10:29:28,809 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:28,809 INFO L82 PathProgramCache]: Analyzing trace with hash 179931456, now seen corresponding path program 10 times [2021-06-05 10:29:28,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:28,809 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663141539] [2021-06-05 10:29:28,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:29,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:29,213 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:29,213 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663141539] [2021-06-05 10:29:29,213 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663141539] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:29,213 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:29,213 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:29,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180759163] [2021-06-05 10:29:29,214 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:29,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:29,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:29,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:29,214 INFO L87 Difference]: Start difference. First operand 3862 states and 10093 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:31,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:31,078 INFO L93 Difference]: Finished difference Result 5652 states and 13985 transitions. [2021-06-05 10:29:31,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 10:29:31,078 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:31,083 INFO L225 Difference]: With dead ends: 5652 [2021-06-05 10:29:31,083 INFO L226 Difference]: Without dead ends: 5652 [2021-06-05 10:29:31,083 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1588.7ms TimeCoverageRelationStatistics Valid=459, Invalid=1263, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 10:29:31,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5652 states. [2021-06-05 10:29:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5652 to 3830. [2021-06-05 10:29:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3830 states, 3828 states have (on average 2.612591431556949) internal successors, (10001), 3829 states have internal predecessors, (10001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3830 states to 3830 states and 10001 transitions. [2021-06-05 10:29:31,164 INFO L78 Accepts]: Start accepts. Automaton has 3830 states and 10001 transitions. Word has length 105 [2021-06-05 10:29:31,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:31,165 INFO L482 AbstractCegarLoop]: Abstraction has 3830 states and 10001 transitions. [2021-06-05 10:29:31,165 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:31,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3830 states and 10001 transitions. [2021-06-05 10:29:31,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:31,170 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:31,170 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:31,171 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 10:29:31,171 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:31,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:31,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2114633644, now seen corresponding path program 11 times [2021-06-05 10:29:31,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:31,171 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988378670] [2021-06-05 10:29:31,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:31,605 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:31,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988378670] [2021-06-05 10:29:31,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988378670] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:31,605 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:31,605 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:31,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287223630] [2021-06-05 10:29:31,606 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:31,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:31,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:31,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:31,606 INFO L87 Difference]: Start difference. First operand 3830 states and 10001 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:32,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:32,624 INFO L93 Difference]: Finished difference Result 4897 states and 12195 transitions. [2021-06-05 10:29:32,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 10:29:32,624 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:32,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:32,628 INFO L225 Difference]: With dead ends: 4897 [2021-06-05 10:29:32,628 INFO L226 Difference]: Without dead ends: 4897 [2021-06-05 10:29:32,629 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 839.7ms TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:29:32,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4897 states. [2021-06-05 10:29:32,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4897 to 3836. [2021-06-05 10:29:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3836 states, 3834 states have (on average 2.612415232133542) internal successors, (10016), 3835 states have internal predecessors, (10016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 10016 transitions. [2021-06-05 10:29:32,699 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 10016 transitions. Word has length 105 [2021-06-05 10:29:32,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:32,699 INFO L482 AbstractCegarLoop]: Abstraction has 3836 states and 10016 transitions. [2021-06-05 10:29:32,699 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 10016 transitions. [2021-06-05 10:29:32,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:32,705 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:32,705 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:32,705 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 10:29:32,705 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:32,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:32,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1809281472, now seen corresponding path program 12 times [2021-06-05 10:29:32,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:32,706 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279551159] [2021-06-05 10:29:32,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:33,168 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:33,168 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279551159] [2021-06-05 10:29:33,168 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279551159] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:33,168 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:33,169 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 10:29:33,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539265724] [2021-06-05 10:29:33,170 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 10:29:33,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:33,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 10:29:33,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:29:33,171 INFO L87 Difference]: Start difference. First operand 3836 states and 10016 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:34,163 INFO L93 Difference]: Finished difference Result 4697 states and 11755 transitions. [2021-06-05 10:29:34,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 10:29:34,163 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:34,166 INFO L225 Difference]: With dead ends: 4697 [2021-06-05 10:29:34,166 INFO L226 Difference]: Without dead ends: 4697 [2021-06-05 10:29:34,167 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 878.0ms TimeCoverageRelationStatistics Valid=289, Invalid=971, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 10:29:34,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4697 states. [2021-06-05 10:29:34,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4697 to 3855. [2021-06-05 10:29:34,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3855 states, 3853 states have (on average 2.6106929665195953) internal successors, (10059), 3854 states have internal predecessors, (10059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3855 states to 3855 states and 10059 transitions. [2021-06-05 10:29:34,231 INFO L78 Accepts]: Start accepts. Automaton has 3855 states and 10059 transitions. Word has length 105 [2021-06-05 10:29:34,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:34,232 INFO L482 AbstractCegarLoop]: Abstraction has 3855 states and 10059 transitions. [2021-06-05 10:29:34,232 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:34,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3855 states and 10059 transitions. [2021-06-05 10:29:34,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:34,238 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:34,238 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:34,238 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 10:29:34,238 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:34,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:34,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2136499800, now seen corresponding path program 13 times [2021-06-05 10:29:34,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:34,239 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712535360] [2021-06-05 10:29:34,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:34,496 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:34,496 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712535360] [2021-06-05 10:29:34,496 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712535360] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:34,496 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:34,496 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 10:29:34,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165217189] [2021-06-05 10:29:34,496 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 10:29:34,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:34,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 10:29:34,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 10:29:34,497 INFO L87 Difference]: Start difference. First operand 3855 states and 10059 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:35,256 INFO L93 Difference]: Finished difference Result 4967 states and 12337 transitions. [2021-06-05 10:29:35,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 10:29:35,257 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:35,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:35,262 INFO L225 Difference]: With dead ends: 4967 [2021-06-05 10:29:35,263 INFO L226 Difference]: Without dead ends: 4967 [2021-06-05 10:29:35,263 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 556.9ms TimeCoverageRelationStatistics Valid=221, Invalid=591, Unknown=0, NotChecked=0, Total=812 [2021-06-05 10:29:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4967 states. [2021-06-05 10:29:35,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4967 to 3911. [2021-06-05 10:29:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3911 states, 3909 states have (on average 2.609363008442057) internal successors, (10200), 3910 states have internal predecessors, (10200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3911 states to 3911 states and 10200 transitions. [2021-06-05 10:29:35,341 INFO L78 Accepts]: Start accepts. Automaton has 3911 states and 10200 transitions. Word has length 105 [2021-06-05 10:29:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:35,341 INFO L482 AbstractCegarLoop]: Abstraction has 3911 states and 10200 transitions. [2021-06-05 10:29:35,341 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3911 states and 10200 transitions. [2021-06-05 10:29:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:35,347 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:35,347 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:35,348 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 10:29:35,348 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:35,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:35,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1608280384, now seen corresponding path program 14 times [2021-06-05 10:29:35,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:35,350 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204834525] [2021-06-05 10:29:35,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:35,734 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:35,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204834525] [2021-06-05 10:29:35,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204834525] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:35,734 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:35,734 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:35,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202425694] [2021-06-05 10:29:35,734 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:35,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:35,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:35,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:35,735 INFO L87 Difference]: Start difference. First operand 3911 states and 10200 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:36,845 INFO L93 Difference]: Finished difference Result 4759 states and 11904 transitions. [2021-06-05 10:29:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 10:29:36,846 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:36,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:36,849 INFO L225 Difference]: With dead ends: 4759 [2021-06-05 10:29:36,849 INFO L226 Difference]: Without dead ends: 4759 [2021-06-05 10:29:36,850 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 966.5ms TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:29:36,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4759 states. [2021-06-05 10:29:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4759 to 3911. [2021-06-05 10:29:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3911 states, 3909 states have (on average 2.609363008442057) internal successors, (10200), 3910 states have internal predecessors, (10200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3911 states to 3911 states and 10200 transitions. [2021-06-05 10:29:36,911 INFO L78 Accepts]: Start accepts. Automaton has 3911 states and 10200 transitions. Word has length 105 [2021-06-05 10:29:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:36,911 INFO L482 AbstractCegarLoop]: Abstraction has 3911 states and 10200 transitions. [2021-06-05 10:29:36,911 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3911 states and 10200 transitions. [2021-06-05 10:29:36,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:36,917 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:36,917 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:36,917 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 10:29:36,917 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:36,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:36,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1667670798, now seen corresponding path program 15 times [2021-06-05 10:29:36,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:36,918 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748176026] [2021-06-05 10:29:36,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:37,311 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:37,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748176026] [2021-06-05 10:29:37,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748176026] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:37,312 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:37,312 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:37,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95990368] [2021-06-05 10:29:37,312 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:37,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:37,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:37,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:37,314 INFO L87 Difference]: Start difference. First operand 3911 states and 10200 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:38,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:38,452 INFO L93 Difference]: Finished difference Result 4830 states and 12033 transitions. [2021-06-05 10:29:38,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 10:29:38,452 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:38,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:38,457 INFO L225 Difference]: With dead ends: 4830 [2021-06-05 10:29:38,457 INFO L226 Difference]: Without dead ends: 4830 [2021-06-05 10:29:38,457 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 999.9ms TimeCoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 10:29:38,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4830 states. [2021-06-05 10:29:38,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4830 to 3909. [2021-06-05 10:29:38,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3909 states, 3907 states have (on average 2.6094189915536217) internal successors, (10195), 3908 states have internal predecessors, (10195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3909 states to 3909 states and 10195 transitions. [2021-06-05 10:29:38,509 INFO L78 Accepts]: Start accepts. Automaton has 3909 states and 10195 transitions. Word has length 105 [2021-06-05 10:29:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:38,509 INFO L482 AbstractCegarLoop]: Abstraction has 3909 states and 10195 transitions. [2021-06-05 10:29:38,510 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3909 states and 10195 transitions. [2021-06-05 10:29:38,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:38,515 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:38,515 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:38,515 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 10:29:38,515 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:38,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:38,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1842427648, now seen corresponding path program 16 times [2021-06-05 10:29:38,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:38,516 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614222866] [2021-06-05 10:29:38,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:38,808 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:38,808 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614222866] [2021-06-05 10:29:38,809 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614222866] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:38,809 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:38,809 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 10:29:38,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738705159] [2021-06-05 10:29:38,810 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 10:29:38,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:38,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 10:29:38,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 10:29:38,811 INFO L87 Difference]: Start difference. First operand 3909 states and 10195 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:39,415 INFO L93 Difference]: Finished difference Result 5081 states and 12655 transitions. [2021-06-05 10:29:39,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 10:29:39,416 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:39,421 INFO L225 Difference]: With dead ends: 5081 [2021-06-05 10:29:39,421 INFO L226 Difference]: Without dead ends: 5081 [2021-06-05 10:29:39,421 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 470.2ms TimeCoverageRelationStatistics Valid=232, Invalid=580, Unknown=0, NotChecked=0, Total=812 [2021-06-05 10:29:39,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2021-06-05 10:29:39,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 3873. [2021-06-05 10:29:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3873 states, 3871 states have (on average 2.608886592611728) internal successors, (10099), 3872 states have internal predecessors, (10099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:39,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 10099 transitions. [2021-06-05 10:29:39,465 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 10099 transitions. Word has length 105 [2021-06-05 10:29:39,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:39,465 INFO L482 AbstractCegarLoop]: Abstraction has 3873 states and 10099 transitions. [2021-06-05 10:29:39,465 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 10099 transitions. [2021-06-05 10:29:39,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:39,470 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:39,470 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:39,470 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 10:29:39,470 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:39,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:39,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2017781410, now seen corresponding path program 17 times [2021-06-05 10:29:39,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:39,471 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734912862] [2021-06-05 10:29:39,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:39,805 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:39,805 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734912862] [2021-06-05 10:29:39,805 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734912862] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:39,805 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:39,805 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:39,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586420013] [2021-06-05 10:29:39,805 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:39,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:39,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:39,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:39,806 INFO L87 Difference]: Start difference. First operand 3873 states and 10099 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:41,119 INFO L93 Difference]: Finished difference Result 5410 states and 13710 transitions. [2021-06-05 10:29:41,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 10:29:41,120 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:41,123 INFO L225 Difference]: With dead ends: 5410 [2021-06-05 10:29:41,124 INFO L226 Difference]: Without dead ends: 5410 [2021-06-05 10:29:41,124 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1112.4ms TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:29:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2021-06-05 10:29:41,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 3921. [2021-06-05 10:29:41,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3919 states have (on average 2.613676958407757) internal successors, (10243), 3920 states have internal predecessors, (10243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 10243 transitions. [2021-06-05 10:29:41,184 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 10243 transitions. Word has length 105 [2021-06-05 10:29:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:41,185 INFO L482 AbstractCegarLoop]: Abstraction has 3921 states and 10243 transitions. [2021-06-05 10:29:41,185 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 10243 transitions. [2021-06-05 10:29:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:41,190 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:41,190 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:41,191 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 10:29:41,191 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:41,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1220456674, now seen corresponding path program 18 times [2021-06-05 10:29:41,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:41,191 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682317621] [2021-06-05 10:29:41,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:41,579 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:41,579 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682317621] [2021-06-05 10:29:41,579 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682317621] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:41,579 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:41,579 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:41,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251231459] [2021-06-05 10:29:41,579 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:41,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:41,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:41,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:41,580 INFO L87 Difference]: Start difference. First operand 3921 states and 10243 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:42,881 INFO L93 Difference]: Finished difference Result 6126 states and 15571 transitions. [2021-06-05 10:29:42,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 10:29:42,882 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:42,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:42,888 INFO L225 Difference]: With dead ends: 6126 [2021-06-05 10:29:42,888 INFO L226 Difference]: Without dead ends: 6126 [2021-06-05 10:29:42,888 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1089.3ms TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 10:29:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6126 states. [2021-06-05 10:29:42,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6126 to 3921. [2021-06-05 10:29:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3919 states have (on average 2.613676958407757) internal successors, (10243), 3920 states have internal predecessors, (10243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 10243 transitions. [2021-06-05 10:29:42,945 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 10243 transitions. Word has length 105 [2021-06-05 10:29:42,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:42,945 INFO L482 AbstractCegarLoop]: Abstraction has 3921 states and 10243 transitions. [2021-06-05 10:29:42,945 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 10243 transitions. [2021-06-05 10:29:42,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:42,951 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:42,951 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:42,951 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 10:29:42,951 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:42,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:42,951 INFO L82 PathProgramCache]: Analyzing trace with hash 435996362, now seen corresponding path program 19 times [2021-06-05 10:29:42,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:42,952 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070287942] [2021-06-05 10:29:42,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:43,274 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:43,274 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070287942] [2021-06-05 10:29:43,274 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070287942] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:43,274 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:43,274 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:43,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963358115] [2021-06-05 10:29:43,275 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:43,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:43,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:43,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:43,275 INFO L87 Difference]: Start difference. First operand 3921 states and 10243 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:44,603 INFO L93 Difference]: Finished difference Result 5608 states and 14108 transitions. [2021-06-05 10:29:44,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 10:29:44,604 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:44,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:44,608 INFO L225 Difference]: With dead ends: 5608 [2021-06-05 10:29:44,608 INFO L226 Difference]: Without dead ends: 5608 [2021-06-05 10:29:44,609 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1016.6ms TimeCoverageRelationStatistics Valid=284, Invalid=838, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:29:44,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5608 states. [2021-06-05 10:29:44,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5608 to 3923. [2021-06-05 10:29:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3923 states, 3921 states have (on average 2.613618974751339) internal successors, (10248), 3922 states have internal predecessors, (10248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 10248 transitions. [2021-06-05 10:29:44,659 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 10248 transitions. Word has length 105 [2021-06-05 10:29:44,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:44,659 INFO L482 AbstractCegarLoop]: Abstraction has 3923 states and 10248 transitions. [2021-06-05 10:29:44,659 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 10248 transitions. [2021-06-05 10:29:44,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:44,664 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:44,664 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:44,664 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 10:29:44,664 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:44,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:44,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1883605662, now seen corresponding path program 20 times [2021-06-05 10:29:44,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:44,665 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860771988] [2021-06-05 10:29:44,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:45,021 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:45,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860771988] [2021-06-05 10:29:45,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860771988] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:45,021 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:45,021 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:45,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745668282] [2021-06-05 10:29:45,021 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:45,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:45,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:45,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:45,022 INFO L87 Difference]: Start difference. First operand 3923 states and 10248 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:46,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:46,329 INFO L93 Difference]: Finished difference Result 5579 states and 14042 transitions. [2021-06-05 10:29:46,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 10:29:46,329 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:46,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:46,334 INFO L225 Difference]: With dead ends: 5579 [2021-06-05 10:29:46,334 INFO L226 Difference]: Without dead ends: 5579 [2021-06-05 10:29:46,334 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1072.3ms TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 10:29:46,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5579 states. [2021-06-05 10:29:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5579 to 3921. [2021-06-05 10:29:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3919 states have (on average 2.613676958407757) internal successors, (10243), 3920 states have internal predecessors, (10243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 10243 transitions. [2021-06-05 10:29:46,385 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 10243 transitions. Word has length 105 [2021-06-05 10:29:46,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:46,386 INFO L482 AbstractCegarLoop]: Abstraction has 3921 states and 10243 transitions. [2021-06-05 10:29:46,386 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 10243 transitions. [2021-06-05 10:29:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:46,390 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:46,391 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:46,391 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 10:29:46,391 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:46,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:46,391 INFO L82 PathProgramCache]: Analyzing trace with hash 705758666, now seen corresponding path program 21 times [2021-06-05 10:29:46,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:46,392 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140690123] [2021-06-05 10:29:46,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:46,773 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:46,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140690123] [2021-06-05 10:29:46,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140690123] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:46,773 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:46,773 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:46,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247821527] [2021-06-05 10:29:46,774 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:46,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:46,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:46,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:46,774 INFO L87 Difference]: Start difference. First operand 3921 states and 10243 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:48,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:48,554 INFO L93 Difference]: Finished difference Result 6811 states and 17055 transitions. [2021-06-05 10:29:48,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 10:29:48,554 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:48,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:48,560 INFO L225 Difference]: With dead ends: 6811 [2021-06-05 10:29:48,561 INFO L226 Difference]: Without dead ends: 6811 [2021-06-05 10:29:48,561 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1541.4ms TimeCoverageRelationStatistics Valid=434, Invalid=1126, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 10:29:48,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6811 states. [2021-06-05 10:29:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6811 to 3933. [2021-06-05 10:29:48,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3933 states, 3931 states have (on average 2.614856270669041) internal successors, (10279), 3932 states have internal predecessors, (10279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3933 states to 3933 states and 10279 transitions. [2021-06-05 10:29:48,610 INFO L78 Accepts]: Start accepts. Automaton has 3933 states and 10279 transitions. Word has length 105 [2021-06-05 10:29:48,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:48,610 INFO L482 AbstractCegarLoop]: Abstraction has 3933 states and 10279 transitions. [2021-06-05 10:29:48,610 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:48,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3933 states and 10279 transitions. [2021-06-05 10:29:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:48,613 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:48,613 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:48,613 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 10:29:48,613 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:48,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:48,614 INFO L82 PathProgramCache]: Analyzing trace with hash 793280674, now seen corresponding path program 22 times [2021-06-05 10:29:48,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:48,614 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314183031] [2021-06-05 10:29:48,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:48,933 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:48,933 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314183031] [2021-06-05 10:29:48,933 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314183031] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:48,933 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:48,934 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:48,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764318254] [2021-06-05 10:29:48,934 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:48,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:48,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:48,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:48,934 INFO L87 Difference]: Start difference. First operand 3933 states and 10279 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:50,311 INFO L93 Difference]: Finished difference Result 5948 states and 14912 transitions. [2021-06-05 10:29:50,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 10:29:50,311 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:50,316 INFO L225 Difference]: With dead ends: 5948 [2021-06-05 10:29:50,316 INFO L226 Difference]: Without dead ends: 5948 [2021-06-05 10:29:50,317 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1122.3ms TimeCoverageRelationStatistics Valid=320, Invalid=870, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 10:29:50,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2021-06-05 10:29:50,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3921. [2021-06-05 10:29:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3919 states have (on average 2.613676958407757) internal successors, (10243), 3920 states have internal predecessors, (10243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 10243 transitions. [2021-06-05 10:29:50,369 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 10243 transitions. Word has length 105 [2021-06-05 10:29:50,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:50,370 INFO L482 AbstractCegarLoop]: Abstraction has 3921 states and 10243 transitions. [2021-06-05 10:29:50,370 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 10243 transitions. [2021-06-05 10:29:50,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:50,373 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:50,373 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:50,373 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 10:29:50,373 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:50,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:50,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1795359232, now seen corresponding path program 23 times [2021-06-05 10:29:50,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:50,374 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009150760] [2021-06-05 10:29:50,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:50,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:50,705 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:50,705 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009150760] [2021-06-05 10:29:50,705 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009150760] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:50,705 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:50,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:50,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309767251] [2021-06-05 10:29:50,706 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:50,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:50,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:50,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:50,707 INFO L87 Difference]: Start difference. First operand 3921 states and 10243 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:51,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:51,545 INFO L93 Difference]: Finished difference Result 4465 states and 11330 transitions. [2021-06-05 10:29:51,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 10:29:51,546 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:51,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:51,549 INFO L225 Difference]: With dead ends: 4465 [2021-06-05 10:29:51,549 INFO L226 Difference]: Without dead ends: 4465 [2021-06-05 10:29:51,550 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 726.0ms TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:29:51,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4465 states. [2021-06-05 10:29:51,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4465 to 3903. [2021-06-05 10:29:51,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3903 states, 3901 states have (on average 2.614201486798257) internal successors, (10198), 3902 states have internal predecessors, (10198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 10198 transitions. [2021-06-05 10:29:51,588 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 10198 transitions. Word has length 105 [2021-06-05 10:29:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:51,588 INFO L482 AbstractCegarLoop]: Abstraction has 3903 states and 10198 transitions. [2021-06-05 10:29:51,588 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 10198 transitions. [2021-06-05 10:29:51,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:51,591 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:51,591 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:51,591 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 10:29:51,591 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:51,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:51,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1490007060, now seen corresponding path program 24 times [2021-06-05 10:29:51,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:51,592 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789989718] [2021-06-05 10:29:51,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:51,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:51,891 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:51,891 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789989718] [2021-06-05 10:29:51,891 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789989718] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:51,891 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:51,892 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 10:29:51,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494380760] [2021-06-05 10:29:51,892 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 10:29:51,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:51,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 10:29:51,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 10:29:51,892 INFO L87 Difference]: Start difference. First operand 3903 states and 10198 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:52,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:52,467 INFO L93 Difference]: Finished difference Result 4518 states and 11434 transitions. [2021-06-05 10:29:52,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 10:29:52,468 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:52,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:52,472 INFO L225 Difference]: With dead ends: 4518 [2021-06-05 10:29:52,472 INFO L226 Difference]: Without dead ends: 4518 [2021-06-05 10:29:52,472 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 515.6ms TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2021-06-05 10:29:52,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2021-06-05 10:29:52,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 3827. [2021-06-05 10:29:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3827 states, 3825 states have (on average 2.618562091503268) internal successors, (10016), 3826 states have internal predecessors, (10016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3827 states to 3827 states and 10016 transitions. [2021-06-05 10:29:52,520 INFO L78 Accepts]: Start accepts. Automaton has 3827 states and 10016 transitions. Word has length 105 [2021-06-05 10:29:52,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:52,520 INFO L482 AbstractCegarLoop]: Abstraction has 3827 states and 10016 transitions. [2021-06-05 10:29:52,520 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:52,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3827 states and 10016 transitions. [2021-06-05 10:29:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:52,523 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:52,523 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:52,523 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 10:29:52,524 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:52,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:52,524 INFO L82 PathProgramCache]: Analyzing trace with hash 585486, now seen corresponding path program 25 times [2021-06-05 10:29:52,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:52,524 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002383594] [2021-06-05 10:29:52,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:52,855 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:52,855 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002383594] [2021-06-05 10:29:52,855 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002383594] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:52,855 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:52,855 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:52,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769020712] [2021-06-05 10:29:52,856 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:52,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:52,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:52,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:52,857 INFO L87 Difference]: Start difference. First operand 3827 states and 10016 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:53,758 INFO L93 Difference]: Finished difference Result 4743 states and 11906 transitions. [2021-06-05 10:29:53,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 10:29:53,758 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:53,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:53,762 INFO L225 Difference]: With dead ends: 4743 [2021-06-05 10:29:53,762 INFO L226 Difference]: Without dead ends: 4743 [2021-06-05 10:29:53,763 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 768.0ms TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:29:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4743 states. [2021-06-05 10:29:53,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4743 to 3829. [2021-06-05 10:29:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3829 states, 3827 states have (on average 2.61850013065064) internal successors, (10021), 3828 states have internal predecessors, (10021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3829 states to 3829 states and 10021 transitions. [2021-06-05 10:29:53,808 INFO L78 Accepts]: Start accepts. Automaton has 3829 states and 10021 transitions. Word has length 105 [2021-06-05 10:29:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:53,808 INFO L482 AbstractCegarLoop]: Abstraction has 3829 states and 10021 transitions. [2021-06-05 10:29:53,809 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3829 states and 10021 transitions. [2021-06-05 10:29:53,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:53,812 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:53,813 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:53,813 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 10:29:53,813 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:53,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:53,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1986945210, now seen corresponding path program 26 times [2021-06-05 10:29:53,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:53,814 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036327659] [2021-06-05 10:29:53,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:54,197 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:54,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036327659] [2021-06-05 10:29:54,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036327659] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:54,197 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:54,198 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:54,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775517961] [2021-06-05 10:29:54,198 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:54,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:54,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:54,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:54,198 INFO L87 Difference]: Start difference. First operand 3829 states and 10021 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:55,189 INFO L93 Difference]: Finished difference Result 4826 states and 12065 transitions. [2021-06-05 10:29:55,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 10:29:55,189 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:55,193 INFO L225 Difference]: With dead ends: 4826 [2021-06-05 10:29:55,193 INFO L226 Difference]: Without dead ends: 4826 [2021-06-05 10:29:55,194 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 885.4ms TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 10:29:55,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4826 states. [2021-06-05 10:29:55,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4826 to 3821. [2021-06-05 10:29:55,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3821 states, 3819 states have (on average 2.618748363445928) internal successors, (10001), 3820 states have internal predecessors, (10001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 10001 transitions. [2021-06-05 10:29:55,243 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 10001 transitions. Word has length 105 [2021-06-05 10:29:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:55,244 INFO L482 AbstractCegarLoop]: Abstraction has 3821 states and 10001 transitions. [2021-06-05 10:29:55,244 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 10001 transitions. [2021-06-05 10:29:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:55,247 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:55,247 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:55,247 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 10:29:55,247 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:55,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:55,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1605592104, now seen corresponding path program 27 times [2021-06-05 10:29:55,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:55,248 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091630877] [2021-06-05 10:29:55,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:55,616 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:55,616 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091630877] [2021-06-05 10:29:55,616 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091630877] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:55,616 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:55,616 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:55,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554987881] [2021-06-05 10:29:55,616 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:55,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:55,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:55,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:55,617 INFO L87 Difference]: Start difference. First operand 3821 states and 10001 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:56,460 INFO L93 Difference]: Finished difference Result 4320 states and 11007 transitions. [2021-06-05 10:29:56,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 10:29:56,460 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:56,464 INFO L225 Difference]: With dead ends: 4320 [2021-06-05 10:29:56,464 INFO L226 Difference]: Without dead ends: 4320 [2021-06-05 10:29:56,465 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 751.2ms TimeCoverageRelationStatistics Valid=264, Invalid=858, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:29:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4320 states. [2021-06-05 10:29:56,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4320 to 3839. [2021-06-05 10:29:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3839 states, 3837 states have (on average 2.618191295282773) internal successors, (10046), 3838 states have internal predecessors, (10046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 10046 transitions. [2021-06-05 10:29:56,504 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 10046 transitions. Word has length 105 [2021-06-05 10:29:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:56,504 INFO L482 AbstractCegarLoop]: Abstraction has 3839 states and 10046 transitions. [2021-06-05 10:29:56,505 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 10046 transitions. [2021-06-05 10:29:56,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:56,508 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:56,509 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:56,509 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 10:29:56,509 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:56,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:56,509 INFO L82 PathProgramCache]: Analyzing trace with hash -291468002, now seen corresponding path program 28 times [2021-06-05 10:29:56,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:56,510 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712239906] [2021-06-05 10:29:56,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:56,795 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:56,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712239906] [2021-06-05 10:29:56,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712239906] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:56,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:56,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:56,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537717013] [2021-06-05 10:29:56,796 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:56,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:56,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:56,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:56,797 INFO L87 Difference]: Start difference. First operand 3839 states and 10046 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:57,705 INFO L93 Difference]: Finished difference Result 4533 states and 11432 transitions. [2021-06-05 10:29:57,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 10:29:57,705 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:57,710 INFO L225 Difference]: With dead ends: 4533 [2021-06-05 10:29:57,710 INFO L226 Difference]: Without dead ends: 4533 [2021-06-05 10:29:57,711 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 755.6ms TimeCoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:29:57,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2021-06-05 10:29:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 3839. [2021-06-05 10:29:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3839 states, 3837 states have (on average 2.618191295282773) internal successors, (10046), 3838 states have internal predecessors, (10046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 10046 transitions. [2021-06-05 10:29:57,767 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 10046 transitions. Word has length 105 [2021-06-05 10:29:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:57,767 INFO L482 AbstractCegarLoop]: Abstraction has 3839 states and 10046 transitions. [2021-06-05 10:29:57,767 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:57,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 10046 transitions. [2021-06-05 10:29:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:57,771 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:57,771 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:57,772 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 10:29:57,772 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:57,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:57,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1694891722, now seen corresponding path program 29 times [2021-06-05 10:29:57,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:57,772 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056526252] [2021-06-05 10:29:57,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:58,097 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:58,097 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056526252] [2021-06-05 10:29:58,098 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056526252] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:58,098 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:58,098 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:58,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783628284] [2021-06-05 10:29:58,098 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:58,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:58,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:58,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:58,098 INFO L87 Difference]: Start difference. First operand 3839 states and 10046 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:59,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:59,134 INFO L93 Difference]: Finished difference Result 4397 states and 11151 transitions. [2021-06-05 10:29:59,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 10:29:59,135 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:29:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:59,139 INFO L225 Difference]: With dead ends: 4397 [2021-06-05 10:29:59,139 INFO L226 Difference]: Without dead ends: 4397 [2021-06-05 10:29:59,139 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 778.4ms TimeCoverageRelationStatistics Valid=288, Invalid=902, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 10:29:59,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2021-06-05 10:29:59,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 3831. [2021-06-05 10:29:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3831 states, 3829 states have (on average 2.618438234525986) internal successors, (10026), 3830 states have internal predecessors, (10026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3831 states to 3831 states and 10026 transitions. [2021-06-05 10:29:59,177 INFO L78 Accepts]: Start accepts. Automaton has 3831 states and 10026 transitions. Word has length 105 [2021-06-05 10:29:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:59,177 INFO L482 AbstractCegarLoop]: Abstraction has 3831 states and 10026 transitions. [2021-06-05 10:29:59,177 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3831 states and 10026 transitions. [2021-06-05 10:29:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:29:59,180 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:59,180 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:59,180 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 10:29:59,180 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:29:59,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1380809994, now seen corresponding path program 30 times [2021-06-05 10:29:59,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:59,181 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721894712] [2021-06-05 10:29:59,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:59,502 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:59,502 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721894712] [2021-06-05 10:29:59,502 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721894712] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:59,502 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:59,502 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:59,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614749112] [2021-06-05 10:29:59,503 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:59,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:59,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:59,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:59,504 INFO L87 Difference]: Start difference. First operand 3831 states and 10026 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:00,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:00,473 INFO L93 Difference]: Finished difference Result 4697 states and 11791 transitions. [2021-06-05 10:30:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 10:30:00,474 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:30:00,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:00,477 INFO L225 Difference]: With dead ends: 4697 [2021-06-05 10:30:00,477 INFO L226 Difference]: Without dead ends: 4697 [2021-06-05 10:30:00,478 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 767.1ms TimeCoverageRelationStatistics Valid=286, Invalid=836, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:30:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4697 states. [2021-06-05 10:30:00,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4697 to 3893. [2021-06-05 10:30:00,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3893 states, 3891 states have (on average 2.6150089951169364) internal successors, (10175), 3892 states have internal predecessors, (10175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 10175 transitions. [2021-06-05 10:30:00,519 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 10175 transitions. Word has length 105 [2021-06-05 10:30:00,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:00,520 INFO L482 AbstractCegarLoop]: Abstraction has 3893 states and 10175 transitions. [2021-06-05 10:30:00,520 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:00,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 10175 transitions. [2021-06-05 10:30:00,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:30:00,524 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:00,524 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:00,524 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 10:30:00,524 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:00,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:00,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1168161044, now seen corresponding path program 31 times [2021-06-05 10:30:00,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:00,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908307627] [2021-06-05 10:30:00,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:30:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:30:00,820 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:30:00,820 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908307627] [2021-06-05 10:30:00,820 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908307627] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:30:00,821 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:30:00,821 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:30:00,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382730371] [2021-06-05 10:30:00,821 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:30:00,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:30:00,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:30:00,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:30:00,822 INFO L87 Difference]: Start difference. First operand 3893 states and 10175 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:02,008 INFO L93 Difference]: Finished difference Result 6573 states and 16534 transitions. [2021-06-05 10:30:02,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 10:30:02,009 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:30:02,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:02,016 INFO L225 Difference]: With dead ends: 6573 [2021-06-05 10:30:02,017 INFO L226 Difference]: Without dead ends: 6573 [2021-06-05 10:30:02,017 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 981.7ms TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:30:02,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6573 states. [2021-06-05 10:30:02,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6573 to 3961. [2021-06-05 10:30:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3961 states, 3959 states have (on average 2.6221267996968933) internal successors, (10381), 3960 states have internal predecessors, (10381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:02,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3961 states to 3961 states and 10381 transitions. [2021-06-05 10:30:02,087 INFO L78 Accepts]: Start accepts. Automaton has 3961 states and 10381 transitions. Word has length 105 [2021-06-05 10:30:02,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:02,087 INFO L482 AbstractCegarLoop]: Abstraction has 3961 states and 10381 transitions. [2021-06-05 10:30:02,087 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:02,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3961 states and 10381 transitions. [2021-06-05 10:30:02,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:30:02,090 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:02,090 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:02,091 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-05 10:30:02,091 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:02,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:02,091 INFO L82 PathProgramCache]: Analyzing trace with hash -111431832, now seen corresponding path program 32 times [2021-06-05 10:30:02,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:02,091 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134227498] [2021-06-05 10:30:02,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:30:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:30:02,427 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:30:02,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134227498] [2021-06-05 10:30:02,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134227498] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:30:02,428 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:30:02,428 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:30:02,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451586992] [2021-06-05 10:30:02,428 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:30:02,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:30:02,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:30:02,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:30:02,429 INFO L87 Difference]: Start difference. First operand 3961 states and 10381 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:03,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:03,628 INFO L93 Difference]: Finished difference Result 6173 states and 15715 transitions. [2021-06-05 10:30:03,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 10:30:03,629 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:30:03,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:03,635 INFO L225 Difference]: With dead ends: 6173 [2021-06-05 10:30:03,635 INFO L226 Difference]: Without dead ends: 6173 [2021-06-05 10:30:03,635 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1047.5ms TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 10:30:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6173 states. [2021-06-05 10:30:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6173 to 4001. [2021-06-05 10:30:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4001 states, 3999 states have (on average 2.6319079769942486) internal successors, (10525), 4000 states have internal predecessors, (10525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4001 states to 4001 states and 10525 transitions. [2021-06-05 10:30:03,689 INFO L78 Accepts]: Start accepts. Automaton has 4001 states and 10525 transitions. Word has length 105 [2021-06-05 10:30:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:03,690 INFO L482 AbstractCegarLoop]: Abstraction has 4001 states and 10525 transitions. [2021-06-05 10:30:03,690 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 10525 transitions. [2021-06-05 10:30:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:30:03,693 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:03,693 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:03,693 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 10:30:03,693 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:03,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:03,694 INFO L82 PathProgramCache]: Analyzing trace with hash -409886238, now seen corresponding path program 33 times [2021-06-05 10:30:03,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:03,694 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032419770] [2021-06-05 10:30:03,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:30:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:30:03,991 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:30:03,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032419770] [2021-06-05 10:30:03,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032419770] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:30:03,992 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:30:03,992 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:30:03,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456573240] [2021-06-05 10:30:03,992 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:30:03,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:30:03,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:30:03,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:30:03,992 INFO L87 Difference]: Start difference. First operand 4001 states and 10525 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:04,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:04,889 INFO L93 Difference]: Finished difference Result 4955 states and 12471 transitions. [2021-06-05 10:30:04,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 10:30:04,889 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:30:04,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:04,894 INFO L225 Difference]: With dead ends: 4955 [2021-06-05 10:30:04,894 INFO L226 Difference]: Without dead ends: 4955 [2021-06-05 10:30:04,894 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 722.9ms TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:30:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4955 states. [2021-06-05 10:30:04,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4955 to 3968. [2021-06-05 10:30:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3968 states, 3966 states have (on average 2.6326273323247604) internal successors, (10441), 3967 states have internal predecessors, (10441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 10441 transitions. [2021-06-05 10:30:04,942 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 10441 transitions. Word has length 105 [2021-06-05 10:30:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:04,942 INFO L482 AbstractCegarLoop]: Abstraction has 3968 states and 10441 transitions. [2021-06-05 10:30:04,942 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 10441 transitions. [2021-06-05 10:30:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:30:04,946 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:04,947 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:04,947 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 10:30:04,947 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:04,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:04,947 INFO L82 PathProgramCache]: Analyzing trace with hash 910792620, now seen corresponding path program 34 times [2021-06-05 10:30:04,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:04,947 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068019802] [2021-06-05 10:30:04,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:30:05,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:30:05,329 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:30:05,329 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068019802] [2021-06-05 10:30:05,329 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068019802] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:30:05,329 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:30:05,329 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:30:05,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107569187] [2021-06-05 10:30:05,330 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:30:05,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:30:05,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:30:05,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:30:05,330 INFO L87 Difference]: Start difference. First operand 3968 states and 10441 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:06,292 INFO L93 Difference]: Finished difference Result 5105 states and 12779 transitions. [2021-06-05 10:30:06,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 10:30:06,292 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:30:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:06,297 INFO L225 Difference]: With dead ends: 5105 [2021-06-05 10:30:06,297 INFO L226 Difference]: Without dead ends: 5105 [2021-06-05 10:30:06,297 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 806.8ms TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:30:06,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5105 states. [2021-06-05 10:30:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5105 to 3971. [2021-06-05 10:30:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3969 states have (on average 2.63265306122449) internal successors, (10449), 3970 states have internal predecessors, (10449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 10449 transitions. [2021-06-05 10:30:06,344 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 10449 transitions. Word has length 105 [2021-06-05 10:30:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:06,344 INFO L482 AbstractCegarLoop]: Abstraction has 3971 states and 10449 transitions. [2021-06-05 10:30:06,344 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 10449 transitions. [2021-06-05 10:30:06,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:30:06,347 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:06,347 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:06,347 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 10:30:06,347 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:06,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1936565376, now seen corresponding path program 35 times [2021-06-05 10:30:06,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:06,348 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792938701] [2021-06-05 10:30:06,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:30:06,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:30:06,685 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:30:06,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792938701] [2021-06-05 10:30:06,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792938701] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:30:06,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:30:06,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:30:06,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162308155] [2021-06-05 10:30:06,686 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:30:06,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:30:06,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:30:06,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:30:06,686 INFO L87 Difference]: Start difference. First operand 3971 states and 10449 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:07,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:07,666 INFO L93 Difference]: Finished difference Result 4879 states and 12300 transitions. [2021-06-05 10:30:07,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 10:30:07,666 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:30:07,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:07,671 INFO L225 Difference]: With dead ends: 4879 [2021-06-05 10:30:07,671 INFO L226 Difference]: Without dead ends: 4879 [2021-06-05 10:30:07,671 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 821.5ms TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 10:30:07,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2021-06-05 10:30:07,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 3969. [2021-06-05 10:30:07,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3969 states, 3967 states have (on average 2.6332240988152256) internal successors, (10446), 3968 states have internal predecessors, (10446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3969 states to 3969 states and 10446 transitions. [2021-06-05 10:30:07,719 INFO L78 Accepts]: Start accepts. Automaton has 3969 states and 10446 transitions. Word has length 105 [2021-06-05 10:30:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:07,719 INFO L482 AbstractCegarLoop]: Abstraction has 3969 states and 10446 transitions. [2021-06-05 10:30:07,719 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3969 states and 10446 transitions. [2021-06-05 10:30:07,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:30:07,723 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:07,724 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:07,724 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-05 10:30:07,724 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:07,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:07,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1118177890, now seen corresponding path program 36 times [2021-06-05 10:30:07,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:07,725 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587996254] [2021-06-05 10:30:07,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:30:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:30:08,092 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:30:08,092 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587996254] [2021-06-05 10:30:08,092 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587996254] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:30:08,093 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:30:08,093 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:30:08,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36884207] [2021-06-05 10:30:08,093 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:30:08,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:30:08,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:30:08,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:30:08,094 INFO L87 Difference]: Start difference. First operand 3969 states and 10446 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:09,393 INFO L93 Difference]: Finished difference Result 6283 states and 15856 transitions. [2021-06-05 10:30:09,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 10:30:09,393 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:30:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:09,399 INFO L225 Difference]: With dead ends: 6283 [2021-06-05 10:30:09,399 INFO L226 Difference]: Without dead ends: 6283 [2021-06-05 10:30:09,400 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1065.9ms TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:30:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6283 states. [2021-06-05 10:30:09,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6283 to 3966. [2021-06-05 10:30:09,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3964 states have (on average 2.6331987891019173) internal successors, (10438), 3965 states have internal predecessors, (10438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 10438 transitions. [2021-06-05 10:30:09,449 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 10438 transitions. Word has length 105 [2021-06-05 10:30:09,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:09,449 INFO L482 AbstractCegarLoop]: Abstraction has 3966 states and 10438 transitions. [2021-06-05 10:30:09,449 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 10438 transitions. [2021-06-05 10:30:09,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:30:09,453 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:09,453 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:09,453 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-05 10:30:09,453 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:09,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:09,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2120060194, now seen corresponding path program 37 times [2021-06-05 10:30:09,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:09,454 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982853985] [2021-06-05 10:30:09,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:30:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:30:09,740 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:30:09,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982853985] [2021-06-05 10:30:09,740 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982853985] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:30:09,740 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:30:09,740 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:30:09,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361894385] [2021-06-05 10:30:09,740 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:30:09,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:30:09,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:30:09,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:30:09,741 INFO L87 Difference]: Start difference. First operand 3966 states and 10438 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:11,027 INFO L93 Difference]: Finished difference Result 7673 states and 19508 transitions. [2021-06-05 10:30:11,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 10:30:11,027 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:30:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:11,034 INFO L225 Difference]: With dead ends: 7673 [2021-06-05 10:30:11,034 INFO L226 Difference]: Without dead ends: 7673 [2021-06-05 10:30:11,034 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1018.3ms TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 10:30:11,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7673 states. [2021-06-05 10:30:11,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7673 to 3894. [2021-06-05 10:30:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3894 states, 3892 states have (on average 2.6264131551901335) internal successors, (10222), 3893 states have internal predecessors, (10222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3894 states to 3894 states and 10222 transitions. [2021-06-05 10:30:11,088 INFO L78 Accepts]: Start accepts. Automaton has 3894 states and 10222 transitions. Word has length 105 [2021-06-05 10:30:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:11,088 INFO L482 AbstractCegarLoop]: Abstraction has 3894 states and 10222 transitions. [2021-06-05 10:30:11,089 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3894 states and 10222 transitions. [2021-06-05 10:30:11,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:30:11,091 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:11,092 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:11,092 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-05 10:30:11,092 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:11,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:11,092 INFO L82 PathProgramCache]: Analyzing trace with hash -463607158, now seen corresponding path program 38 times [2021-06-05 10:30:11,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:11,092 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228509445] [2021-06-05 10:30:11,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:30:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:30:11,439 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:30:11,439 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228509445] [2021-06-05 10:30:11,439 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228509445] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:30:11,440 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:30:11,440 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:30:11,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438050741] [2021-06-05 10:30:11,440 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:30:11,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:30:11,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:30:11,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:30:11,441 INFO L87 Difference]: Start difference. First operand 3894 states and 10222 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:12,616 INFO L93 Difference]: Finished difference Result 5433 states and 13675 transitions. [2021-06-05 10:30:12,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 10:30:12,616 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:30:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:12,621 INFO L225 Difference]: With dead ends: 5433 [2021-06-05 10:30:12,621 INFO L226 Difference]: Without dead ends: 5433 [2021-06-05 10:30:12,622 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 950.3ms TimeCoverageRelationStatistics Valid=285, Invalid=837, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:30:12,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5433 states. [2021-06-05 10:30:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5433 to 3883. [2021-06-05 10:30:12,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3883 states, 3881 states have (on average 2.626642617881989) internal successors, (10194), 3882 states have internal predecessors, (10194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 10194 transitions. [2021-06-05 10:30:12,668 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 10194 transitions. Word has length 105 [2021-06-05 10:30:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:12,668 INFO L482 AbstractCegarLoop]: Abstraction has 3883 states and 10194 transitions. [2021-06-05 10:30:12,668 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 10194 transitions. [2021-06-05 10:30:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:30:12,671 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:12,671 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:12,671 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-05 10:30:12,671 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:12,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:12,672 INFO L82 PathProgramCache]: Analyzing trace with hash 984002142, now seen corresponding path program 39 times [2021-06-05 10:30:12,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:12,672 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113824241] [2021-06-05 10:30:12,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:30:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:30:13,015 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:30:13,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113824241] [2021-06-05 10:30:13,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113824241] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:30:13,015 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:30:13,015 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:30:13,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899340949] [2021-06-05 10:30:13,015 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:30:13,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:30:13,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:30:13,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:30:13,016 INFO L87 Difference]: Start difference. First operand 3883 states and 10194 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:14,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:14,334 INFO L93 Difference]: Finished difference Result 5473 states and 13772 transitions. [2021-06-05 10:30:14,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 10:30:14,334 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:30:14,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:14,339 INFO L225 Difference]: With dead ends: 5473 [2021-06-05 10:30:14,339 INFO L226 Difference]: Without dead ends: 5473 [2021-06-05 10:30:14,340 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1071.4ms TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 10:30:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2021-06-05 10:30:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 3880. [2021-06-05 10:30:14,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3880 states, 3878 states have (on average 2.626611655492522) internal successors, (10186), 3879 states have internal predecessors, (10186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:14,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 3880 states and 10186 transitions. [2021-06-05 10:30:14,391 INFO L78 Accepts]: Start accepts. Automaton has 3880 states and 10186 transitions. Word has length 105 [2021-06-05 10:30:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:14,391 INFO L482 AbstractCegarLoop]: Abstraction has 3880 states and 10186 transitions. [2021-06-05 10:30:14,391 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3880 states and 10186 transitions. [2021-06-05 10:30:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:30:14,395 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:14,395 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:14,395 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-05 10:30:14,395 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:14,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:14,396 INFO L82 PathProgramCache]: Analyzing trace with hash -193844854, now seen corresponding path program 40 times [2021-06-05 10:30:14,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:14,396 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149071220] [2021-06-05 10:30:14,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:30:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:30:14,768 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:30:14,768 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149071220] [2021-06-05 10:30:14,768 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149071220] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:30:14,768 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:30:14,768 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:30:14,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397476841] [2021-06-05 10:30:14,769 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:30:14,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:30:14,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:30:14,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:30:14,770 INFO L87 Difference]: Start difference. First operand 3880 states and 10186 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:16,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:16,646 INFO L93 Difference]: Finished difference Result 6423 states and 16173 transitions. [2021-06-05 10:30:16,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 10:30:16,647 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:30:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:16,652 INFO L225 Difference]: With dead ends: 6423 [2021-06-05 10:30:16,652 INFO L226 Difference]: Without dead ends: 6423 [2021-06-05 10:30:16,653 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1540.1ms TimeCoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 10:30:16,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6423 states. [2021-06-05 10:30:16,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6423 to 3091. [2021-06-05 10:30:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3091 states, 3089 states have (on average 2.6137908708319846) internal successors, (8074), 3090 states have internal predecessors, (8074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 3091 states and 8074 transitions. [2021-06-05 10:30:16,695 INFO L78 Accepts]: Start accepts. Automaton has 3091 states and 8074 transitions. Word has length 105 [2021-06-05 10:30:16,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:16,695 INFO L482 AbstractCegarLoop]: Abstraction has 3091 states and 8074 transitions. [2021-06-05 10:30:16,695 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3091 states and 8074 transitions. [2021-06-05 10:30:16,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 10:30:16,698 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:16,698 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:16,698 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-05 10:30:16,698 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:16,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:16,698 INFO L82 PathProgramCache]: Analyzing trace with hash -106322846, now seen corresponding path program 41 times [2021-06-05 10:30:16,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:16,699 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298863941] [2021-06-05 10:30:16,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:30:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:30:16,976 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:30:16,976 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298863941] [2021-06-05 10:30:16,976 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298863941] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:30:16,976 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:30:16,976 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:30:16,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991741404] [2021-06-05 10:30:16,977 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:30:16,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:30:16,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:30:16,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:30:16,977 INFO L87 Difference]: Start difference. First operand 3091 states and 8074 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:18,371 INFO L93 Difference]: Finished difference Result 4802 states and 12082 transitions. [2021-06-05 10:30:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 10:30:18,371 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 10:30:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:18,374 INFO L225 Difference]: With dead ends: 4802 [2021-06-05 10:30:18,374 INFO L226 Difference]: Without dead ends: 4802 [2021-06-05 10:30:18,375 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1070.9ms TimeCoverageRelationStatistics Valid=321, Invalid=869, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 10:30:18,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states. [2021-06-05 10:30:18,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 2861. [2021-06-05 10:30:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2860 states have (on average 2.6479020979020977) internal successors, (7573), 2860 states have internal predecessors, (7573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 7573 transitions. [2021-06-05 10:30:18,410 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 7573 transitions. Word has length 105 [2021-06-05 10:30:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:18,410 INFO L482 AbstractCegarLoop]: Abstraction has 2861 states and 7573 transitions. [2021-06-05 10:30:18,410 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 7573 transitions. [2021-06-05 10:30:18,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 10:30:18,412 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:18,412 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:18,413 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-05 10:30:18,413 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:18,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:18,413 INFO L82 PathProgramCache]: Analyzing trace with hash -685691517, now seen corresponding path program 1 times [2021-06-05 10:30:18,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:18,413 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449402917] [2021-06-05 10:30:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:30:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:30:19,173 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:30:19,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449402917] [2021-06-05 10:30:19,174 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449402917] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:30:19,174 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:30:19,174 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-05 10:30:19,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63586883] [2021-06-05 10:30:19,174 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 10:30:19,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:30:19,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 10:30:19,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2021-06-05 10:30:19,175 INFO L87 Difference]: Start difference. First operand 2861 states and 7573 transitions. Second operand has 28 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 28 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:21,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:21,681 INFO L93 Difference]: Finished difference Result 3968 states and 10076 transitions. [2021-06-05 10:30:21,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 10:30:21,681 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 28 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-06-05 10:30:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:21,684 INFO L225 Difference]: With dead ends: 3968 [2021-06-05 10:30:21,684 INFO L226 Difference]: Without dead ends: 3877 [2021-06-05 10:30:21,684 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 2245.8ms TimeCoverageRelationStatistics Valid=464, Invalid=2398, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 10:30:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3877 states. [2021-06-05 10:30:21,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3877 to 2861. [2021-06-05 10:30:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2860 states have (on average 2.644755244755245) internal successors, (7564), 2860 states have internal predecessors, (7564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 7564 transitions. [2021-06-05 10:30:21,718 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 7564 transitions. Word has length 111 [2021-06-05 10:30:21,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:21,718 INFO L482 AbstractCegarLoop]: Abstraction has 2861 states and 7564 transitions. [2021-06-05 10:30:21,718 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 28 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:21,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 7564 transitions. [2021-06-05 10:30:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 10:30:21,720 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:21,721 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:21,721 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-05 10:30:21,721 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:21,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:21,721 INFO L82 PathProgramCache]: Analyzing trace with hash -521604609, now seen corresponding path program 2 times [2021-06-05 10:30:21,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:21,721 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457802637] [2021-06-05 10:30:21,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:30:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:30:22,403 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:30:22,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457802637] [2021-06-05 10:30:22,403 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457802637] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:30:22,403 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:30:22,403 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 10:30:22,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72535323] [2021-06-05 10:30:22,404 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 10:30:22,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:30:22,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 10:30:22,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2021-06-05 10:30:22,405 INFO L87 Difference]: Start difference. First operand 2861 states and 7564 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:24,756 INFO L93 Difference]: Finished difference Result 4103 states and 10475 transitions. [2021-06-05 10:30:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 10:30:24,756 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-06-05 10:30:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:24,760 INFO L225 Difference]: With dead ends: 4103 [2021-06-05 10:30:24,760 INFO L226 Difference]: Without dead ends: 3946 [2021-06-05 10:30:24,761 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2184.2ms TimeCoverageRelationStatistics Valid=433, Invalid=2017, Unknown=0, NotChecked=0, Total=2450 [2021-06-05 10:30:24,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2021-06-05 10:30:24,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3005. [2021-06-05 10:30:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3005 states, 3004 states have (on average 2.633821571238349) internal successors, (7912), 3004 states have internal predecessors, (7912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:24,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 7912 transitions. [2021-06-05 10:30:24,815 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 7912 transitions. Word has length 111 [2021-06-05 10:30:24,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:24,815 INFO L482 AbstractCegarLoop]: Abstraction has 3005 states and 7912 transitions. [2021-06-05 10:30:24,815 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:24,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 7912 transitions. [2021-06-05 10:30:24,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 10:30:24,817 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:24,818 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:24,818 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-05 10:30:24,818 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:24,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:24,818 INFO L82 PathProgramCache]: Analyzing trace with hash 17765309, now seen corresponding path program 3 times [2021-06-05 10:30:24,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:24,818 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855994673] [2021-06-05 10:30:24,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:30:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:30:25,521 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:30:25,521 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855994673] [2021-06-05 10:30:25,521 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855994673] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:30:25,521 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:30:25,521 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 10:30:25,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249002208] [2021-06-05 10:30:25,521 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 10:30:25,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:30:25,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 10:30:25,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-06-05 10:30:25,522 INFO L87 Difference]: Start difference. First operand 3005 states and 7912 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:28,014 INFO L93 Difference]: Finished difference Result 4001 states and 10200 transitions. [2021-06-05 10:30:28,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 10:30:28,014 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-06-05 10:30:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:28,018 INFO L225 Difference]: With dead ends: 4001 [2021-06-05 10:30:28,018 INFO L226 Difference]: Without dead ends: 3910 [2021-06-05 10:30:28,019 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 2324.9ms TimeCoverageRelationStatistics Valid=450, Invalid=2100, Unknown=0, NotChecked=0, Total=2550 [2021-06-05 10:30:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3910 states. [2021-06-05 10:30:28,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3910 to 2969. [2021-06-05 10:30:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2969 states, 2968 states have (on average 2.6334231805929917) internal successors, (7816), 2968 states have internal predecessors, (7816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2969 states to 2969 states and 7816 transitions. [2021-06-05 10:30:28,051 INFO L78 Accepts]: Start accepts. Automaton has 2969 states and 7816 transitions. Word has length 111 [2021-06-05 10:30:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:28,051 INFO L482 AbstractCegarLoop]: Abstraction has 2969 states and 7816 transitions. [2021-06-05 10:30:28,051 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2969 states and 7816 transitions. [2021-06-05 10:30:28,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 10:30:28,053 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:28,053 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:28,053 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-05 10:30:28,053 INFO L430 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:28,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:28,054 INFO L82 PathProgramCache]: Analyzing trace with hash -217387965, now seen corresponding path program 4 times [2021-06-05 10:30:28,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:28,054 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334747583] [2021-06-05 10:30:28,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:30:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:30:28,798 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:30:28,798 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334747583] [2021-06-05 10:30:28,799 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334747583] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:30:28,799 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:30:28,799 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 10:30:28,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018198126] [2021-06-05 10:30:28,799 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 10:30:28,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:30:28,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 10:30:28,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2021-06-05 10:30:28,800 INFO L87 Difference]: Start difference. First operand 2969 states and 7816 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:30,310 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2021-06-05 10:30:30,475 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2021-06-05 10:30:31,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:31,107 INFO L93 Difference]: Finished difference Result 3940 states and 10067 transitions. [2021-06-05 10:30:31,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 10:30:31,108 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-06-05 10:30:31,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:31,111 INFO L225 Difference]: With dead ends: 3940 [2021-06-05 10:30:31,111 INFO L226 Difference]: Without dead ends: 3801 [2021-06-05 10:30:31,112 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 2214.4ms TimeCoverageRelationStatistics Valid=402, Invalid=1950, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 10:30:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3801 states. [2021-06-05 10:30:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3801 to 2897. [2021-06-05 10:30:31,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2897 states, 2896 states have (on average 2.632596685082873) internal successors, (7624), 2896 states have internal predecessors, (7624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:31,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 7624 transitions. [2021-06-05 10:30:31,142 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 7624 transitions. Word has length 111 [2021-06-05 10:30:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:31,142 INFO L482 AbstractCegarLoop]: Abstraction has 2897 states and 7624 transitions. [2021-06-05 10:30:31,142 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 7624 transitions. [2021-06-05 10:30:31,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 10:30:31,144 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:31,144 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:31,144 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-06-05 10:30:31,144 INFO L430 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:31,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:31,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1564019739, now seen corresponding path program 5 times [2021-06-05 10:30:31,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:31,145 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439038852] [2021-06-05 10:30:31,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:30:31,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:30:31,868 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:30:31,868 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439038852] [2021-06-05 10:30:31,868 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439038852] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:30:31,868 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:30:31,868 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 10:30:31,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902040019] [2021-06-05 10:30:31,868 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 10:30:31,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:30:31,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 10:30:31,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-06-05 10:30:31,869 INFO L87 Difference]: Start difference. First operand 2897 states and 7624 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:34,192 INFO L93 Difference]: Finished difference Result 3874 states and 9888 transitions. [2021-06-05 10:30:34,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 10:30:34,192 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-06-05 10:30:34,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:34,196 INFO L225 Difference]: With dead ends: 3874 [2021-06-05 10:30:34,196 INFO L226 Difference]: Without dead ends: 3657 [2021-06-05 10:30:34,196 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 2093.2ms TimeCoverageRelationStatistics Valid=405, Invalid=1947, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 10:30:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2021-06-05 10:30:34,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 2753. [2021-06-05 10:30:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2753 states, 2752 states have (on average 2.6340843023255816) internal successors, (7249), 2752 states have internal predecessors, (7249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 7249 transitions. [2021-06-05 10:30:34,229 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 7249 transitions. Word has length 111 [2021-06-05 10:30:34,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:34,230 INFO L482 AbstractCegarLoop]: Abstraction has 2753 states and 7249 transitions. [2021-06-05 10:30:34,230 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 7249 transitions. [2021-06-05 10:30:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 10:30:34,232 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:34,232 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:34,232 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-06-05 10:30:34,232 INFO L430 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:34,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:34,232 INFO L82 PathProgramCache]: Analyzing trace with hash 857328187, now seen corresponding path program 6 times [2021-06-05 10:30:34,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:34,233 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737730216] [2021-06-05 10:30:34,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:30:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:30:35,015 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:30:35,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737730216] [2021-06-05 10:30:35,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737730216] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:30:35,015 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:30:35,015 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-05 10:30:35,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158053805] [2021-06-05 10:30:35,015 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 10:30:35,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:30:35,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 10:30:35,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2021-06-05 10:30:35,016 INFO L87 Difference]: Start difference. First operand 2753 states and 7249 transitions. Second operand has 30 states, 30 states have (on average 3.7) internal successors, (111), 30 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:30:37,851 INFO L93 Difference]: Finished difference Result 3749 states and 9472 transitions. [2021-06-05 10:30:37,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 10:30:37,851 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.7) internal successors, (111), 30 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-06-05 10:30:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:30:37,855 INFO L225 Difference]: With dead ends: 3749 [2021-06-05 10:30:37,855 INFO L226 Difference]: Without dead ends: 3658 [2021-06-05 10:30:37,855 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 2609.4ms TimeCoverageRelationStatistics Valid=582, Invalid=2958, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 10:30:37,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3658 states. [2021-06-05 10:30:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 2759. [2021-06-05 10:30:37,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2759 states, 2758 states have (on average 2.6316171138506164) internal successors, (7258), 2758 states have internal predecessors, (7258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:37,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 7258 transitions. [2021-06-05 10:30:37,888 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 7258 transitions. Word has length 111 [2021-06-05 10:30:37,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:30:37,889 INFO L482 AbstractCegarLoop]: Abstraction has 2759 states and 7258 transitions. [2021-06-05 10:30:37,889 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 3.7) internal successors, (111), 30 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:30:37,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 7258 transitions. [2021-06-05 10:30:37,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 10:30:37,891 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:30:37,891 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:30:37,891 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-06-05 10:30:37,891 INFO L430 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:30:37,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:30:37,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1824706281, now seen corresponding path program 7 times [2021-06-05 10:30:37,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:30:37,891 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200114046] [2021-06-05 10:30:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:30:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:30:37,920 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:30:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:30:37,946 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:30:37,984 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 10:30:37,985 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 10:30:37,985 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-06-05 10:30:37,987 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 10:30:38,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 10:30:38 BasicIcfg [2021-06-05 10:30:38,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 10:30:38,061 INFO L168 Benchmark]: Toolchain (without parser) took 95305.59 ms. Allocated memory was 364.9 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 325.7 MB in the beginning and 792.5 MB in the end (delta: -466.8 MB). Peak memory consumption was 747.5 MB. Max. memory is 16.0 GB. [2021-06-05 10:30:38,061 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 364.9 MB. Free memory is still 345.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 10:30:38,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1144.57 ms. Allocated memory is still 364.9 MB. Free memory was 325.4 MB in the beginning and 292.3 MB in the end (delta: 33.1 MB). Peak memory consumption was 60.7 MB. Max. memory is 16.0 GB. [2021-06-05 10:30:38,061 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.63 ms. Allocated memory is still 364.9 MB. Free memory was 292.3 MB in the beginning and 289.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 10:30:38,061 INFO L168 Benchmark]: Boogie Preprocessor took 41.84 ms. Allocated memory is still 364.9 MB. Free memory was 289.2 MB in the beginning and 286.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-05 10:30:38,061 INFO L168 Benchmark]: RCFGBuilder took 641.24 ms. Allocated memory was 364.9 MB in the beginning and 461.4 MB in the end (delta: 96.5 MB). Free memory was 286.0 MB in the beginning and 424.4 MB in the end (delta: -138.4 MB). Peak memory consumption was 38.8 MB. Max. memory is 16.0 GB. [2021-06-05 10:30:38,061 INFO L168 Benchmark]: TraceAbstraction took 93382.81 ms. Allocated memory was 461.4 MB in the beginning and 1.6 GB in the end (delta: 1.1 GB). Free memory was 423.4 MB in the beginning and 792.5 MB in the end (delta: -369.1 MB). Peak memory consumption was 745.5 MB. Max. memory is 16.0 GB. [2021-06-05 10:30:38,062 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 364.9 MB. Free memory is still 345.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 1144.57 ms. Allocated memory is still 364.9 MB. Free memory was 325.4 MB in the beginning and 292.3 MB in the end (delta: 33.1 MB). Peak memory consumption was 60.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 78.63 ms. Allocated memory is still 364.9 MB. Free memory was 292.3 MB in the beginning and 289.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 41.84 ms. Allocated memory is still 364.9 MB. Free memory was 289.2 MB in the beginning and 286.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 641.24 ms. Allocated memory was 364.9 MB in the beginning and 461.4 MB in the end (delta: 96.5 MB). Free memory was 286.0 MB in the beginning and 424.4 MB in the end (delta: -138.4 MB). Peak memory consumption was 38.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 93382.81 ms. Allocated memory was 461.4 MB in the beginning and 1.6 GB in the end (delta: 1.1 GB). Free memory was 423.4 MB in the beginning and 792.5 MB in the end (delta: -369.1 MB). Peak memory consumption was 745.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; VAL [t1={7:0}, t2={8:0}] [L1688] 0 struct device *my_dev; VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1727] 0 return 0; VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1733] 0 int ret = my_drv_init(); VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1734] COND TRUE 0 ret==0 VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1735] 0 int probe_ret; VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1736] 0 struct my_data data; VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1705] 0 data->shared.a = 0 VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1706] 0 data->shared.b = 0 VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1707] 0 data->shared.a VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1675] COND FALSE 0 !(!expression) VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1708] 0 data->shared.b VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1675] COND FALSE 0 !(!expression) VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1709] 0 int res = __VERIFIER_nondet_int(); VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1710] COND FALSE 0 !(\read(res)) VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1712] 0 my_dev = &data->dev VAL [my_dev={9:24}, t1={7:0}, t2={8:0}] [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1690] 1 struct my_data *data; VAL [arg={0:0}, arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1690] 2 struct my_data *data; VAL [arg={0:0}, arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1693] 2 data->shared.a = 1 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1715] 0 return 0; VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1737] 0 probe_ret = my_drv_probe(&data) VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1738] COND TRUE 0 probe_ret==0 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1721] 0 void *status; VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1722] 0 \read(t1) VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1693] 1 data->shared.a = 1 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1699] 1 data->shared.b = lb + 1 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1701] 1 return 0; VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1699] 2 data->shared.b = lb + 1 VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1701] 2 return 0; VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1740] 0 data.shared.a VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1675] COND FALSE 0 !(!expression) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1741] 0 data.shared.b VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1675] COND TRUE 0 !expression VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1675] 0 reach_error() VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 164 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 93172.2ms, OverallIterations: 55, TraceHistogramMax: 1, EmptinessCheckTime: 249.8ms, AutomataDifference: 67578.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 181.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 10347 SDtfs, 31869 SDslu, 73876 SDs, 0 SdLazy, 36368 SolverSat, 2833 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18337.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1990 GetRequests, 168 SyntacticMatches, 62 SemanticMatches, 1760 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10381 ImplicationChecksByTransitivity, 56353.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4325occurred in iteration=4, InterpolantAutomatonStates: 1167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3186.3ms AutomataMinimizationTime, 54 MinimizatonAttempts, 63363 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 135.5ms SsaConstructionTime, 990.5ms SatisfiabilityAnalysisTime, 20015.2ms InterpolantComputationTime, 5574 NumberOfCodeBlocks, 5574 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 5409 ConstructedInterpolants, 0 QuantifiedInterpolants, 75013 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 54 InterpolantComputations, 54 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...