/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 01:49:05,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 01:49:05,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 01:49:05,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 01:49:05,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 01:49:05,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 01:49:05,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 01:49:05,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 01:49:05,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 01:49:05,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 01:49:05,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 01:49:05,706 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 01:49:05,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 01:49:05,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 01:49:05,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 01:49:05,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 01:49:05,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 01:49:05,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 01:49:05,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 01:49:05,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 01:49:05,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 01:49:05,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 01:49:05,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 01:49:05,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 01:49:05,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 01:49:05,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 01:49:05,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 01:49:05,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 01:49:05,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 01:49:05,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 01:49:05,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 01:49:05,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 01:49:05,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 01:49:05,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 01:49:05,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 01:49:05,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 01:49:05,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 01:49:05,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 01:49:05,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 01:49:05,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 01:49:05,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 01:49:05,758 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 01:49:05,786 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 01:49:05,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 01:49:05,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 01:49:05,787 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 01:49:05,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 01:49:05,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 01:49:05,791 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 01:49:05,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 01:49:05,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 01:49:05,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 01:49:05,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 01:49:05,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 01:49:05,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 01:49:05,792 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 01:49:05,792 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 01:49:05,792 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 01:49:05,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 01:49:05,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 01:49:05,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 01:49:05,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 01:49:05,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 01:49:05,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:49:05,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 01:49:05,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 01:49:05,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 01:49:05,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 01:49:05,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 01:49:05,793 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 01:49:05,793 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 01:49:05,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 01:49:05,793 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 01:49:05,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 01:49:05,794 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 01:49:05,794 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 01:49:06,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 01:49:06,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 01:49:06,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 01:49:06,082 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 01:49:06,083 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 01:49:06,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-1.c [2022-01-11 01:49:06,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d52ad9cdb/d0e0bb5096ec4707ad416aaae8721542/FLAG95bf67da4 [2022-01-11 01:49:06,593 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 01:49:06,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-1.c [2022-01-11 01:49:06,612 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d52ad9cdb/d0e0bb5096ec4707ad416aaae8721542/FLAG95bf67da4 [2022-01-11 01:49:06,954 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d52ad9cdb/d0e0bb5096ec4707ad416aaae8721542 [2022-01-11 01:49:06,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 01:49:06,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 01:49:06,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 01:49:06,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 01:49:06,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 01:49:06,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:49:06" (1/1) ... [2022-01-11 01:49:06,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fd6be60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:49:06, skipping insertion in model container [2022-01-11 01:49:06,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:49:06" (1/1) ... [2022-01-11 01:49:06,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 01:49:07,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 01:49:07,237 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-1.c[914,927] [2022-01-11 01:49:07,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-1.c[7115,7128] [2022-01-11 01:49:07,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:49:07,401 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 01:49:07,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-1.c[914,927] [2022-01-11 01:49:07,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-1.c[7115,7128] [2022-01-11 01:49:07,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:49:07,517 INFO L208 MainTranslator]: Completed translation [2022-01-11 01:49:07,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:49:07 WrapperNode [2022-01-11 01:49:07,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 01:49:07,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 01:49:07,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 01:49:07,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 01:49:07,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:49:07" (1/1) ... [2022-01-11 01:49:07,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:49:07" (1/1) ... [2022-01-11 01:49:07,631 INFO L137 Inliner]: procedures = 70, calls = 81, calls flagged for inlining = 76, calls inlined = 184, statements flattened = 2659 [2022-01-11 01:49:07,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 01:49:07,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 01:49:07,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 01:49:07,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 01:49:07,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:49:07" (1/1) ... [2022-01-11 01:49:07,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:49:07" (1/1) ... [2022-01-11 01:49:07,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:49:07" (1/1) ... [2022-01-11 01:49:07,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:49:07" (1/1) ... [2022-01-11 01:49:07,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:49:07" (1/1) ... [2022-01-11 01:49:07,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:49:07" (1/1) ... [2022-01-11 01:49:07,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:49:07" (1/1) ... [2022-01-11 01:49:07,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 01:49:07,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 01:49:07,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 01:49:07,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 01:49:07,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:49:07" (1/1) ... [2022-01-11 01:49:07,759 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:49:07,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:49:07,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 01:49:07,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 01:49:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 01:49:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 01:49:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 01:49:07,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 01:49:07,979 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 01:49:07,981 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 01:49:09,545 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 01:49:09,564 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 01:49:09,565 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-01-11 01:49:09,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:49:09 BoogieIcfgContainer [2022-01-11 01:49:09,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 01:49:09,572 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 01:49:09,572 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 01:49:09,573 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 01:49:09,576 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:49:09" (1/1) ... [2022-01-11 01:49:09,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:49:09 BasicIcfg [2022-01-11 01:49:09,923 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 01:49:09,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 01:49:09,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 01:49:09,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 01:49:09,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 01:49:06" (1/4) ... [2022-01-11 01:49:09,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d02c8cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:49:09, skipping insertion in model container [2022-01-11 01:49:09,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:49:07" (2/4) ... [2022-01-11 01:49:09,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d02c8cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:49:09, skipping insertion in model container [2022-01-11 01:49:09,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:49:09" (3/4) ... [2022-01-11 01:49:09,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d02c8cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:49:09, skipping insertion in model container [2022-01-11 01:49:09,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:49:09" (4/4) ... [2022-01-11 01:49:09,932 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.08.cil-1.cTransformedIcfg [2022-01-11 01:49:09,936 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 01:49:09,936 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-11 01:49:09,989 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 01:49:09,995 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 01:49:09,996 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-11 01:49:10,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 1103 states, 1099 states have (on average 1.5204731574158326) internal successors, (1671), 1102 states have internal predecessors, (1671), 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) [2022-01-11 01:49:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:49:10,041 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:10,041 INFO L514 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] [2022-01-11 01:49:10,042 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:10,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1121874356, now seen corresponding path program 1 times [2022-01-11 01:49:10,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:10,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622375376] [2022-01-11 01:49:10,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:10,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:10,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:10,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622375376] [2022-01-11 01:49:10,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622375376] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:10,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:10,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:10,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369813637] [2022-01-11 01:49:10,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:10,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:10,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:10,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:10,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:10,451 INFO L87 Difference]: Start difference. First operand has 1103 states, 1099 states have (on average 1.5204731574158326) internal successors, (1671), 1102 states have internal predecessors, (1671), 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 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-11 01:49:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:10,603 INFO L93 Difference]: Finished difference Result 2175 states and 3284 transitions. [2022-01-11 01:49:10,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:10,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2022-01-11 01:49:10,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:10,628 INFO L225 Difference]: With dead ends: 2175 [2022-01-11 01:49:10,628 INFO L226 Difference]: Without dead ends: 1187 [2022-01-11 01:49:10,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:10,642 INFO L933 BasicCegarLoop]: 1631 mSDtfsCounter, 124 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 3232 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:10,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 3232 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:49:10,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2022-01-11 01:49:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1183. [2022-01-11 01:49:10,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1180 states have (on average 1.4822033898305085) internal successors, (1749), 1182 states have internal predecessors, (1749), 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) [2022-01-11 01:49:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1749 transitions. [2022-01-11 01:49:10,753 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1749 transitions. Word has length 44 [2022-01-11 01:49:10,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:10,754 INFO L470 AbstractCegarLoop]: Abstraction has 1183 states and 1749 transitions. [2022-01-11 01:49:10,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-11 01:49:10,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1749 transitions. [2022-01-11 01:49:10,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:49:10,757 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:10,757 INFO L514 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] [2022-01-11 01:49:10,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 01:49:10,757 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:10,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:10,758 INFO L85 PathProgramCache]: Analyzing trace with hash -352308881, now seen corresponding path program 1 times [2022-01-11 01:49:10,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:10,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798392487] [2022-01-11 01:49:10,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:10,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:10,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:10,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798392487] [2022-01-11 01:49:10,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798392487] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:10,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:10,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:10,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587010158] [2022-01-11 01:49:10,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:10,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:10,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:10,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:10,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:10,844 INFO L87 Difference]: Start difference. First operand 1183 states and 1749 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-11 01:49:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:10,903 INFO L93 Difference]: Finished difference Result 1469 states and 2147 transitions. [2022-01-11 01:49:10,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:10,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2022-01-11 01:49:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:10,909 INFO L225 Difference]: With dead ends: 1469 [2022-01-11 01:49:10,910 INFO L226 Difference]: Without dead ends: 1339 [2022-01-11 01:49:10,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:10,912 INFO L933 BasicCegarLoop]: 1624 mSDtfsCounter, 1587 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:10,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1587 Valid, 1742 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:10,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2022-01-11 01:49:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1335. [2022-01-11 01:49:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 1332 states have (on average 1.4677177177177176) internal successors, (1955), 1334 states have internal predecessors, (1955), 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) [2022-01-11 01:49:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1955 transitions. [2022-01-11 01:49:10,955 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1955 transitions. Word has length 44 [2022-01-11 01:49:10,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:10,956 INFO L470 AbstractCegarLoop]: Abstraction has 1335 states and 1955 transitions. [2022-01-11 01:49:10,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-11 01:49:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1955 transitions. [2022-01-11 01:49:10,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 01:49:10,967 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:10,967 INFO L514 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] [2022-01-11 01:49:10,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 01:49:10,970 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:10,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:10,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1105312476, now seen corresponding path program 1 times [2022-01-11 01:49:10,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:10,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32888506] [2022-01-11 01:49:10,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:10,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:11,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:11,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32888506] [2022-01-11 01:49:11,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32888506] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:11,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:11,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:11,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49935071] [2022-01-11 01:49:11,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:11,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:11,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:11,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:11,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:11,061 INFO L87 Difference]: Start difference. First operand 1335 states and 1955 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2022-01-11 01:49:11,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:11,126 INFO L93 Difference]: Finished difference Result 1883 states and 2715 transitions. [2022-01-11 01:49:11,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:11,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 45 [2022-01-11 01:49:11,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:11,133 INFO L225 Difference]: With dead ends: 1883 [2022-01-11 01:49:11,133 INFO L226 Difference]: Without dead ends: 1548 [2022-01-11 01:49:11,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:11,135 INFO L933 BasicCegarLoop]: 1619 mSDtfsCounter, 94 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 3182 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:11,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 3182 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:11,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2022-01-11 01:49:11,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1534. [2022-01-11 01:49:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1531 states have (on average 1.4519921619856304) internal successors, (2223), 1533 states have internal predecessors, (2223), 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) [2022-01-11 01:49:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2223 transitions. [2022-01-11 01:49:11,251 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 2223 transitions. Word has length 45 [2022-01-11 01:49:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:11,251 INFO L470 AbstractCegarLoop]: Abstraction has 1534 states and 2223 transitions. [2022-01-11 01:49:11,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2022-01-11 01:49:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2223 transitions. [2022-01-11 01:49:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 01:49:11,252 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:11,252 INFO L514 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] [2022-01-11 01:49:11,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 01:49:11,253 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:11,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:11,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1075730013, now seen corresponding path program 1 times [2022-01-11 01:49:11,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:11,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453822612] [2022-01-11 01:49:11,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:11,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:11,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:11,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453822612] [2022-01-11 01:49:11,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453822612] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:11,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:11,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:11,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127178603] [2022-01-11 01:49:11,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:11,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:11,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:11,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:11,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:11,328 INFO L87 Difference]: Start difference. First operand 1534 states and 2223 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2022-01-11 01:49:11,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:11,404 INFO L93 Difference]: Finished difference Result 2422 states and 3435 transitions. [2022-01-11 01:49:11,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:11,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 45 [2022-01-11 01:49:11,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:11,412 INFO L225 Difference]: With dead ends: 2422 [2022-01-11 01:49:11,413 INFO L226 Difference]: Without dead ends: 1946 [2022-01-11 01:49:11,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:11,415 INFO L933 BasicCegarLoop]: 1619 mSDtfsCounter, 1575 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:11,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1575 Valid, 1708 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:11,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2022-01-11 01:49:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1914. [2022-01-11 01:49:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1911 states have (on average 1.424908424908425) internal successors, (2723), 1913 states have internal predecessors, (2723), 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) [2022-01-11 01:49:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2723 transitions. [2022-01-11 01:49:11,477 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2723 transitions. Word has length 45 [2022-01-11 01:49:11,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:11,477 INFO L470 AbstractCegarLoop]: Abstraction has 1914 states and 2723 transitions. [2022-01-11 01:49:11,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2022-01-11 01:49:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2723 transitions. [2022-01-11 01:49:11,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 01:49:11,478 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:11,479 INFO L514 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] [2022-01-11 01:49:11,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 01:49:11,479 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:11,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:11,479 INFO L85 PathProgramCache]: Analyzing trace with hash 449641631, now seen corresponding path program 1 times [2022-01-11 01:49:11,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:11,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868510106] [2022-01-11 01:49:11,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:11,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:11,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:11,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868510106] [2022-01-11 01:49:11,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868510106] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:11,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:11,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:11,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863929885] [2022-01-11 01:49:11,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:11,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:11,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:11,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:11,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:11,542 INFO L87 Difference]: Start difference. First operand 1914 states and 2723 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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) [2022-01-11 01:49:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:11,621 INFO L93 Difference]: Finished difference Result 3117 states and 4336 transitions. [2022-01-11 01:49:11,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:11,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2022-01-11 01:49:11,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:11,630 INFO L225 Difference]: With dead ends: 3117 [2022-01-11 01:49:11,630 INFO L226 Difference]: Without dead ends: 2233 [2022-01-11 01:49:11,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:11,633 INFO L933 BasicCegarLoop]: 1623 mSDtfsCounter, 1572 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:11,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1572 Valid, 1712 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:11,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2022-01-11 01:49:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2211. [2022-01-11 01:49:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2211 states, 2208 states have (on average 1.4076086956521738) internal successors, (3108), 2210 states have internal predecessors, (3108), 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) [2022-01-11 01:49:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 3108 transitions. [2022-01-11 01:49:11,708 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 3108 transitions. Word has length 51 [2022-01-11 01:49:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:11,730 INFO L470 AbstractCegarLoop]: Abstraction has 2211 states and 3108 transitions. [2022-01-11 01:49:11,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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) [2022-01-11 01:49:11,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 3108 transitions. [2022-01-11 01:49:11,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:49:11,732 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:11,732 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:11,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 01:49:11,734 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:11,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:11,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1325444300, now seen corresponding path program 1 times [2022-01-11 01:49:11,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:11,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493837014] [2022-01-11 01:49:11,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:11,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:49:11,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:11,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493837014] [2022-01-11 01:49:11,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493837014] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:11,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:11,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:49:11,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584267294] [2022-01-11 01:49:11,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:11,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:49:11,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:11,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:49:11,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:49:11,833 INFO L87 Difference]: Start difference. First operand 2211 states and 3108 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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) [2022-01-11 01:49:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:12,012 INFO L93 Difference]: Finished difference Result 3837 states and 5312 transitions. [2022-01-11 01:49:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:49:12,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 52 [2022-01-11 01:49:12,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:12,024 INFO L225 Difference]: With dead ends: 3837 [2022-01-11 01:49:12,024 INFO L226 Difference]: Without dead ends: 2886 [2022-01-11 01:49:12,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:49:12,032 INFO L933 BasicCegarLoop]: 1612 mSDtfsCounter, 395 mSDsluCounter, 4945 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 6557 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:12,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 6557 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2022-01-11 01:49:12,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2235. [2022-01-11 01:49:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2235 states, 2232 states have (on average 1.3951612903225807) internal successors, (3114), 2234 states have internal predecessors, (3114), 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) [2022-01-11 01:49:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 3114 transitions. [2022-01-11 01:49:12,133 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 3114 transitions. Word has length 52 [2022-01-11 01:49:12,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:12,134 INFO L470 AbstractCegarLoop]: Abstraction has 2235 states and 3114 transitions. [2022-01-11 01:49:12,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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) [2022-01-11 01:49:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 3114 transitions. [2022-01-11 01:49:12,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:49:12,135 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:12,136 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:12,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 01:49:12,136 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:12,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:12,136 INFO L85 PathProgramCache]: Analyzing trace with hash 624855955, now seen corresponding path program 1 times [2022-01-11 01:49:12,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:12,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223305824] [2022-01-11 01:49:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:12,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:49:12,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:12,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223305824] [2022-01-11 01:49:12,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223305824] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:12,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:12,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:49:12,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612577662] [2022-01-11 01:49:12,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:12,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:49:12,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:12,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:49:12,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:49:12,212 INFO L87 Difference]: Start difference. First operand 2235 states and 3114 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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) [2022-01-11 01:49:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:12,429 INFO L93 Difference]: Finished difference Result 3990 states and 5463 transitions. [2022-01-11 01:49:12,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:49:12,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 52 [2022-01-11 01:49:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:12,441 INFO L225 Difference]: With dead ends: 3990 [2022-01-11 01:49:12,441 INFO L226 Difference]: Without dead ends: 2825 [2022-01-11 01:49:12,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:49:12,446 INFO L933 BasicCegarLoop]: 1611 mSDtfsCounter, 354 mSDsluCounter, 4962 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 6573 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:12,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 6573 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:12,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2825 states. [2022-01-11 01:49:12,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2825 to 2253. [2022-01-11 01:49:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 2250 states have (on average 1.3831111111111112) internal successors, (3112), 2252 states have internal predecessors, (3112), 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) [2022-01-11 01:49:12,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3112 transitions. [2022-01-11 01:49:12,589 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3112 transitions. Word has length 52 [2022-01-11 01:49:12,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:12,589 INFO L470 AbstractCegarLoop]: Abstraction has 2253 states and 3112 transitions. [2022-01-11 01:49:12,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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) [2022-01-11 01:49:12,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3112 transitions. [2022-01-11 01:49:12,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:49:12,592 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:12,592 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:12,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 01:49:12,593 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:12,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:12,593 INFO L85 PathProgramCache]: Analyzing trace with hash 636172082, now seen corresponding path program 1 times [2022-01-11 01:49:12,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:12,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809322166] [2022-01-11 01:49:12,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:12,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:12,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:12,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809322166] [2022-01-11 01:49:12,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809322166] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:12,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:12,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 01:49:12,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870297640] [2022-01-11 01:49:12,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:12,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 01:49:12,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:12,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 01:49:12,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 01:49:12,699 INFO L87 Difference]: Start difference. First operand 2253 states and 3112 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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) [2022-01-11 01:49:12,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:12,876 INFO L93 Difference]: Finished difference Result 2485 states and 3412 transitions. [2022-01-11 01:49:12,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 01:49:12,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2022-01-11 01:49:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:12,887 INFO L225 Difference]: With dead ends: 2485 [2022-01-11 01:49:12,888 INFO L226 Difference]: Without dead ends: 2483 [2022-01-11 01:49:12,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:49:12,889 INFO L933 BasicCegarLoop]: 1620 mSDtfsCounter, 3283 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3283 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:12,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3283 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:12,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2022-01-11 01:49:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2251. [2022-01-11 01:49:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2251 states, 2249 states have (on average 1.3797243219208537) internal successors, (3103), 2250 states have internal predecessors, (3103), 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) [2022-01-11 01:49:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 3103 transitions. [2022-01-11 01:49:13,056 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 3103 transitions. Word has length 52 [2022-01-11 01:49:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:13,057 INFO L470 AbstractCegarLoop]: Abstraction has 2251 states and 3103 transitions. [2022-01-11 01:49:13,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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) [2022-01-11 01:49:13,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 3103 transitions. [2022-01-11 01:49:13,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-11 01:49:13,059 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:13,059 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:13,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 01:49:13,060 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:13,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:13,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1753498594, now seen corresponding path program 1 times [2022-01-11 01:49:13,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:13,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248735411] [2022-01-11 01:49:13,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:13,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:13,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:13,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248735411] [2022-01-11 01:49:13,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248735411] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 01:49:13,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081132015] [2022-01-11 01:49:13,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:13,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:49:13,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:49:13,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 01:49:13,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 01:49:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:13,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-11 01:49:13,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 01:49:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:13,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 01:49:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:14,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081132015] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 01:49:14,096 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 01:49:14,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-11 01:49:14,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656500865] [2022-01-11 01:49:14,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 01:49:14,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 01:49:14,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:14,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 01:49:14,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:49:14,099 INFO L87 Difference]: Start difference. First operand 2251 states and 3103 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 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) [2022-01-11 01:49:14,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:14,814 INFO L93 Difference]: Finished difference Result 4608 states and 6203 transitions. [2022-01-11 01:49:14,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 01:49:14,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 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 53 [2022-01-11 01:49:14,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:14,835 INFO L225 Difference]: With dead ends: 4608 [2022-01-11 01:49:14,836 INFO L226 Difference]: Without dead ends: 4606 [2022-01-11 01:49:14,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:49:14,840 INFO L933 BasicCegarLoop]: 1771 mSDtfsCounter, 3806 mSDsluCounter, 3819 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3806 SdHoareTripleChecker+Valid, 5590 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:14,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3806 Valid, 5590 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:14,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4606 states. [2022-01-11 01:49:15,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4606 to 3226. [2022-01-11 01:49:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3226 states, 3224 states have (on average 1.3598014888337469) internal successors, (4384), 3225 states have internal predecessors, (4384), 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) [2022-01-11 01:49:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 4384 transitions. [2022-01-11 01:49:15,198 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 4384 transitions. Word has length 53 [2022-01-11 01:49:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:15,198 INFO L470 AbstractCegarLoop]: Abstraction has 3226 states and 4384 transitions. [2022-01-11 01:49:15,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 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) [2022-01-11 01:49:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 4384 transitions. [2022-01-11 01:49:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:49:15,200 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:15,200 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:15,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 01:49:15,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:49:15,416 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:15,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:15,416 INFO L85 PathProgramCache]: Analyzing trace with hash 892927876, now seen corresponding path program 2 times [2022-01-11 01:49:15,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:15,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694402970] [2022-01-11 01:49:15,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:15,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:15,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:15,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694402970] [2022-01-11 01:49:15,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694402970] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:15,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:15,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:15,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963269750] [2022-01-11 01:49:15,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:15,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:15,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:15,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:15,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:15,470 INFO L87 Difference]: Start difference. First operand 3226 states and 4384 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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) [2022-01-11 01:49:15,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:15,686 INFO L93 Difference]: Finished difference Result 4320 states and 5829 transitions. [2022-01-11 01:49:15,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:15,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 56 [2022-01-11 01:49:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:15,696 INFO L225 Difference]: With dead ends: 4320 [2022-01-11 01:49:15,696 INFO L226 Difference]: Without dead ends: 2580 [2022-01-11 01:49:15,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:15,700 INFO L933 BasicCegarLoop]: 1683 mSDtfsCounter, 1566 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:15,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1566 Valid, 1799 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:15,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2022-01-11 01:49:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2564. [2022-01-11 01:49:15,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2562 states have (on average 1.3583138173302107) internal successors, (3480), 2563 states have internal predecessors, (3480), 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) [2022-01-11 01:49:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3480 transitions. [2022-01-11 01:49:15,951 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3480 transitions. Word has length 56 [2022-01-11 01:49:15,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:15,951 INFO L470 AbstractCegarLoop]: Abstraction has 2564 states and 3480 transitions. [2022-01-11 01:49:15,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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) [2022-01-11 01:49:15,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3480 transitions. [2022-01-11 01:49:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-11 01:49:15,953 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:15,953 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:15,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 01:49:15,953 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:15,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:15,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1306329824, now seen corresponding path program 1 times [2022-01-11 01:49:15,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:15,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411369264] [2022-01-11 01:49:15,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:15,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:16,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:16,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411369264] [2022-01-11 01:49:16,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411369264] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:16,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:16,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:16,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475562728] [2022-01-11 01:49:16,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:16,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:16,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:16,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:16,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:16,003 INFO L87 Difference]: Start difference. First operand 2564 states and 3480 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 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) [2022-01-11 01:49:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:16,338 INFO L93 Difference]: Finished difference Result 5051 states and 6628 transitions. [2022-01-11 01:49:16,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:16,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 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 [2022-01-11 01:49:16,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:16,349 INFO L225 Difference]: With dead ends: 5051 [2022-01-11 01:49:16,349 INFO L226 Difference]: Without dead ends: 2949 [2022-01-11 01:49:16,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:16,352 INFO L933 BasicCegarLoop]: 1706 mSDtfsCounter, 89 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 3308 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:16,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 3308 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2022-01-11 01:49:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2949. [2022-01-11 01:49:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2947 states have (on average 1.336613505259586) internal successors, (3939), 2948 states have internal predecessors, (3939), 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) [2022-01-11 01:49:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3939 transitions. [2022-01-11 01:49:16,562 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3939 transitions. Word has length 60 [2022-01-11 01:49:16,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:16,562 INFO L470 AbstractCegarLoop]: Abstraction has 2949 states and 3939 transitions. [2022-01-11 01:49:16,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 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) [2022-01-11 01:49:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3939 transitions. [2022-01-11 01:49:16,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-11 01:49:16,565 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:16,565 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:16,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 01:49:16,566 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:16,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:16,566 INFO L85 PathProgramCache]: Analyzing trace with hash 888236698, now seen corresponding path program 1 times [2022-01-11 01:49:16,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:16,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331698626] [2022-01-11 01:49:16,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:16,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:49:16,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:16,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331698626] [2022-01-11 01:49:16,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331698626] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:16,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:16,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:16,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118590895] [2022-01-11 01:49:16,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:16,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:16,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:16,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:16,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:16,606 INFO L87 Difference]: Start difference. First operand 2949 states and 3939 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2022-01-11 01:49:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:16,844 INFO L93 Difference]: Finished difference Result 4812 states and 6291 transitions. [2022-01-11 01:49:16,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:16,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 68 [2022-01-11 01:49:16,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:16,852 INFO L225 Difference]: With dead ends: 4812 [2022-01-11 01:49:16,853 INFO L226 Difference]: Without dead ends: 2949 [2022-01-11 01:49:16,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:16,856 INFO L933 BasicCegarLoop]: 1615 mSDtfsCounter, 1558 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:16,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1558 Valid, 1699 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:16,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2022-01-11 01:49:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2949. [2022-01-11 01:49:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2947 states have (on average 1.323040380047506) internal successors, (3899), 2948 states have internal predecessors, (3899), 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) [2022-01-11 01:49:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3899 transitions. [2022-01-11 01:49:17,055 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3899 transitions. Word has length 68 [2022-01-11 01:49:17,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:17,056 INFO L470 AbstractCegarLoop]: Abstraction has 2949 states and 3899 transitions. [2022-01-11 01:49:17,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2022-01-11 01:49:17,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3899 transitions. [2022-01-11 01:49:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-11 01:49:17,058 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:17,059 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:17,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 01:49:17,059 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:17,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:17,060 INFO L85 PathProgramCache]: Analyzing trace with hash 2064860225, now seen corresponding path program 1 times [2022-01-11 01:49:17,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:17,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081922635] [2022-01-11 01:49:17,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:17,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:49:17,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:17,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081922635] [2022-01-11 01:49:17,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081922635] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:17,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:17,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:17,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633086223] [2022-01-11 01:49:17,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:17,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:17,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:17,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:17,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:17,096 INFO L87 Difference]: Start difference. First operand 2949 states and 3899 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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) [2022-01-11 01:49:17,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:17,314 INFO L93 Difference]: Finished difference Result 4248 states and 5533 transitions. [2022-01-11 01:49:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:17,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 69 [2022-01-11 01:49:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:17,330 INFO L225 Difference]: With dead ends: 4248 [2022-01-11 01:49:17,331 INFO L226 Difference]: Without dead ends: 2623 [2022-01-11 01:49:17,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:17,334 INFO L933 BasicCegarLoop]: 1698 mSDtfsCounter, 99 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 3295 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:17,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 3295 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2022-01-11 01:49:17,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2621. [2022-01-11 01:49:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2621 states, 2619 states have (on average 1.3230240549828178) internal successors, (3465), 2620 states have internal predecessors, (3465), 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) [2022-01-11 01:49:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2621 states to 2621 states and 3465 transitions. [2022-01-11 01:49:17,525 INFO L78 Accepts]: Start accepts. Automaton has 2621 states and 3465 transitions. Word has length 69 [2022-01-11 01:49:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:17,525 INFO L470 AbstractCegarLoop]: Abstraction has 2621 states and 3465 transitions. [2022-01-11 01:49:17,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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) [2022-01-11 01:49:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2621 states and 3465 transitions. [2022-01-11 01:49:17,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-11 01:49:17,528 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:17,528 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:17,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 01:49:17,529 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:17,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:17,529 INFO L85 PathProgramCache]: Analyzing trace with hash -971713807, now seen corresponding path program 1 times [2022-01-11 01:49:17,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:17,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912477818] [2022-01-11 01:49:17,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:17,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-11 01:49:17,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:17,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912477818] [2022-01-11 01:49:17,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912477818] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:17,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:17,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:17,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493571188] [2022-01-11 01:49:17,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:17,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:17,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:17,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:17,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:17,568 INFO L87 Difference]: Start difference. First operand 2621 states and 3465 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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) [2022-01-11 01:49:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:17,796 INFO L93 Difference]: Finished difference Result 4265 states and 5569 transitions. [2022-01-11 01:49:17,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:17,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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 100 [2022-01-11 01:49:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:17,802 INFO L225 Difference]: With dead ends: 4265 [2022-01-11 01:49:17,802 INFO L226 Difference]: Without dead ends: 2897 [2022-01-11 01:49:17,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:17,805 INFO L933 BasicCegarLoop]: 1609 mSDtfsCounter, 1589 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:17,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1589 Valid, 1697 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:17,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2022-01-11 01:49:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2858. [2022-01-11 01:49:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2858 states, 2856 states have (on average 1.3315826330532212) internal successors, (3803), 2857 states have internal predecessors, (3803), 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) [2022-01-11 01:49:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 3803 transitions. [2022-01-11 01:49:18,027 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 3803 transitions. Word has length 100 [2022-01-11 01:49:18,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:18,027 INFO L470 AbstractCegarLoop]: Abstraction has 2858 states and 3803 transitions. [2022-01-11 01:49:18,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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) [2022-01-11 01:49:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 3803 transitions. [2022-01-11 01:49:18,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:18,029 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:18,030 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:18,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 01:49:18,030 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:18,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:18,031 INFO L85 PathProgramCache]: Analyzing trace with hash -767884444, now seen corresponding path program 1 times [2022-01-11 01:49:18,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:18,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744881908] [2022-01-11 01:49:18,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:18,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 01:49:18,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:18,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744881908] [2022-01-11 01:49:18,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744881908] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:18,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:18,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:18,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300826146] [2022-01-11 01:49:18,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:18,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:18,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:18,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:18,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:18,077 INFO L87 Difference]: Start difference. First operand 2858 states and 3803 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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) [2022-01-11 01:49:18,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:18,321 INFO L93 Difference]: Finished difference Result 5035 states and 6604 transitions. [2022-01-11 01:49:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:18,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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 110 [2022-01-11 01:49:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:18,329 INFO L225 Difference]: With dead ends: 5035 [2022-01-11 01:49:18,329 INFO L226 Difference]: Without dead ends: 3434 [2022-01-11 01:49:18,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:18,334 INFO L933 BasicCegarLoop]: 1598 mSDtfsCounter, 1562 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:18,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1562 Valid, 1619 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:18,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2022-01-11 01:49:18,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3434. [2022-01-11 01:49:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3434 states, 3432 states have (on average 1.3143939393939394) internal successors, (4511), 3433 states have internal predecessors, (4511), 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) [2022-01-11 01:49:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 4511 transitions. [2022-01-11 01:49:18,586 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 4511 transitions. Word has length 110 [2022-01-11 01:49:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:18,586 INFO L470 AbstractCegarLoop]: Abstraction has 3434 states and 4511 transitions. [2022-01-11 01:49:18,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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) [2022-01-11 01:49:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 4511 transitions. [2022-01-11 01:49:18,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:18,591 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:18,591 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:18,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 01:49:18,592 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:18,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:18,592 INFO L85 PathProgramCache]: Analyzing trace with hash -527344315, now seen corresponding path program 1 times [2022-01-11 01:49:18,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:18,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138610492] [2022-01-11 01:49:18,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:18,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 01:49:18,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:18,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138610492] [2022-01-11 01:49:18,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138610492] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:18,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:18,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:18,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677588522] [2022-01-11 01:49:18,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:18,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:18,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:18,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:18,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:18,638 INFO L87 Difference]: Start difference. First operand 3434 states and 4511 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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) [2022-01-11 01:49:18,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:18,791 INFO L93 Difference]: Finished difference Result 4197 states and 5456 transitions. [2022-01-11 01:49:18,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:18,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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 110 [2022-01-11 01:49:18,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:18,796 INFO L225 Difference]: With dead ends: 4197 [2022-01-11 01:49:18,796 INFO L226 Difference]: Without dead ends: 2020 [2022-01-11 01:49:18,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:18,800 INFO L933 BasicCegarLoop]: 1597 mSDtfsCounter, 69 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:18,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 3084 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2022-01-11 01:49:18,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 2020. [2022-01-11 01:49:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 2018 states have (on average 1.3389494549058474) internal successors, (2702), 2019 states have internal predecessors, (2702), 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) [2022-01-11 01:49:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2702 transitions. [2022-01-11 01:49:18,959 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2702 transitions. Word has length 110 [2022-01-11 01:49:18,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:18,960 INFO L470 AbstractCegarLoop]: Abstraction has 2020 states and 2702 transitions. [2022-01-11 01:49:18,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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) [2022-01-11 01:49:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2702 transitions. [2022-01-11 01:49:18,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-11 01:49:18,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:18,962 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:18,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 01:49:18,962 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:18,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:18,962 INFO L85 PathProgramCache]: Analyzing trace with hash 864202855, now seen corresponding path program 1 times [2022-01-11 01:49:18,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:18,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633053215] [2022-01-11 01:49:18,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:18,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 01:49:19,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:19,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633053215] [2022-01-11 01:49:19,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633053215] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:19,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:19,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:19,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554133258] [2022-01-11 01:49:19,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:19,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:19,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:19,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:19,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:19,011 INFO L87 Difference]: Start difference. First operand 2020 states and 2702 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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) [2022-01-11 01:49:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:19,152 INFO L93 Difference]: Finished difference Result 2792 states and 3646 transitions. [2022-01-11 01:49:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:19,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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 113 [2022-01-11 01:49:19,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:19,156 INFO L225 Difference]: With dead ends: 2792 [2022-01-11 01:49:19,156 INFO L226 Difference]: Without dead ends: 2029 [2022-01-11 01:49:19,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:19,158 INFO L933 BasicCegarLoop]: 1599 mSDtfsCounter, 60 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:19,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 3088 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:19,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2022-01-11 01:49:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 2029. [2022-01-11 01:49:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2029 states, 2027 states have (on average 1.3305377405032066) internal successors, (2697), 2028 states have internal predecessors, (2697), 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) [2022-01-11 01:49:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 2697 transitions. [2022-01-11 01:49:19,293 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 2697 transitions. Word has length 113 [2022-01-11 01:49:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:19,293 INFO L470 AbstractCegarLoop]: Abstraction has 2029 states and 2697 transitions. [2022-01-11 01:49:19,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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) [2022-01-11 01:49:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2697 transitions. [2022-01-11 01:49:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-11 01:49:19,295 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:19,295 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:19,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 01:49:19,297 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:19,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:19,297 INFO L85 PathProgramCache]: Analyzing trace with hash 415506216, now seen corresponding path program 1 times [2022-01-11 01:49:19,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:19,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919835425] [2022-01-11 01:49:19,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:19,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 01:49:19,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:19,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919835425] [2022-01-11 01:49:19,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919835425] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:19,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:19,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:19,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506300209] [2022-01-11 01:49:19,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:19,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:19,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:19,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:19,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:19,351 INFO L87 Difference]: Start difference. First operand 2029 states and 2697 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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) [2022-01-11 01:49:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:19,489 INFO L93 Difference]: Finished difference Result 2424 states and 3160 transitions. [2022-01-11 01:49:19,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:19,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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 113 [2022-01-11 01:49:19,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:19,492 INFO L225 Difference]: With dead ends: 2424 [2022-01-11 01:49:19,492 INFO L226 Difference]: Without dead ends: 996 [2022-01-11 01:49:19,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:19,495 INFO L933 BasicCegarLoop]: 1596 mSDtfsCounter, 1547 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:19,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1547 Valid, 1614 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:19,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2022-01-11 01:49:19,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 996. [2022-01-11 01:49:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 995 states have (on average 1.4924623115577889) internal successors, (1485), 995 states have internal predecessors, (1485), 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) [2022-01-11 01:49:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1485 transitions. [2022-01-11 01:49:19,533 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1485 transitions. Word has length 113 [2022-01-11 01:49:19,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:19,533 INFO L470 AbstractCegarLoop]: Abstraction has 996 states and 1485 transitions. [2022-01-11 01:49:19,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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) [2022-01-11 01:49:19,533 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1485 transitions. [2022-01-11 01:49:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:19,534 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:19,534 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:19,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 01:49:19,534 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:19,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:19,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1514419045, now seen corresponding path program 1 times [2022-01-11 01:49:19,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:19,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414117895] [2022-01-11 01:49:19,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:19,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:19,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:19,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414117895] [2022-01-11 01:49:19,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414117895] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:19,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:19,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:19,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254014236] [2022-01-11 01:49:19,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:19,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:19,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:19,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:19,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:19,573 INFO L87 Difference]: Start difference. First operand 996 states and 1485 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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) [2022-01-11 01:49:19,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:19,621 INFO L93 Difference]: Finished difference Result 1981 states and 2953 transitions. [2022-01-11 01:49:19,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:19,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:19,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:19,624 INFO L225 Difference]: With dead ends: 1981 [2022-01-11 01:49:19,624 INFO L226 Difference]: Without dead ends: 996 [2022-01-11 01:49:19,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:19,626 INFO L933 BasicCegarLoop]: 1483 mSDtfsCounter, 1474 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:19,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1474 Valid, 1484 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2022-01-11 01:49:19,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 996. [2022-01-11 01:49:19,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 995 states have (on average 1.491457286432161) internal successors, (1484), 995 states have internal predecessors, (1484), 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) [2022-01-11 01:49:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1484 transitions. [2022-01-11 01:49:19,665 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1484 transitions. Word has length 121 [2022-01-11 01:49:19,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:19,666 INFO L470 AbstractCegarLoop]: Abstraction has 996 states and 1484 transitions. [2022-01-11 01:49:19,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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) [2022-01-11 01:49:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1484 transitions. [2022-01-11 01:49:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:19,667 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:19,667 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:19,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 01:49:19,667 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:19,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:19,668 INFO L85 PathProgramCache]: Analyzing trace with hash -690737574, now seen corresponding path program 1 times [2022-01-11 01:49:19,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:19,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452148475] [2022-01-11 01:49:19,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:19,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:19,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:19,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452148475] [2022-01-11 01:49:19,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452148475] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:19,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:19,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:19,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727114745] [2022-01-11 01:49:19,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:19,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:19,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:19,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:19,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:19,722 INFO L87 Difference]: Start difference. First operand 996 states and 1484 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:19,813 INFO L93 Difference]: Finished difference Result 2791 states and 4147 transitions. [2022-01-11 01:49:19,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:19,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:19,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:19,817 INFO L225 Difference]: With dead ends: 2791 [2022-01-11 01:49:19,818 INFO L226 Difference]: Without dead ends: 1811 [2022-01-11 01:49:19,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:19,821 INFO L933 BasicCegarLoop]: 1478 mSDtfsCounter, 1371 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 2768 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:19,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1371 Valid, 2768 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:19,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2022-01-11 01:49:19,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1809. [2022-01-11 01:49:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4839601769911503) internal successors, (2683), 1808 states have internal predecessors, (2683), 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) [2022-01-11 01:49:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2683 transitions. [2022-01-11 01:49:19,907 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2683 transitions. Word has length 121 [2022-01-11 01:49:19,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:19,908 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2683 transitions. [2022-01-11 01:49:19,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:19,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2683 transitions. [2022-01-11 01:49:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:19,909 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:19,909 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:19,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 01:49:19,909 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:19,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:19,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1038571654, now seen corresponding path program 1 times [2022-01-11 01:49:19,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:19,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093497370] [2022-01-11 01:49:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:19,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:19,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:19,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093497370] [2022-01-11 01:49:19,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093497370] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:19,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:19,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:19,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587425004] [2022-01-11 01:49:19,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:19,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:19,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:19,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:19,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:19,950 INFO L87 Difference]: Start difference. First operand 1809 states and 2683 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:20,058 INFO L93 Difference]: Finished difference Result 3601 states and 5340 transitions. [2022-01-11 01:49:20,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:20,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:20,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:20,062 INFO L225 Difference]: With dead ends: 3601 [2022-01-11 01:49:20,062 INFO L226 Difference]: Without dead ends: 1809 [2022-01-11 01:49:20,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:20,065 INFO L933 BasicCegarLoop]: 1472 mSDtfsCounter, 1461 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:20,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1461 Valid, 1472 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-11 01:49:20,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-11 01:49:20,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4795353982300885) internal successors, (2675), 1808 states have internal predecessors, (2675), 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) [2022-01-11 01:49:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2675 transitions. [2022-01-11 01:49:20,175 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2675 transitions. Word has length 121 [2022-01-11 01:49:20,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:20,175 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2675 transitions. [2022-01-11 01:49:20,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2675 transitions. [2022-01-11 01:49:20,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:20,176 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:20,176 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:20,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 01:49:20,177 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:20,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:20,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1305512538, now seen corresponding path program 1 times [2022-01-11 01:49:20,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:20,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343165814] [2022-01-11 01:49:20,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:20,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:20,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:20,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343165814] [2022-01-11 01:49:20,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343165814] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:20,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:20,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:20,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913160814] [2022-01-11 01:49:20,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:20,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:20,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:20,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:20,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:20,217 INFO L87 Difference]: Start difference. First operand 1809 states and 2675 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:20,330 INFO L93 Difference]: Finished difference Result 3600 states and 5323 transitions. [2022-01-11 01:49:20,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:20,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:20,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:20,335 INFO L225 Difference]: With dead ends: 3600 [2022-01-11 01:49:20,335 INFO L226 Difference]: Without dead ends: 1809 [2022-01-11 01:49:20,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:20,338 INFO L933 BasicCegarLoop]: 1467 mSDtfsCounter, 1455 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:20,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1455 Valid, 1467 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:20,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-11 01:49:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-11 01:49:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4751106194690264) internal successors, (2667), 1808 states have internal predecessors, (2667), 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) [2022-01-11 01:49:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2667 transitions. [2022-01-11 01:49:20,430 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2667 transitions. Word has length 121 [2022-01-11 01:49:20,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:20,430 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2667 transitions. [2022-01-11 01:49:20,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:20,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2667 transitions. [2022-01-11 01:49:20,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:20,431 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:20,431 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:20,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 01:49:20,432 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:20,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:20,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1944007814, now seen corresponding path program 1 times [2022-01-11 01:49:20,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:20,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170029986] [2022-01-11 01:49:20,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:20,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:20,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:20,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:20,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170029986] [2022-01-11 01:49:20,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170029986] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:20,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:20,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:20,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404677700] [2022-01-11 01:49:20,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:20,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:20,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:20,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:20,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:20,477 INFO L87 Difference]: Start difference. First operand 1809 states and 2667 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:20,577 INFO L93 Difference]: Finished difference Result 3599 states and 5306 transitions. [2022-01-11 01:49:20,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:20,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:20,582 INFO L225 Difference]: With dead ends: 3599 [2022-01-11 01:49:20,583 INFO L226 Difference]: Without dead ends: 1809 [2022-01-11 01:49:20,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:20,586 INFO L933 BasicCegarLoop]: 1462 mSDtfsCounter, 1449 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:20,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1449 Valid, 1462 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-11 01:49:20,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-11 01:49:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4706858407079646) internal successors, (2659), 1808 states have internal predecessors, (2659), 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) [2022-01-11 01:49:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2659 transitions. [2022-01-11 01:49:20,687 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2659 transitions. Word has length 121 [2022-01-11 01:49:20,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:20,687 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2659 transitions. [2022-01-11 01:49:20,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:20,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2659 transitions. [2022-01-11 01:49:20,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:20,688 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:20,689 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:20,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 01:49:20,689 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:20,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:20,690 INFO L85 PathProgramCache]: Analyzing trace with hash -801905062, now seen corresponding path program 1 times [2022-01-11 01:49:20,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:20,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592306746] [2022-01-11 01:49:20,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:20,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:20,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:20,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592306746] [2022-01-11 01:49:20,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592306746] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:20,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:20,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:20,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956655223] [2022-01-11 01:49:20,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:20,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:20,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:20,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:20,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:20,728 INFO L87 Difference]: Start difference. First operand 1809 states and 2659 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:20,855 INFO L93 Difference]: Finished difference Result 3598 states and 5289 transitions. [2022-01-11 01:49:20,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:20,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:20,860 INFO L225 Difference]: With dead ends: 3598 [2022-01-11 01:49:20,860 INFO L226 Difference]: Without dead ends: 1809 [2022-01-11 01:49:20,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:20,863 INFO L933 BasicCegarLoop]: 1457 mSDtfsCounter, 1443 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1443 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:20,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1443 Valid, 1457 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-11 01:49:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-11 01:49:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4662610619469028) internal successors, (2651), 1808 states have internal predecessors, (2651), 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) [2022-01-11 01:49:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2651 transitions. [2022-01-11 01:49:20,962 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2651 transitions. Word has length 121 [2022-01-11 01:49:20,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:20,962 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2651 transitions. [2022-01-11 01:49:20,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:20,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2651 transitions. [2022-01-11 01:49:20,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:20,963 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:20,963 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:20,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 01:49:20,964 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:20,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:20,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1042157702, now seen corresponding path program 1 times [2022-01-11 01:49:20,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:20,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728784983] [2022-01-11 01:49:20,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:20,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:21,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:21,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728784983] [2022-01-11 01:49:21,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728784983] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:21,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:21,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:21,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735731270] [2022-01-11 01:49:21,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:21,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:21,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:21,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:21,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:21,001 INFO L87 Difference]: Start difference. First operand 1809 states and 2651 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:21,102 INFO L93 Difference]: Finished difference Result 3597 states and 5272 transitions. [2022-01-11 01:49:21,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:21,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:21,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:21,107 INFO L225 Difference]: With dead ends: 3597 [2022-01-11 01:49:21,107 INFO L226 Difference]: Without dead ends: 1809 [2022-01-11 01:49:21,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:21,112 INFO L933 BasicCegarLoop]: 1452 mSDtfsCounter, 1437 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:21,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1437 Valid, 1452 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:21,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-11 01:49:21,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-11 01:49:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4618362831858407) internal successors, (2643), 1808 states have internal predecessors, (2643), 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) [2022-01-11 01:49:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2643 transitions. [2022-01-11 01:49:21,217 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2643 transitions. Word has length 121 [2022-01-11 01:49:21,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:21,217 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2643 transitions. [2022-01-11 01:49:21,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2643 transitions. [2022-01-11 01:49:21,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:21,218 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:21,218 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:21,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 01:49:21,219 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:21,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:21,219 INFO L85 PathProgramCache]: Analyzing trace with hash 197018202, now seen corresponding path program 1 times [2022-01-11 01:49:21,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:21,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377677928] [2022-01-11 01:49:21,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:21,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:21,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:21,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377677928] [2022-01-11 01:49:21,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377677928] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:21,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:21,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:21,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119931411] [2022-01-11 01:49:21,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:21,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:21,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:21,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:21,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:21,259 INFO L87 Difference]: Start difference. First operand 1809 states and 2643 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:21,367 INFO L93 Difference]: Finished difference Result 3596 states and 5255 transitions. [2022-01-11 01:49:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:21,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:21,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:21,373 INFO L225 Difference]: With dead ends: 3596 [2022-01-11 01:49:21,373 INFO L226 Difference]: Without dead ends: 1809 [2022-01-11 01:49:21,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:21,377 INFO L933 BasicCegarLoop]: 1447 mSDtfsCounter, 1431 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:21,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1431 Valid, 1447 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-11 01:49:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-11 01:49:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4574115044247788) internal successors, (2635), 1808 states have internal predecessors, (2635), 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) [2022-01-11 01:49:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2635 transitions. [2022-01-11 01:49:21,464 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2635 transitions. Word has length 121 [2022-01-11 01:49:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:21,464 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2635 transitions. [2022-01-11 01:49:21,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:21,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2635 transitions. [2022-01-11 01:49:21,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:21,465 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:21,465 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:21,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 01:49:21,466 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:21,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:21,466 INFO L85 PathProgramCache]: Analyzing trace with hash -40103046, now seen corresponding path program 1 times [2022-01-11 01:49:21,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:21,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19972531] [2022-01-11 01:49:21,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:21,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:21,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:21,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19972531] [2022-01-11 01:49:21,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19972531] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:21,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:21,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:21,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519974661] [2022-01-11 01:49:21,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:21,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:21,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:21,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:21,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:21,511 INFO L87 Difference]: Start difference. First operand 1809 states and 2635 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:21,606 INFO L93 Difference]: Finished difference Result 3595 states and 5238 transitions. [2022-01-11 01:49:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:21,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:21,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:21,614 INFO L225 Difference]: With dead ends: 3595 [2022-01-11 01:49:21,614 INFO L226 Difference]: Without dead ends: 1809 [2022-01-11 01:49:21,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:21,618 INFO L933 BasicCegarLoop]: 1442 mSDtfsCounter, 1425 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1425 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:21,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1425 Valid, 1442 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:21,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-11 01:49:21,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-11 01:49:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4529867256637168) internal successors, (2627), 1808 states have internal predecessors, (2627), 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) [2022-01-11 01:49:21,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2627 transitions. [2022-01-11 01:49:21,726 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2627 transitions. Word has length 121 [2022-01-11 01:49:21,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:21,726 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2627 transitions. [2022-01-11 01:49:21,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:21,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2627 transitions. [2022-01-11 01:49:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:21,727 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:21,727 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:21,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 01:49:21,728 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:21,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:21,728 INFO L85 PathProgramCache]: Analyzing trace with hash 506437210, now seen corresponding path program 1 times [2022-01-11 01:49:21,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:21,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184918171] [2022-01-11 01:49:21,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:21,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:21,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:21,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184918171] [2022-01-11 01:49:21,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184918171] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:21,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:21,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:21,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275811408] [2022-01-11 01:49:21,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:21,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:21,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:21,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:21,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:21,774 INFO L87 Difference]: Start difference. First operand 1809 states and 2627 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:21,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:21,880 INFO L93 Difference]: Finished difference Result 3594 states and 5221 transitions. [2022-01-11 01:49:21,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:21,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:21,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:21,885 INFO L225 Difference]: With dead ends: 3594 [2022-01-11 01:49:21,885 INFO L226 Difference]: Without dead ends: 1809 [2022-01-11 01:49:21,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:21,888 INFO L933 BasicCegarLoop]: 1437 mSDtfsCounter, 1419 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:21,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1419 Valid, 1437 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-11 01:49:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-11 01:49:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.448561946902655) internal successors, (2619), 1808 states have internal predecessors, (2619), 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) [2022-01-11 01:49:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2619 transitions. [2022-01-11 01:49:22,001 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2619 transitions. Word has length 121 [2022-01-11 01:49:22,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:22,001 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2619 transitions. [2022-01-11 01:49:22,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2619 transitions. [2022-01-11 01:49:22,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:22,003 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:22,003 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:22,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 01:49:22,003 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:22,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:22,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1770993530, now seen corresponding path program 1 times [2022-01-11 01:49:22,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:22,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768410675] [2022-01-11 01:49:22,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:22,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:22,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:22,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768410675] [2022-01-11 01:49:22,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768410675] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:22,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:22,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:22,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793732910] [2022-01-11 01:49:22,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:22,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:22,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:22,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:22,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:22,042 INFO L87 Difference]: Start difference. First operand 1809 states and 2619 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:22,202 INFO L93 Difference]: Finished difference Result 3593 states and 5204 transitions. [2022-01-11 01:49:22,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:22,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:22,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:22,206 INFO L225 Difference]: With dead ends: 3593 [2022-01-11 01:49:22,206 INFO L226 Difference]: Without dead ends: 1809 [2022-01-11 01:49:22,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:22,209 INFO L933 BasicCegarLoop]: 1410 mSDtfsCounter, 1310 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:22,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1310 Valid, 1498 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:22,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-11 01:49:22,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-11 01:49:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4330752212389382) internal successors, (2591), 1808 states have internal predecessors, (2591), 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) [2022-01-11 01:49:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2591 transitions. [2022-01-11 01:49:22,318 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2591 transitions. Word has length 121 [2022-01-11 01:49:22,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:22,318 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2591 transitions. [2022-01-11 01:49:22,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2591 transitions. [2022-01-11 01:49:22,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:22,319 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:22,319 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:22,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 01:49:22,319 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:22,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:22,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1894674215, now seen corresponding path program 1 times [2022-01-11 01:49:22,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:22,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252705544] [2022-01-11 01:49:22,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:22,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:22,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:22,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252705544] [2022-01-11 01:49:22,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252705544] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:22,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:22,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:22,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303830062] [2022-01-11 01:49:22,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:22,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:22,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:22,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:22,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:22,370 INFO L87 Difference]: Start difference. First operand 1809 states and 2591 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:22,512 INFO L93 Difference]: Finished difference Result 3592 states and 5147 transitions. [2022-01-11 01:49:22,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:22,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:22,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:22,517 INFO L225 Difference]: With dead ends: 3592 [2022-01-11 01:49:22,517 INFO L226 Difference]: Without dead ends: 1809 [2022-01-11 01:49:22,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:22,521 INFO L933 BasicCegarLoop]: 1394 mSDtfsCounter, 1294 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:22,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1294 Valid, 1481 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:22,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-11 01:49:22,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-11 01:49:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4175884955752212) internal successors, (2563), 1808 states have internal predecessors, (2563), 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) [2022-01-11 01:49:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2563 transitions. [2022-01-11 01:49:22,631 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2563 transitions. Word has length 121 [2022-01-11 01:49:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:22,631 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2563 transitions. [2022-01-11 01:49:22,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2563 transitions. [2022-01-11 01:49:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:22,632 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:22,632 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:22,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 01:49:22,633 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:22,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:22,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1445270456, now seen corresponding path program 1 times [2022-01-11 01:49:22,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:22,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705458270] [2022-01-11 01:49:22,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:22,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:22,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:22,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705458270] [2022-01-11 01:49:22,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705458270] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:22,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:22,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:22,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118805922] [2022-01-11 01:49:22,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:22,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:22,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:22,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:22,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:22,670 INFO L87 Difference]: Start difference. First operand 1809 states and 2563 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:22,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:22,808 INFO L93 Difference]: Finished difference Result 3591 states and 5090 transitions. [2022-01-11 01:49:22,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:22,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:22,812 INFO L225 Difference]: With dead ends: 3591 [2022-01-11 01:49:22,812 INFO L226 Difference]: Without dead ends: 1809 [2022-01-11 01:49:22,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:22,816 INFO L933 BasicCegarLoop]: 1378 mSDtfsCounter, 1278 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:22,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1278 Valid, 1464 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:22,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-11 01:49:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-11 01:49:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4021017699115044) internal successors, (2535), 1808 states have internal predecessors, (2535), 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) [2022-01-11 01:49:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2535 transitions. [2022-01-11 01:49:22,977 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2535 transitions. Word has length 121 [2022-01-11 01:49:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:22,978 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2535 transitions. [2022-01-11 01:49:22,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2535 transitions. [2022-01-11 01:49:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:22,979 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:22,979 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:22,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 01:49:22,979 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:22,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:22,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1837181847, now seen corresponding path program 1 times [2022-01-11 01:49:22,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:22,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715216933] [2022-01-11 01:49:22,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:22,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:23,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:23,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715216933] [2022-01-11 01:49:23,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715216933] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:23,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:23,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:23,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67473397] [2022-01-11 01:49:23,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:23,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:23,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:23,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:23,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:23,018 INFO L87 Difference]: Start difference. First operand 1809 states and 2535 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:23,197 INFO L93 Difference]: Finished difference Result 3590 states and 5033 transitions. [2022-01-11 01:49:23,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:23,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:23,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:23,201 INFO L225 Difference]: With dead ends: 3590 [2022-01-11 01:49:23,201 INFO L226 Difference]: Without dead ends: 1809 [2022-01-11 01:49:23,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:23,205 INFO L933 BasicCegarLoop]: 1362 mSDtfsCounter, 1262 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:23,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1262 Valid, 1447 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:23,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-11 01:49:23,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-11 01:49:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.3866150442477876) internal successors, (2507), 1808 states have internal predecessors, (2507), 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) [2022-01-11 01:49:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2507 transitions. [2022-01-11 01:49:23,330 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2507 transitions. Word has length 121 [2022-01-11 01:49:23,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:23,330 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2507 transitions. [2022-01-11 01:49:23,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2507 transitions. [2022-01-11 01:49:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:23,331 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:23,331 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:23,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 01:49:23,332 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:23,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:23,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1239045303, now seen corresponding path program 1 times [2022-01-11 01:49:23,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:23,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374507606] [2022-01-11 01:49:23,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:23,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:23,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:23,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374507606] [2022-01-11 01:49:23,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374507606] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:23,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:23,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:23,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089557270] [2022-01-11 01:49:23,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:23,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:23,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:23,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:23,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:23,381 INFO L87 Difference]: Start difference. First operand 1809 states and 2507 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:23,529 INFO L93 Difference]: Finished difference Result 3589 states and 4976 transitions. [2022-01-11 01:49:23,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:23,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:23,532 INFO L225 Difference]: With dead ends: 3589 [2022-01-11 01:49:23,533 INFO L226 Difference]: Without dead ends: 1809 [2022-01-11 01:49:23,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:23,536 INFO L933 BasicCegarLoop]: 1346 mSDtfsCounter, 1246 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:23,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1246 Valid, 1430 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:23,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-11 01:49:23,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-11 01:49:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.3711283185840708) internal successors, (2479), 1808 states have internal predecessors, (2479), 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) [2022-01-11 01:49:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2479 transitions. [2022-01-11 01:49:23,640 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2479 transitions. Word has length 121 [2022-01-11 01:49:23,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:23,640 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2479 transitions. [2022-01-11 01:49:23,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:23,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2479 transitions. [2022-01-11 01:49:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:23,641 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:23,641 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:23,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 01:49:23,641 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:23,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:23,642 INFO L85 PathProgramCache]: Analyzing trace with hash 859040534, now seen corresponding path program 1 times [2022-01-11 01:49:23,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:23,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417498762] [2022-01-11 01:49:23,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:23,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:23,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:23,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417498762] [2022-01-11 01:49:23,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417498762] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:23,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:23,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:23,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232383253] [2022-01-11 01:49:23,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:23,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:23,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:23,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:23,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:23,685 INFO L87 Difference]: Start difference. First operand 1809 states and 2479 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:23,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:23,857 INFO L93 Difference]: Finished difference Result 3588 states and 4919 transitions. [2022-01-11 01:49:23,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:23,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:23,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:23,861 INFO L225 Difference]: With dead ends: 3588 [2022-01-11 01:49:23,861 INFO L226 Difference]: Without dead ends: 1809 [2022-01-11 01:49:23,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:23,865 INFO L933 BasicCegarLoop]: 1330 mSDtfsCounter, 1230 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:23,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1230 Valid, 1413 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:23,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-11 01:49:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-11 01:49:23,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.355641592920354) internal successors, (2451), 1808 states have internal predecessors, (2451), 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) [2022-01-11 01:49:23,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2451 transitions. [2022-01-11 01:49:23,991 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2451 transitions. Word has length 121 [2022-01-11 01:49:23,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:23,992 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2451 transitions. [2022-01-11 01:49:23,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2451 transitions. [2022-01-11 01:49:23,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:23,995 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:23,996 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:23,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 01:49:23,996 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:23,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:23,997 INFO L85 PathProgramCache]: Analyzing trace with hash 671451893, now seen corresponding path program 1 times [2022-01-11 01:49:23,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:23,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485234843] [2022-01-11 01:49:23,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:23,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:24,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:24,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485234843] [2022-01-11 01:49:24,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485234843] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:24,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:24,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:24,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729542462] [2022-01-11 01:49:24,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:24,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:24,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:24,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:24,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:24,030 INFO L87 Difference]: Start difference. First operand 1809 states and 2451 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:24,185 INFO L93 Difference]: Finished difference Result 3587 states and 4862 transitions. [2022-01-11 01:49:24,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:24,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:24,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:24,188 INFO L225 Difference]: With dead ends: 3587 [2022-01-11 01:49:24,188 INFO L226 Difference]: Without dead ends: 1809 [2022-01-11 01:49:24,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:24,191 INFO L933 BasicCegarLoop]: 1314 mSDtfsCounter, 1214 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:24,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1214 Valid, 1396 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-11 01:49:24,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-11 01:49:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.3401548672566372) internal successors, (2423), 1808 states have internal predecessors, (2423), 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) [2022-01-11 01:49:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2423 transitions. [2022-01-11 01:49:24,306 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2423 transitions. Word has length 121 [2022-01-11 01:49:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:24,306 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2423 transitions. [2022-01-11 01:49:24,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2423 transitions. [2022-01-11 01:49:24,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:24,307 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:24,307 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:24,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 01:49:24,307 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:24,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:24,308 INFO L85 PathProgramCache]: Analyzing trace with hash -643801132, now seen corresponding path program 1 times [2022-01-11 01:49:24,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:24,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225952348] [2022-01-11 01:49:24,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:24,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:24,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:24,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225952348] [2022-01-11 01:49:24,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225952348] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:24,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:24,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:24,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411887679] [2022-01-11 01:49:24,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:24,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:24,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:24,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:24,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:24,348 INFO L87 Difference]: Start difference. First operand 1809 states and 2423 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:24,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:24,496 INFO L93 Difference]: Finished difference Result 3586 states and 4805 transitions. [2022-01-11 01:49:24,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:24,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:24,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:24,498 INFO L225 Difference]: With dead ends: 3586 [2022-01-11 01:49:24,498 INFO L226 Difference]: Without dead ends: 1809 [2022-01-11 01:49:24,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:24,500 INFO L933 BasicCegarLoop]: 1298 mSDtfsCounter, 1198 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:24,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1198 Valid, 1379 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:24,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-11 01:49:24,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-11 01:49:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.3246681415929205) internal successors, (2395), 1808 states have internal predecessors, (2395), 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) [2022-01-11 01:49:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2395 transitions. [2022-01-11 01:49:24,645 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2395 transitions. Word has length 121 [2022-01-11 01:49:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:24,645 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2395 transitions. [2022-01-11 01:49:24,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:24,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2395 transitions. [2022-01-11 01:49:24,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:24,646 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:24,646 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:24,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 01:49:24,647 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:24,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:24,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2102088141, now seen corresponding path program 1 times [2022-01-11 01:49:24,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:24,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662388499] [2022-01-11 01:49:24,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:24,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:24,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:24,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662388499] [2022-01-11 01:49:24,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662388499] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:24,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:24,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:24,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013665153] [2022-01-11 01:49:24,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:24,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:24,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:24,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:24,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:24,698 INFO L87 Difference]: Start difference. First operand 1809 states and 2395 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:24,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:24,871 INFO L93 Difference]: Finished difference Result 3585 states and 4748 transitions. [2022-01-11 01:49:24,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:24,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:24,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:24,875 INFO L225 Difference]: With dead ends: 3585 [2022-01-11 01:49:24,875 INFO L226 Difference]: Without dead ends: 1809 [2022-01-11 01:49:24,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:24,878 INFO L933 BasicCegarLoop]: 1282 mSDtfsCounter, 1182 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:24,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1182 Valid, 1362 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:24,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-11 01:49:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-11 01:49:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.3091814159292035) internal successors, (2367), 1808 states have internal predecessors, (2367), 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) [2022-01-11 01:49:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2367 transitions. [2022-01-11 01:49:25,022 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2367 transitions. Word has length 121 [2022-01-11 01:49:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:25,023 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2367 transitions. [2022-01-11 01:49:25,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2367 transitions. [2022-01-11 01:49:25,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:25,023 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:25,024 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:25,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 01:49:25,024 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:25,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:25,024 INFO L85 PathProgramCache]: Analyzing trace with hash -655064686, now seen corresponding path program 1 times [2022-01-11 01:49:25,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:25,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186890588] [2022-01-11 01:49:25,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:25,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:25,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:25,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186890588] [2022-01-11 01:49:25,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186890588] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:25,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:25,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:49:25,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701599955] [2022-01-11 01:49:25,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:25,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:49:25,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:25,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:49:25,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:49:25,101 INFO L87 Difference]: Start difference. First operand 1809 states and 2367 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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) [2022-01-11 01:49:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:25,422 INFO L93 Difference]: Finished difference Result 4244 states and 5604 transitions. [2022-01-11 01:49:25,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:49:25,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:25,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:25,426 INFO L225 Difference]: With dead ends: 4244 [2022-01-11 01:49:25,426 INFO L226 Difference]: Without dead ends: 2475 [2022-01-11 01:49:25,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:49:25,429 INFO L933 BasicCegarLoop]: 1328 mSDtfsCounter, 3660 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3660 SdHoareTripleChecker+Valid, 2248 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:25,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3660 Valid, 2248 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:49:25,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2022-01-11 01:49:25,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 1815. [2022-01-11 01:49:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1814 states have (on average 1.297133406835722) internal successors, (2353), 1814 states have internal predecessors, (2353), 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) [2022-01-11 01:49:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2353 transitions. [2022-01-11 01:49:25,614 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2353 transitions. Word has length 121 [2022-01-11 01:49:25,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:25,615 INFO L470 AbstractCegarLoop]: Abstraction has 1815 states and 2353 transitions. [2022-01-11 01:49:25,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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) [2022-01-11 01:49:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2353 transitions. [2022-01-11 01:49:25,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:25,615 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:25,615 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:25,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 01:49:25,616 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:25,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:25,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2140120237, now seen corresponding path program 1 times [2022-01-11 01:49:25,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:25,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111349457] [2022-01-11 01:49:25,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:25,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:25,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:25,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111349457] [2022-01-11 01:49:25,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111349457] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:25,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:25,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:49:25,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340913782] [2022-01-11 01:49:25,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:25,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:49:25,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:25,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:49:25,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:49:25,662 INFO L87 Difference]: Start difference. First operand 1815 states and 2353 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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) [2022-01-11 01:49:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:25,982 INFO L93 Difference]: Finished difference Result 4472 states and 5839 transitions. [2022-01-11 01:49:25,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:49:25,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:25,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:25,985 INFO L225 Difference]: With dead ends: 4472 [2022-01-11 01:49:25,985 INFO L226 Difference]: Without dead ends: 2711 [2022-01-11 01:49:25,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:49:25,988 INFO L933 BasicCegarLoop]: 1355 mSDtfsCounter, 3386 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3386 SdHoareTripleChecker+Valid, 3230 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:25,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3386 Valid, 3230 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:49:25,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2022-01-11 01:49:26,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 1821. [2022-01-11 01:49:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1820 states have (on average 1.2851648351648353) internal successors, (2339), 1820 states have internal predecessors, (2339), 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) [2022-01-11 01:49:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2339 transitions. [2022-01-11 01:49:26,177 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2339 transitions. Word has length 121 [2022-01-11 01:49:26,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:26,178 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2339 transitions. [2022-01-11 01:49:26,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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) [2022-01-11 01:49:26,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2339 transitions. [2022-01-11 01:49:26,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:26,179 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:26,179 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:26,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-11 01:49:26,179 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:26,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1671171732, now seen corresponding path program 1 times [2022-01-11 01:49:26,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:26,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935522737] [2022-01-11 01:49:26,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:26,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:26,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:26,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:26,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935522737] [2022-01-11 01:49:26,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935522737] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:26,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:26,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:49:26,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875069856] [2022-01-11 01:49:26,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:26,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:49:26,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:26,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:49:26,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:49:26,263 INFO L87 Difference]: Start difference. First operand 1821 states and 2339 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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) [2022-01-11 01:49:26,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:26,729 INFO L93 Difference]: Finished difference Result 4595 states and 5937 transitions. [2022-01-11 01:49:26,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:49:26,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:26,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:26,733 INFO L225 Difference]: With dead ends: 4595 [2022-01-11 01:49:26,734 INFO L226 Difference]: Without dead ends: 2835 [2022-01-11 01:49:26,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:49:26,737 INFO L933 BasicCegarLoop]: 1326 mSDtfsCounter, 3239 mSDsluCounter, 2108 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3239 SdHoareTripleChecker+Valid, 3434 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:26,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3239 Valid, 3434 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:49:26,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2022-01-11 01:49:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 1827. [2022-01-11 01:49:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1826 states have (on average 1.2732749178532312) internal successors, (2325), 1826 states have internal predecessors, (2325), 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) [2022-01-11 01:49:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2325 transitions. [2022-01-11 01:49:26,939 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2325 transitions. Word has length 121 [2022-01-11 01:49:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:26,939 INFO L470 AbstractCegarLoop]: Abstraction has 1827 states and 2325 transitions. [2022-01-11 01:49:26,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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) [2022-01-11 01:49:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2325 transitions. [2022-01-11 01:49:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:49:26,940 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:26,940 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:26,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-11 01:49:26,940 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:26,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:26,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1319401835, now seen corresponding path program 1 times [2022-01-11 01:49:26,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:26,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120034494] [2022-01-11 01:49:26,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:26,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:26,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:26,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120034494] [2022-01-11 01:49:26,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120034494] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:26,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:26,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:26,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269142073] [2022-01-11 01:49:26,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:26,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:26,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:26,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:26,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:26,991 INFO L87 Difference]: Start difference. First operand 1827 states and 2325 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:27,478 INFO L93 Difference]: Finished difference Result 5294 states and 6749 transitions. [2022-01-11 01:49:27,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:27,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-01-11 01:49:27,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:27,484 INFO L225 Difference]: With dead ends: 5294 [2022-01-11 01:49:27,484 INFO L226 Difference]: Without dead ends: 3502 [2022-01-11 01:49:27,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:27,487 INFO L933 BasicCegarLoop]: 1250 mSDtfsCounter, 1114 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 2349 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:27,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1114 Valid, 2349 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:27,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2022-01-11 01:49:27,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 3378. [2022-01-11 01:49:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3378 states, 3377 states have (on average 1.270358306188925) internal successors, (4290), 3377 states have internal predecessors, (4290), 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) [2022-01-11 01:49:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 3378 states and 4290 transitions. [2022-01-11 01:49:27,776 INFO L78 Accepts]: Start accepts. Automaton has 3378 states and 4290 transitions. Word has length 121 [2022-01-11 01:49:27,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:27,776 INFO L470 AbstractCegarLoop]: Abstraction has 3378 states and 4290 transitions. [2022-01-11 01:49:27,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) [2022-01-11 01:49:27,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3378 states and 4290 transitions. [2022-01-11 01:49:27,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-11 01:49:27,783 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:27,783 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:27,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-11 01:49:27,784 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:27,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:27,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1011827443, now seen corresponding path program 1 times [2022-01-11 01:49:27,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:27,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505736333] [2022-01-11 01:49:27,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:27,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:27,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:27,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505736333] [2022-01-11 01:49:27,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505736333] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:27,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:27,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:27,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914217645] [2022-01-11 01:49:27,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:27,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:27,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:27,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:27,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:27,842 INFO L87 Difference]: Start difference. First operand 3378 states and 4290 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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) [2022-01-11 01:49:28,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:28,501 INFO L93 Difference]: Finished difference Result 9899 states and 12596 transitions. [2022-01-11 01:49:28,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:28,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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 196 [2022-01-11 01:49:28,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:28,509 INFO L225 Difference]: With dead ends: 9899 [2022-01-11 01:49:28,509 INFO L226 Difference]: Without dead ends: 6562 [2022-01-11 01:49:28,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:28,514 INFO L933 BasicCegarLoop]: 1247 mSDtfsCounter, 1138 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:28,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1138 Valid, 2346 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:28,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6562 states. [2022-01-11 01:49:29,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6562 to 6320. [2022-01-11 01:49:29,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6320 states, 6319 states have (on average 1.2682386453552776) internal successors, (8014), 6319 states have internal predecessors, (8014), 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) [2022-01-11 01:49:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6320 states to 6320 states and 8014 transitions. [2022-01-11 01:49:29,074 INFO L78 Accepts]: Start accepts. Automaton has 6320 states and 8014 transitions. Word has length 196 [2022-01-11 01:49:29,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:29,074 INFO L470 AbstractCegarLoop]: Abstraction has 6320 states and 8014 transitions. [2022-01-11 01:49:29,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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) [2022-01-11 01:49:29,075 INFO L276 IsEmpty]: Start isEmpty. Operand 6320 states and 8014 transitions. [2022-01-11 01:49:29,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-11 01:49:29,079 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:29,080 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:29,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-11 01:49:29,080 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:29,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:29,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1473430164, now seen corresponding path program 1 times [2022-01-11 01:49:29,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:29,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153805679] [2022-01-11 01:49:29,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:29,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:29,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:29,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153805679] [2022-01-11 01:49:29,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153805679] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:29,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:29,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:29,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166240692] [2022-01-11 01:49:29,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:29,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:29,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:29,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:29,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:29,148 INFO L87 Difference]: Start difference. First operand 6320 states and 8014 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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) [2022-01-11 01:49:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:30,137 INFO L93 Difference]: Finished difference Result 18589 states and 23450 transitions. [2022-01-11 01:49:30,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:30,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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 196 [2022-01-11 01:49:30,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:30,155 INFO L225 Difference]: With dead ends: 18589 [2022-01-11 01:49:30,156 INFO L226 Difference]: Without dead ends: 12383 [2022-01-11 01:49:30,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:30,164 INFO L933 BasicCegarLoop]: 1536 mSDtfsCounter, 1132 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:30,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1132 Valid, 2765 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:30,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12383 states. [2022-01-11 01:49:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12383 to 12157. [2022-01-11 01:49:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12157 states, 12156 states have (on average 1.255182625863771) internal successors, (15258), 12156 states have internal predecessors, (15258), 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) [2022-01-11 01:49:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12157 states to 12157 states and 15258 transitions. [2022-01-11 01:49:31,269 INFO L78 Accepts]: Start accepts. Automaton has 12157 states and 15258 transitions. Word has length 196 [2022-01-11 01:49:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:31,269 INFO L470 AbstractCegarLoop]: Abstraction has 12157 states and 15258 transitions. [2022-01-11 01:49:31,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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) [2022-01-11 01:49:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 12157 states and 15258 transitions. [2022-01-11 01:49:31,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-11 01:49:31,277 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:31,277 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:31,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-11 01:49:31,277 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:31,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:31,278 INFO L85 PathProgramCache]: Analyzing trace with hash -329488079, now seen corresponding path program 1 times [2022-01-11 01:49:31,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:31,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392276688] [2022-01-11 01:49:31,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:31,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:49:31,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:31,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392276688] [2022-01-11 01:49:31,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392276688] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:31,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:31,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:31,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748971922] [2022-01-11 01:49:31,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:31,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:31,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:31,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:31,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:31,313 INFO L87 Difference]: Start difference. First operand 12157 states and 15258 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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) [2022-01-11 01:49:32,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:32,468 INFO L93 Difference]: Finished difference Result 24162 states and 30336 transitions. [2022-01-11 01:49:32,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:32,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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 196 [2022-01-11 01:49:32,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:32,482 INFO L225 Difference]: With dead ends: 24162 [2022-01-11 01:49:32,483 INFO L226 Difference]: Without dead ends: 12050 [2022-01-11 01:49:32,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:32,492 INFO L933 BasicCegarLoop]: 1259 mSDtfsCounter, 1254 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:32,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1254 Valid, 1260 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:32,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12050 states. [2022-01-11 01:49:33,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12050 to 12050. [2022-01-11 01:49:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12050 states, 12049 states have (on average 1.2557888621462363) internal successors, (15131), 12049 states have internal predecessors, (15131), 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) [2022-01-11 01:49:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12050 states to 12050 states and 15131 transitions. [2022-01-11 01:49:33,465 INFO L78 Accepts]: Start accepts. Automaton has 12050 states and 15131 transitions. Word has length 196 [2022-01-11 01:49:33,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:33,466 INFO L470 AbstractCegarLoop]: Abstraction has 12050 states and 15131 transitions. [2022-01-11 01:49:33,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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) [2022-01-11 01:49:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 12050 states and 15131 transitions. [2022-01-11 01:49:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-01-11 01:49:33,472 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:33,473 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:33,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-11 01:49:33,473 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:33,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:33,473 INFO L85 PathProgramCache]: Analyzing trace with hash 934271543, now seen corresponding path program 1 times [2022-01-11 01:49:33,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:33,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512303267] [2022-01-11 01:49:33,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:33,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:33,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:33,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512303267] [2022-01-11 01:49:33,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512303267] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:33,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:33,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:33,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725481713] [2022-01-11 01:49:33,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:33,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:33,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:33,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:33,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:33,538 INFO L87 Difference]: Start difference. First operand 12050 states and 15131 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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) [2022-01-11 01:49:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:35,595 INFO L93 Difference]: Finished difference Result 34716 states and 43489 transitions. [2022-01-11 01:49:35,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:35,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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 197 [2022-01-11 01:49:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:35,625 INFO L225 Difference]: With dead ends: 34716 [2022-01-11 01:49:35,626 INFO L226 Difference]: Without dead ends: 22780 [2022-01-11 01:49:35,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:35,640 INFO L933 BasicCegarLoop]: 1863 mSDtfsCounter, 953 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 3101 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:35,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [953 Valid, 3101 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:35,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22780 states. [2022-01-11 01:49:37,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22780 to 22778. [2022-01-11 01:49:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22778 states, 22777 states have (on average 1.249110945251789) internal successors, (28451), 22777 states have internal predecessors, (28451), 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) [2022-01-11 01:49:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22778 states to 22778 states and 28451 transitions. [2022-01-11 01:49:37,510 INFO L78 Accepts]: Start accepts. Automaton has 22778 states and 28451 transitions. Word has length 197 [2022-01-11 01:49:37,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:37,511 INFO L470 AbstractCegarLoop]: Abstraction has 22778 states and 28451 transitions. [2022-01-11 01:49:37,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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) [2022-01-11 01:49:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand 22778 states and 28451 transitions. [2022-01-11 01:49:37,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-01-11 01:49:37,522 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:37,523 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:37,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-11 01:49:37,523 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:37,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:37,523 INFO L85 PathProgramCache]: Analyzing trace with hash 697653718, now seen corresponding path program 1 times [2022-01-11 01:49:37,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:37,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210481601] [2022-01-11 01:49:37,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:37,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:49:37,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:37,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210481601] [2022-01-11 01:49:37,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210481601] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:37,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:37,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:37,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361362528] [2022-01-11 01:49:37,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:37,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:37,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:37,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:37,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:37,563 INFO L87 Difference]: Start difference. First operand 22778 states and 28451 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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) [2022-01-11 01:49:39,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:39,595 INFO L93 Difference]: Finished difference Result 45336 states and 56644 transitions. [2022-01-11 01:49:39,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:39,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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 197 [2022-01-11 01:49:39,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:39,619 INFO L225 Difference]: With dead ends: 45336 [2022-01-11 01:49:39,619 INFO L226 Difference]: Without dead ends: 22672 [2022-01-11 01:49:39,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:39,636 INFO L933 BasicCegarLoop]: 1258 mSDtfsCounter, 1252 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:39,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1252 Valid, 1259 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:39,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22672 states. [2022-01-11 01:49:41,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22672 to 22672. [2022-01-11 01:49:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22672 states, 22671 states have (on average 1.2494376075162101) internal successors, (28326), 22671 states have internal predecessors, (28326), 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) [2022-01-11 01:49:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22672 states to 22672 states and 28326 transitions. [2022-01-11 01:49:41,476 INFO L78 Accepts]: Start accepts. Automaton has 22672 states and 28326 transitions. Word has length 197 [2022-01-11 01:49:41,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:41,476 INFO L470 AbstractCegarLoop]: Abstraction has 22672 states and 28326 transitions. [2022-01-11 01:49:41,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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) [2022-01-11 01:49:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 22672 states and 28326 transitions. [2022-01-11 01:49:41,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-01-11 01:49:41,484 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:41,484 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:41,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-11 01:49:41,485 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:41,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:41,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1185449567, now seen corresponding path program 1 times [2022-01-11 01:49:41,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:41,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450495000] [2022-01-11 01:49:41,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:41,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:41,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:41,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450495000] [2022-01-11 01:49:41,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450495000] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:41,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:41,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:41,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368106404] [2022-01-11 01:49:41,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:41,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:41,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:41,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:41,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:41,549 INFO L87 Difference]: Start difference. First operand 22672 states and 28326 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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) [2022-01-11 01:49:45,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:45,176 INFO L93 Difference]: Finished difference Result 65533 states and 81778 transitions. [2022-01-11 01:49:45,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:45,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 198 [2022-01-11 01:49:45,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:45,237 INFO L225 Difference]: With dead ends: 65533 [2022-01-11 01:49:45,238 INFO L226 Difference]: Without dead ends: 42975 [2022-01-11 01:49:45,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:45,261 INFO L933 BasicCegarLoop]: 1832 mSDtfsCounter, 958 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 3068 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:45,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [958 Valid, 3068 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:45,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42975 states. [2022-01-11 01:49:48,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42975 to 42973. [2022-01-11 01:49:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42973 states, 42972 states have (on average 1.2456483291445593) internal successors, (53528), 42972 states have internal predecessors, (53528), 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) [2022-01-11 01:49:48,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42973 states to 42973 states and 53528 transitions. [2022-01-11 01:49:48,907 INFO L78 Accepts]: Start accepts. Automaton has 42973 states and 53528 transitions. Word has length 198 [2022-01-11 01:49:48,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:48,907 INFO L470 AbstractCegarLoop]: Abstraction has 42973 states and 53528 transitions. [2022-01-11 01:49:48,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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) [2022-01-11 01:49:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 42973 states and 53528 transitions. [2022-01-11 01:49:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-01-11 01:49:48,922 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:48,923 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:48,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-11 01:49:48,923 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:48,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:48,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1422067392, now seen corresponding path program 1 times [2022-01-11 01:49:48,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:48,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507331798] [2022-01-11 01:49:48,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:48,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:49:48,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:48,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507331798] [2022-01-11 01:49:48,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507331798] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:48,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:48,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:48,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531573784] [2022-01-11 01:49:48,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:48,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:48,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:48,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:48,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:48,959 INFO L87 Difference]: Start difference. First operand 42973 states and 53528 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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) [2022-01-11 01:49:52,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:52,946 INFO L93 Difference]: Finished difference Result 85727 states and 106801 transitions. [2022-01-11 01:49:52,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:52,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 198 [2022-01-11 01:49:52,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:53,008 INFO L225 Difference]: With dead ends: 85727 [2022-01-11 01:49:53,009 INFO L226 Difference]: Without dead ends: 42868 [2022-01-11 01:49:53,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:53,043 INFO L933 BasicCegarLoop]: 1257 mSDtfsCounter, 1250 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:53,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1250 Valid, 1258 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42868 states. [2022-01-11 01:49:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42868 to 42868. [2022-01-11 01:49:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42868 states, 42867 states have (on average 1.2458301257377469) internal successors, (53405), 42867 states have internal predecessors, (53405), 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) [2022-01-11 01:49:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42868 states to 42868 states and 53405 transitions. [2022-01-11 01:49:56,911 INFO L78 Accepts]: Start accepts. Automaton has 42868 states and 53405 transitions. Word has length 198 [2022-01-11 01:49:56,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:56,912 INFO L470 AbstractCegarLoop]: Abstraction has 42868 states and 53405 transitions. [2022-01-11 01:49:56,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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) [2022-01-11 01:49:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 42868 states and 53405 transitions. [2022-01-11 01:49:56,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-01-11 01:49:56,924 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:56,925 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:56,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-11 01:49:56,925 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:49:56,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:56,925 INFO L85 PathProgramCache]: Analyzing trace with hash 799015846, now seen corresponding path program 1 times [2022-01-11 01:49:56,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:56,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164496608] [2022-01-11 01:49:56,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:56,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:56,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:56,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164496608] [2022-01-11 01:49:56,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164496608] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:56,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:56,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:56,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809292184] [2022-01-11 01:49:56,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:56,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:56,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:56,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:56,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:56,978 INFO L87 Difference]: Start difference. First operand 42868 states and 53405 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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) [2022-01-11 01:50:04,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:04,077 INFO L93 Difference]: Finished difference Result 125952 states and 156871 transitions. [2022-01-11 01:50:04,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:04,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 199 [2022-01-11 01:50:04,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:04,215 INFO L225 Difference]: With dead ends: 125952 [2022-01-11 01:50:04,216 INFO L226 Difference]: Without dead ends: 83198 [2022-01-11 01:50:04,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:04,258 INFO L933 BasicCegarLoop]: 1577 mSDtfsCounter, 1133 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:04,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1133 Valid, 2800 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83198 states.