/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.07.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 01:49:05,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 01:49:05,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 01:49:05,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 01:49:05,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 01:49:05,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 01:49:05,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 01:49:05,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 01:49:05,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 01:49:05,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 01:49:05,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 01:49:05,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 01:49:05,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 01:49:05,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 01:49:05,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 01:49:05,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 01:49:05,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 01:49:05,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 01:49:05,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 01:49:05,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 01:49:05,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 01:49:05,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 01:49:05,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 01:49:05,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 01:49:05,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 01:49:05,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 01:49:05,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 01:49:05,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 01:49:05,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 01:49:05,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 01:49:05,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 01:49:05,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 01:49:05,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 01:49:05,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 01:49:05,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 01:49:05,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 01:49:05,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 01:49:05,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 01:49:05,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 01:49:05,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 01:49:05,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 01:49:05,383 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,397 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 01:49:05,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 01:49:05,398 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 01:49:05,398 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 01:49:05,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 01:49:05,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 01:49:05,399 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 01:49:05,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 01:49:05,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 01:49:05,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 01:49:05,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 01:49:05,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 01:49:05,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 01:49:05,400 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 01:49:05,400 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 01:49:05,400 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 01:49:05,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 01:49:05,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 01:49:05,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 01:49:05,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 01:49:05,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 01:49:05,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:49:05,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 01:49:05,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 01:49:05,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 01:49:05,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 01:49:05,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 01:49:05,401 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 01:49:05,401 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 01:49:05,401 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 01:49:05,401 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 01:49:05,401 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 01:49:05,402 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 01:49:05,402 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:05,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 01:49:05,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 01:49:05,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 01:49:05,626 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 01:49:05,626 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 01:49:05,627 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.07.cil-2.c [2022-01-11 01:49:05,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d1b8c9f9/6edb844f2c8c4e1e98d6e8b60cc73398/FLAGa14c7c7bd [2022-01-11 01:49:06,044 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 01:49:06,044 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c [2022-01-11 01:49:06,053 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d1b8c9f9/6edb844f2c8c4e1e98d6e8b60cc73398/FLAGa14c7c7bd [2022-01-11 01:49:06,457 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d1b8c9f9/6edb844f2c8c4e1e98d6e8b60cc73398 [2022-01-11 01:49:06,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 01:49:06,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 01:49:06,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 01:49:06,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 01:49:06,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 01:49:06,468 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,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38392cea 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,469 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,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 01:49:06,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 01:49:06,620 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.07.cil-2.c[914,927] [2022-01-11 01:49:06,657 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.07.cil-2.c[7115,7128] [2022-01-11 01:49:06,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:49:06,725 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 01:49:06,733 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.07.cil-2.c[914,927] [2022-01-11 01:49:06,752 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.07.cil-2.c[7115,7128] [2022-01-11 01:49:06,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:49:06,801 INFO L208 MainTranslator]: Completed translation [2022-01-11 01:49:06,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:49:06 WrapperNode [2022-01-11 01:49:06,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 01:49:06,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 01:49:06,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 01:49:06,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 01:49:06,815 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:06" (1/1) ... [2022-01-11 01:49:06,826 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:06" (1/1) ... [2022-01-11 01:49:06,884 INFO L137 Inliner]: procedures = 68, calls = 79, calls flagged for inlining = 74, calls inlined = 162, statements flattened = 2302 [2022-01-11 01:49:06,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 01:49:06,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 01:49:06,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 01:49:06,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 01:49:06,891 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:06" (1/1) ... [2022-01-11 01:49:06,891 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:06" (1/1) ... [2022-01-11 01:49:06,900 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:06" (1/1) ... [2022-01-11 01:49:06,901 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:06" (1/1) ... [2022-01-11 01:49:06,935 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:06" (1/1) ... [2022-01-11 01:49:06,955 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:06" (1/1) ... [2022-01-11 01:49:06,959 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:06" (1/1) ... [2022-01-11 01:49:06,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 01:49:06,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 01:49:06,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 01:49:06,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 01:49:06,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:49:06" (1/1) ... [2022-01-11 01:49:06,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:49:07,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:49:07,017 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,029 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,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 01:49:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 01:49:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 01:49:07,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 01:49:07,136 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 01:49:07,137 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 01:49:08,099 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 01:49:08,109 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 01:49:08,109 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-01-11 01:49:08,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:49:08 BoogieIcfgContainer [2022-01-11 01:49:08,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 01:49:08,112 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 01:49:08,112 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 01:49:08,112 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 01:49:08,115 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:49:08" (1/1) ... [2022-01-11 01:49:08,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:49:08 BasicIcfg [2022-01-11 01:49:08,316 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 01:49:08,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 01:49:08,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 01:49:08,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 01:49:08,319 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:08,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39391e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:49:08, skipping insertion in model container [2022-01-11 01:49:08,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:49:06" (2/4) ... [2022-01-11 01:49:08,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39391e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:49:08, skipping insertion in model container [2022-01-11 01:49:08,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:49:08" (3/4) ... [2022-01-11 01:49:08,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39391e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:49:08, skipping insertion in model container [2022-01-11 01:49:08,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:49:08" (4/4) ... [2022-01-11 01:49:08,321 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.07.cil-2.cTransformedIcfg [2022-01-11 01:49:08,324 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 01:49:08,324 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-11 01:49:08,362 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 01:49:08,380 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:08,381 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-11 01:49:08,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 948 states, 943 states have (on average 1.528101802757158) internal successors, (1441), 947 states have internal predecessors, (1441), 0 states have call successors, (0), 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:08,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:49:08,416 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:08,417 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:08,418 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:08,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:08,425 INFO L85 PathProgramCache]: Analyzing trace with hash -33484660, now seen corresponding path program 1 times [2022-01-11 01:49:08,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:08,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372644399] [2022-01-11 01:49:08,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:08,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:08,713 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:08,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:08,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372644399] [2022-01-11 01:49:08,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372644399] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:08,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:08,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:08,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132689633] [2022-01-11 01:49:08,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:08,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:08,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:08,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:08,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:08,739 INFO L87 Difference]: Start difference. First operand has 948 states, 943 states have (on average 1.528101802757158) internal successors, (1441), 947 states have internal predecessors, (1441), 0 states have call successors, (0), 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:08,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:08,965 INFO L93 Difference]: Finished difference Result 1876 states and 2843 transitions. [2022-01-11 01:49:08,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:08,969 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:08,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:08,985 INFO L225 Difference]: With dead ends: 1876 [2022-01-11 01:49:08,986 INFO L226 Difference]: Without dead ends: 1031 [2022-01-11 01:49:08,992 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:08,995 INFO L933 BasicCegarLoop]: 1399 mSDtfsCounter, 124 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 2770 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:08,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 2770 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:49:09,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2022-01-11 01:49:09,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1027. [2022-01-11 01:49:09,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1023 states have (on average 1.4848484848484849) internal successors, (1519), 1026 states have internal predecessors, (1519), 0 states have call successors, (0), 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:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1519 transitions. [2022-01-11 01:49:09,081 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1519 transitions. Word has length 44 [2022-01-11 01:49:09,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:09,081 INFO L470 AbstractCegarLoop]: Abstraction has 1027 states and 1519 transitions. [2022-01-11 01:49:09,081 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:09,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1519 transitions. [2022-01-11 01:49:09,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:49:09,086 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:09,086 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:09,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 01:49:09,086 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:09,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:09,089 INFO L85 PathProgramCache]: Analyzing trace with hash 327256590, now seen corresponding path program 1 times [2022-01-11 01:49:09,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:09,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851765564] [2022-01-11 01:49:09,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:09,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:09,183 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:09,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:09,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851765564] [2022-01-11 01:49:09,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851765564] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:09,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:09,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:09,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378079890] [2022-01-11 01:49:09,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:09,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:09,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:09,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:09,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:09,186 INFO L87 Difference]: Start difference. First operand 1027 states and 1519 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:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:09,228 INFO L93 Difference]: Finished difference Result 1313 states and 1917 transitions. [2022-01-11 01:49:09,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:09,230 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:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:09,233 INFO L225 Difference]: With dead ends: 1313 [2022-01-11 01:49:09,233 INFO L226 Difference]: Without dead ends: 1183 [2022-01-11 01:49:09,235 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:09,236 INFO L933 BasicCegarLoop]: 1394 mSDtfsCounter, 1357 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 1512 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:09,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1357 Valid, 1512 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:09,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2022-01-11 01:49:09,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1179. [2022-01-11 01:49:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 1175 states have (on average 1.4680851063829787) internal successors, (1725), 1178 states have internal predecessors, (1725), 0 states have call successors, (0), 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:09,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1725 transitions. [2022-01-11 01:49:09,263 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1725 transitions. Word has length 44 [2022-01-11 01:49:09,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:09,264 INFO L470 AbstractCegarLoop]: Abstraction has 1179 states and 1725 transitions. [2022-01-11 01:49:09,264 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:09,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1725 transitions. [2022-01-11 01:49:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 01:49:09,271 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:09,271 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:09,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 01:49:09,275 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:09,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:09,276 INFO L85 PathProgramCache]: Analyzing trace with hash 977771419, now seen corresponding path program 1 times [2022-01-11 01:49:09,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:09,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356209884] [2022-01-11 01:49:09,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:09,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:09,364 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:09,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:09,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356209884] [2022-01-11 01:49:09,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356209884] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:09,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:09,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:09,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163141494] [2022-01-11 01:49:09,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:09,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:09,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:09,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:09,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:09,366 INFO L87 Difference]: Start difference. First operand 1179 states and 1725 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:09,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:09,417 INFO L93 Difference]: Finished difference Result 1671 states and 2403 transitions. [2022-01-11 01:49:09,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:09,420 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:09,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:09,425 INFO L225 Difference]: With dead ends: 1671 [2022-01-11 01:49:09,425 INFO L226 Difference]: Without dead ends: 1397 [2022-01-11 01:49:09,428 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:09,431 INFO L933 BasicCegarLoop]: 1391 mSDtfsCounter, 1347 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 1480 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:09,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1347 Valid, 1480 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:09,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2022-01-11 01:49:09,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1373. [2022-01-11 01:49:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1369 states have (on average 1.4470416362308254) internal successors, (1981), 1372 states have internal predecessors, (1981), 0 states have call successors, (0), 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:09,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1981 transitions. [2022-01-11 01:49:09,462 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1981 transitions. Word has length 45 [2022-01-11 01:49:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:09,462 INFO L470 AbstractCegarLoop]: Abstraction has 1373 states and 1981 transitions. [2022-01-11 01:49:09,462 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:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1981 transitions. [2022-01-11 01:49:09,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 01:49:09,463 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:09,463 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:09,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 01:49:09,464 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:09,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:09,464 INFO L85 PathProgramCache]: Analyzing trace with hash 948188956, now seen corresponding path program 1 times [2022-01-11 01:49:09,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:09,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789941354] [2022-01-11 01:49:09,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:09,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:09,522 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:09,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:09,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789941354] [2022-01-11 01:49:09,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789941354] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:09,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:09,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:09,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419582482] [2022-01-11 01:49:09,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:09,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:09,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:09,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:09,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:09,524 INFO L87 Difference]: Start difference. First operand 1373 states and 1981 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:09,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:09,589 INFO L93 Difference]: Finished difference Result 2307 states and 3257 transitions. [2022-01-11 01:49:09,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:09,590 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:09,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:09,596 INFO L225 Difference]: With dead ends: 2307 [2022-01-11 01:49:09,596 INFO L226 Difference]: Without dead ends: 1778 [2022-01-11 01:49:09,599 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:09,603 INFO L933 BasicCegarLoop]: 1387 mSDtfsCounter, 91 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:09,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 2720 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:09,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2022-01-11 01:49:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1758. [2022-01-11 01:49:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1754 states have (on average 1.4213226909920182) internal successors, (2493), 1757 states have internal predecessors, (2493), 0 states have call successors, (0), 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:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2493 transitions. [2022-01-11 01:49:09,650 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2493 transitions. Word has length 45 [2022-01-11 01:49:09,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:09,651 INFO L470 AbstractCegarLoop]: Abstraction has 1758 states and 2493 transitions. [2022-01-11 01:49:09,651 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:09,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2493 transitions. [2022-01-11 01:49:09,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 01:49:09,652 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:09,652 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:09,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 01:49:09,652 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:09,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:09,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1672420905, now seen corresponding path program 1 times [2022-01-11 01:49:09,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:09,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459039782] [2022-01-11 01:49:09,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:09,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:09,764 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:09,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:09,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459039782] [2022-01-11 01:49:09,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459039782] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:09,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:09,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:09,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995256669] [2022-01-11 01:49:09,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:09,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:09,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:09,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:09,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:09,766 INFO L87 Difference]: Start difference. First operand 1758 states and 2493 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:09,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:09,825 INFO L93 Difference]: Finished difference Result 2961 states and 4106 transitions. [2022-01-11 01:49:09,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:09,825 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:09,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:09,831 INFO L225 Difference]: With dead ends: 2961 [2022-01-11 01:49:09,831 INFO L226 Difference]: Without dead ends: 2077 [2022-01-11 01:49:09,832 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:09,833 INFO L933 BasicCegarLoop]: 1393 mSDtfsCounter, 1342 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 1482 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:09,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1342 Valid, 1482 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:09,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2022-01-11 01:49:09,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2055. [2022-01-11 01:49:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 2051 states have (on average 1.4032179424670892) internal successors, (2878), 2054 states have internal predecessors, (2878), 0 states have call successors, (0), 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:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 2878 transitions. [2022-01-11 01:49:09,879 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 2878 transitions. Word has length 51 [2022-01-11 01:49:09,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:09,881 INFO L470 AbstractCegarLoop]: Abstraction has 2055 states and 2878 transitions. [2022-01-11 01:49:09,883 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:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2878 transitions. [2022-01-11 01:49:09,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:49:09,884 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:09,885 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:09,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 01:49:09,885 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:09,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:09,885 INFO L85 PathProgramCache]: Analyzing trace with hash -994883660, now seen corresponding path program 1 times [2022-01-11 01:49:09,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:09,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647250390] [2022-01-11 01:49:09,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:09,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:09,970 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:09,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:09,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647250390] [2022-01-11 01:49:09,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647250390] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:09,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:09,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:49:09,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904534943] [2022-01-11 01:49:09,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:09,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:49:09,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:09,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:49:09,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:49:09,971 INFO L87 Difference]: Start difference. First operand 2055 states and 2878 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:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:10,086 INFO L93 Difference]: Finished difference Result 3681 states and 5082 transitions. [2022-01-11 01:49:10,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:49:10,086 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:10,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:10,095 INFO L225 Difference]: With dead ends: 3681 [2022-01-11 01:49:10,095 INFO L226 Difference]: Without dead ends: 2730 [2022-01-11 01:49:10,098 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:10,099 INFO L933 BasicCegarLoop]: 1382 mSDtfsCounter, 395 mSDsluCounter, 4097 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 5479 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:10,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 5479 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:10,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2022-01-11 01:49:10,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 2079. [2022-01-11 01:49:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2075 states have (on average 1.3898795180722892) internal successors, (2884), 2078 states have internal predecessors, (2884), 0 states have call successors, (0), 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,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 2884 transitions. [2022-01-11 01:49:10,200 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 2884 transitions. Word has length 52 [2022-01-11 01:49:10,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:10,201 INFO L470 AbstractCegarLoop]: Abstraction has 2079 states and 2884 transitions. [2022-01-11 01:49:10,201 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:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 2884 transitions. [2022-01-11 01:49:10,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:49:10,201 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:10,202 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:10,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 01:49:10,202 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:10,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:10,202 INFO L85 PathProgramCache]: Analyzing trace with hash 955416595, now seen corresponding path program 1 times [2022-01-11 01:49:10,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:10,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939847569] [2022-01-11 01:49:10,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:10,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:10,258 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:10,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:10,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939847569] [2022-01-11 01:49:10,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939847569] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:10,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:10,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:49:10,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123922937] [2022-01-11 01:49:10,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:10,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:49:10,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:10,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:49:10,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:49:10,260 INFO L87 Difference]: Start difference. First operand 2079 states and 2884 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:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:10,402 INFO L93 Difference]: Finished difference Result 3834 states and 5233 transitions. [2022-01-11 01:49:10,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:49:10,403 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:10,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:10,411 INFO L225 Difference]: With dead ends: 3834 [2022-01-11 01:49:10,411 INFO L226 Difference]: Without dead ends: 2669 [2022-01-11 01:49:10,412 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:10,413 INFO L933 BasicCegarLoop]: 1381 mSDtfsCounter, 354 mSDsluCounter, 4272 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 5653 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:10,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 5653 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:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2669 states. [2022-01-11 01:49:10,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2669 to 2097. [2022-01-11 01:49:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2097 states, 2093 states have (on average 1.3769708552317248) internal successors, (2882), 2096 states have internal predecessors, (2882), 0 states have call successors, (0), 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,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 2882 transitions. [2022-01-11 01:49:10,512 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 2882 transitions. Word has length 52 [2022-01-11 01:49:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:10,513 INFO L470 AbstractCegarLoop]: Abstraction has 2097 states and 2882 transitions. [2022-01-11 01:49:10,513 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:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 2882 transitions. [2022-01-11 01:49:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:49:10,513 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:10,514 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:10,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 01:49:10,514 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:10,514 INFO L85 PathProgramCache]: Analyzing trace with hash 966732722, now seen corresponding path program 1 times [2022-01-11 01:49:10,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:10,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137997254] [2022-01-11 01:49:10,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:10,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:10,586 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:10,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:10,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137997254] [2022-01-11 01:49:10,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137997254] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:10,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:10,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 01:49:10,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544694172] [2022-01-11 01:49:10,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:10,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 01:49:10,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:10,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 01:49:10,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 01:49:10,588 INFO L87 Difference]: Start difference. First operand 2097 states and 2882 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:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:10,751 INFO L93 Difference]: Finished difference Result 2329 states and 3182 transitions. [2022-01-11 01:49:10,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 01:49:10,752 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:10,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:10,758 INFO L225 Difference]: With dead ends: 2329 [2022-01-11 01:49:10,758 INFO L226 Difference]: Without dead ends: 2327 [2022-01-11 01:49:10,759 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:10,760 INFO L933 BasicCegarLoop]: 1390 mSDtfsCounter, 2823 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2823 SdHoareTripleChecker+Valid, 1478 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:10,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2823 Valid, 1478 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:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2022-01-11 01:49:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2095. [2022-01-11 01:49:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2095 states, 2092 states have (on average 1.3733269598470363) internal successors, (2873), 2094 states have internal predecessors, (2873), 0 states have call successors, (0), 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,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 2873 transitions. [2022-01-11 01:49:10,895 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 2873 transitions. Word has length 52 [2022-01-11 01:49:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:10,896 INFO L470 AbstractCegarLoop]: Abstraction has 2095 states and 2873 transitions. [2022-01-11 01:49:10,896 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:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2873 transitions. [2022-01-11 01:49:10,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-11 01:49:10,897 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:10,897 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:10,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 01:49:10,897 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:10,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:10,897 INFO L85 PathProgramCache]: Analyzing trace with hash -96053897, now seen corresponding path program 1 times [2022-01-11 01:49:10,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:10,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228944934] [2022-01-11 01:49:10,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:10,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:11,037 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:11,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:11,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228944934] [2022-01-11 01:49:11,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228944934] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 01:49:11,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33352214] [2022-01-11 01:49:11,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:11,038 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:49:11,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:49:11,052 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:11,058 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:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:11,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-11 01:49:11,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 01:49:11,416 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:11,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 01:49:11,656 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:11,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33352214] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 01:49:11,657 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 01:49:11,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-11 01:49:11,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978079569] [2022-01-11 01:49:11,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 01:49:11,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 01:49:11,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:11,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 01:49:11,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:49:11,658 INFO L87 Difference]: Start difference. First operand 2095 states and 2873 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:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:11,996 INFO L93 Difference]: Finished difference Result 4452 states and 5973 transitions. [2022-01-11 01:49:11,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 01:49:11,997 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:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:12,008 INFO L225 Difference]: With dead ends: 4452 [2022-01-11 01:49:12,008 INFO L226 Difference]: Without dead ends: 4450 [2022-01-11 01:49:12,010 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:12,011 INFO L933 BasicCegarLoop]: 1541 mSDtfsCounter, 4581 mSDsluCounter, 4821 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4581 SdHoareTripleChecker+Valid, 6362 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:12,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4581 Valid, 6362 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4450 states. [2022-01-11 01:49:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4450 to 3070. [2022-01-11 01:49:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 3067 states have (on average 1.354417998043691) internal successors, (4154), 3069 states have internal predecessors, (4154), 0 states have call successors, (0), 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,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 4154 transitions. [2022-01-11 01:49:12,232 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 4154 transitions. Word has length 53 [2022-01-11 01:49:12,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:12,232 INFO L470 AbstractCegarLoop]: Abstraction has 3070 states and 4154 transitions. [2022-01-11 01:49:12,232 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:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 4154 transitions. [2022-01-11 01:49:12,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:49:12,233 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:12,233 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:12,265 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:12,451 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:12,451 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:12,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:12,452 INFO L85 PathProgramCache]: Analyzing trace with hash -589626652, now seen corresponding path program 2 times [2022-01-11 01:49:12,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:12,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916404984] [2022-01-11 01:49:12,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:12,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:12,481 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:12,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:12,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916404984] [2022-01-11 01:49:12,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916404984] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:12,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:12,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:12,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096372012] [2022-01-11 01:49:12,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:12,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:12,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:12,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:12,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:12,485 INFO L87 Difference]: Start difference. First operand 3070 states and 4154 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:12,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:12,624 INFO L93 Difference]: Finished difference Result 4164 states and 5599 transitions. [2022-01-11 01:49:12,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:12,624 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:12,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:12,630 INFO L225 Difference]: With dead ends: 4164 [2022-01-11 01:49:12,631 INFO L226 Difference]: Without dead ends: 2424 [2022-01-11 01:49:12,633 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:12,633 INFO L933 BasicCegarLoop]: 1453 mSDtfsCounter, 1336 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 1569 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:12,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1336 Valid, 1569 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:12,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2022-01-11 01:49:12,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2408. [2022-01-11 01:49:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 2405 states have (on average 1.3513513513513513) internal successors, (3250), 2407 states have internal predecessors, (3250), 0 states have call successors, (0), 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,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 3250 transitions. [2022-01-11 01:49:12,782 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 3250 transitions. Word has length 56 [2022-01-11 01:49:12,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:12,782 INFO L470 AbstractCegarLoop]: Abstraction has 2408 states and 3250 transitions. [2022-01-11 01:49:12,782 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:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 3250 transitions. [2022-01-11 01:49:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-11 01:49:12,783 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:12,783 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:12,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 01:49:12,784 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:12,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:12,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1937786145, now seen corresponding path program 1 times [2022-01-11 01:49:12,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:12,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18587247] [2022-01-11 01:49:12,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:12,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:12,823 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:12,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:12,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18587247] [2022-01-11 01:49:12,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18587247] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:12,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:12,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:12,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362673414] [2022-01-11 01:49:12,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:12,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:12,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:12,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:12,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:12,825 INFO L87 Difference]: Start difference. First operand 2408 states and 3250 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:13,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:13,021 INFO L93 Difference]: Finished difference Result 4895 states and 6398 transitions. [2022-01-11 01:49:13,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:13,022 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:13,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:13,031 INFO L225 Difference]: With dead ends: 4895 [2022-01-11 01:49:13,031 INFO L226 Difference]: Without dead ends: 2793 [2022-01-11 01:49:13,034 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:13,035 INFO L933 BasicCegarLoop]: 1476 mSDtfsCounter, 89 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 2848 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:13,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 2848 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:13,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2022-01-11 01:49:13,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 2793. [2022-01-11 01:49:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2793 states, 2790 states have (on average 1.3293906810035843) internal successors, (3709), 2792 states have internal predecessors, (3709), 0 states have call successors, (0), 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,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2793 states to 2793 states and 3709 transitions. [2022-01-11 01:49:13,244 INFO L78 Accepts]: Start accepts. Automaton has 2793 states and 3709 transitions. Word has length 60 [2022-01-11 01:49:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:13,245 INFO L470 AbstractCegarLoop]: Abstraction has 2793 states and 3709 transitions. [2022-01-11 01:49:13,245 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:13,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2793 states and 3709 transitions. [2022-01-11 01:49:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-11 01:49:13,246 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:13,246 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:13,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 01:49:13,246 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:13,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:13,247 INFO L85 PathProgramCache]: Analyzing trace with hash 954314748, now seen corresponding path program 1 times [2022-01-11 01:49:13,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:13,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319165738] [2022-01-11 01:49:13,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:13,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:13,275 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:13,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:13,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319165738] [2022-01-11 01:49:13,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319165738] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:13,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:13,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:13,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437318702] [2022-01-11 01:49:13,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:13,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:13,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:13,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:13,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:13,276 INFO L87 Difference]: Start difference. First operand 2793 states and 3709 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:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:13,432 INFO L93 Difference]: Finished difference Result 4656 states and 6061 transitions. [2022-01-11 01:49:13,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:13,433 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:13,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:13,440 INFO L225 Difference]: With dead ends: 4656 [2022-01-11 01:49:13,440 INFO L226 Difference]: Without dead ends: 2793 [2022-01-11 01:49:13,443 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:13,443 INFO L933 BasicCegarLoop]: 1385 mSDtfsCounter, 1328 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 1469 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:13,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1328 Valid, 1469 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:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2022-01-11 01:49:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 2793. [2022-01-11 01:49:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2793 states, 2790 states have (on average 1.3150537634408601) internal successors, (3669), 2792 states have internal predecessors, (3669), 0 states have call successors, (0), 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,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2793 states to 2793 states and 3669 transitions. [2022-01-11 01:49:13,654 INFO L78 Accepts]: Start accepts. Automaton has 2793 states and 3669 transitions. Word has length 68 [2022-01-11 01:49:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:13,654 INFO L470 AbstractCegarLoop]: Abstraction has 2793 states and 3669 transitions. [2022-01-11 01:49:13,654 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:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2793 states and 3669 transitions. [2022-01-11 01:49:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-11 01:49:13,656 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:13,656 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:13,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 01:49:13,656 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:13,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:13,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1472568645, now seen corresponding path program 1 times [2022-01-11 01:49:13,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:13,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009919079] [2022-01-11 01:49:13,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:13,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:13,685 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:13,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:13,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009919079] [2022-01-11 01:49:13,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009919079] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:13,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:13,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:13,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805073267] [2022-01-11 01:49:13,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:13,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:13,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:13,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:13,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:13,687 INFO L87 Difference]: Start difference. First operand 2793 states and 3669 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:13,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:13,813 INFO L93 Difference]: Finished difference Result 4092 states and 5303 transitions. [2022-01-11 01:49:13,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:13,814 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:13,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:13,818 INFO L225 Difference]: With dead ends: 4092 [2022-01-11 01:49:13,819 INFO L226 Difference]: Without dead ends: 2467 [2022-01-11 01:49:13,821 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:13,821 INFO L933 BasicCegarLoop]: 1468 mSDtfsCounter, 99 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 2835 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:13,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 2835 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:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2022-01-11 01:49:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2465. [2022-01-11 01:49:13,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2465 states, 2462 states have (on average 1.3139723801787164) internal successors, (3235), 2464 states have internal predecessors, (3235), 0 states have call successors, (0), 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,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3235 transitions. [2022-01-11 01:49:13,975 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3235 transitions. Word has length 69 [2022-01-11 01:49:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:13,975 INFO L470 AbstractCegarLoop]: Abstraction has 2465 states and 3235 transitions. [2022-01-11 01:49:13,975 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:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3235 transitions. [2022-01-11 01:49:13,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-11 01:49:13,977 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:13,977 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:13,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 01:49:13,977 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:13,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:13,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1537729356, now seen corresponding path program 1 times [2022-01-11 01:49:13,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:13,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028874795] [2022-01-11 01:49:13,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:13,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:13,999 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:13,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:13,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028874795] [2022-01-11 01:49:13,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028874795] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:13,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:14,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:14,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171743292] [2022-01-11 01:49:14,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:14,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:14,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:14,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:14,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:14,000 INFO L87 Difference]: Start difference. First operand 2465 states and 3235 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:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:14,141 INFO L93 Difference]: Finished difference Result 4109 states and 5339 transitions. [2022-01-11 01:49:14,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:14,141 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:14,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:14,146 INFO L225 Difference]: With dead ends: 4109 [2022-01-11 01:49:14,146 INFO L226 Difference]: Without dead ends: 2741 [2022-01-11 01:49:14,148 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:14,149 INFO L933 BasicCegarLoop]: 1379 mSDtfsCounter, 1359 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 1467 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:14,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1359 Valid, 1467 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:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2022-01-11 01:49:14,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 2702. [2022-01-11 01:49:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2702 states, 2699 states have (on average 1.323823638384587) internal successors, (3573), 2701 states have internal predecessors, (3573), 0 states have call successors, (0), 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,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 3573 transitions. [2022-01-11 01:49:14,284 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 3573 transitions. Word has length 100 [2022-01-11 01:49:14,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:14,284 INFO L470 AbstractCegarLoop]: Abstraction has 2702 states and 3573 transitions. [2022-01-11 01:49:14,284 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:14,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 3573 transitions. [2022-01-11 01:49:14,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:14,286 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:14,286 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:14,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 01:49:14,286 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:14,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:14,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1450358746, now seen corresponding path program 1 times [2022-01-11 01:49:14,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:14,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495092806] [2022-01-11 01:49:14,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:14,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:14,337 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:14,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:14,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495092806] [2022-01-11 01:49:14,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495092806] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:14,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:14,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:14,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468385737] [2022-01-11 01:49:14,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:14,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:14,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:14,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:14,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:14,338 INFO L87 Difference]: Start difference. First operand 2702 states and 3573 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:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:14,475 INFO L93 Difference]: Finished difference Result 4311 states and 5618 transitions. [2022-01-11 01:49:14,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:14,475 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:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:14,479 INFO L225 Difference]: With dead ends: 4311 [2022-01-11 01:49:14,479 INFO L226 Difference]: Without dead ends: 2710 [2022-01-11 01:49:14,481 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:14,481 INFO L933 BasicCegarLoop]: 1367 mSDtfsCounter, 69 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 2624 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:14,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 2624 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:14,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states. [2022-01-11 01:49:14,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 2710. [2022-01-11 01:49:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2707 states have (on average 1.3132619135574437) internal successors, (3555), 2709 states have internal predecessors, (3555), 0 states have call successors, (0), 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,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3555 transitions. [2022-01-11 01:49:14,632 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3555 transitions. Word has length 110 [2022-01-11 01:49:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:14,633 INFO L470 AbstractCegarLoop]: Abstraction has 2710 states and 3555 transitions. [2022-01-11 01:49:14,633 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:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3555 transitions. [2022-01-11 01:49:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:14,636 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:14,636 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:14,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 01:49:14,637 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:14,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:14,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1690898875, now seen corresponding path program 1 times [2022-01-11 01:49:14,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:14,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499097209] [2022-01-11 01:49:14,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:14,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:14,684 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:14,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:14,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499097209] [2022-01-11 01:49:14,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499097209] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:14,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:14,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:14,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080131717] [2022-01-11 01:49:14,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:14,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:14,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:14,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:14,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:14,686 INFO L87 Difference]: Start difference. First operand 2710 states and 3555 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:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:14,867 INFO L93 Difference]: Finished difference Result 3473 states and 4513 transitions. [2022-01-11 01:49:14,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:14,867 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:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:14,870 INFO L225 Difference]: With dead ends: 3473 [2022-01-11 01:49:14,870 INFO L226 Difference]: Without dead ends: 1864 [2022-01-11 01:49:14,872 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:14,872 INFO L933 BasicCegarLoop]: 1370 mSDtfsCounter, 1332 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 1391 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:14,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1332 Valid, 1391 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:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-01-11 01:49:15,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1864. [2022-01-11 01:49:15,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1861 states have (on average 1.3283181085437936) internal successors, (2472), 1863 states have internal predecessors, (2472), 0 states have call successors, (0), 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,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2472 transitions. [2022-01-11 01:49:15,010 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2472 transitions. Word has length 110 [2022-01-11 01:49:15,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:15,010 INFO L470 AbstractCegarLoop]: Abstraction has 1864 states and 2472 transitions. [2022-01-11 01:49:15,010 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:15,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2472 transitions. [2022-01-11 01:49:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:15,012 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:15,012 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] [2022-01-11 01:49:15,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 01:49:15,012 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:15,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:15,013 INFO L85 PathProgramCache]: Analyzing trace with hash 235960119, now seen corresponding path program 1 times [2022-01-11 01:49:15,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:15,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576360682] [2022-01-11 01:49:15,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:15,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:15,041 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:15,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:15,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576360682] [2022-01-11 01:49:15,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576360682] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:15,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:15,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:15,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78490383] [2022-01-11 01:49:15,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:15,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:15,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:15,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:15,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:15,044 INFO L87 Difference]: Start difference. First operand 1864 states and 2472 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:15,182 INFO L93 Difference]: Finished difference Result 3367 states and 4707 transitions. [2022-01-11 01:49:15,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:15,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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:15,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:15,186 INFO L225 Difference]: With dead ends: 3367 [2022-01-11 01:49:15,186 INFO L226 Difference]: Without dead ends: 2542 [2022-01-11 01:49:15,188 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:15,188 INFO L933 BasicCegarLoop]: 1368 mSDtfsCounter, 1272 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 2448 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:15,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1272 Valid, 2448 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:15,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2022-01-11 01:49:15,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2538. [2022-01-11 01:49:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2535 states have (on average 1.368836291913215) internal successors, (3470), 2537 states have internal predecessors, (3470), 0 states have call successors, (0), 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,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3470 transitions. [2022-01-11 01:49:15,298 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3470 transitions. Word has length 110 [2022-01-11 01:49:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:15,298 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 3470 transitions. [2022-01-11 01:49:15,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3470 transitions. [2022-01-11 01:49:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:15,300 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:15,300 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] [2022-01-11 01:49:15,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 01:49:15,301 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:15,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:15,301 INFO L85 PathProgramCache]: Analyzing trace with hash 58394455, now seen corresponding path program 1 times [2022-01-11 01:49:15,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:15,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900401559] [2022-01-11 01:49:15,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:15,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:15,328 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:15,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:15,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900401559] [2022-01-11 01:49:15,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900401559] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:15,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:15,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:15,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635422061] [2022-01-11 01:49:15,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:15,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:15,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:15,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:15,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:15,329 INFO L87 Difference]: Start difference. First operand 2538 states and 3470 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:15,458 INFO L93 Difference]: Finished difference Result 4036 states and 5698 transitions. [2022-01-11 01:49:15,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:15,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:15,463 INFO L225 Difference]: With dead ends: 4036 [2022-01-11 01:49:15,463 INFO L226 Difference]: Without dead ends: 2538 [2022-01-11 01:49:15,465 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:15,465 INFO L933 BasicCegarLoop]: 1362 mSDtfsCounter, 1352 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 1362 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:15,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1352 Valid, 1362 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:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-01-11 01:49:15,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-01-11 01:49:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2535 states have (on average 1.365680473372781) internal successors, (3462), 2537 states have internal predecessors, (3462), 0 states have call successors, (0), 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,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3462 transitions. [2022-01-11 01:49:15,590 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3462 transitions. Word has length 110 [2022-01-11 01:49:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:15,590 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 3462 transitions. [2022-01-11 01:49:15,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3462 transitions. [2022-01-11 01:49:15,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:15,592 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:15,592 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] [2022-01-11 01:49:15,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 01:49:15,592 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:15,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:15,592 INFO L85 PathProgramCache]: Analyzing trace with hash 745403191, now seen corresponding path program 1 times [2022-01-11 01:49:15,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:15,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711826517] [2022-01-11 01:49:15,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:15,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:15,617 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:15,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:15,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711826517] [2022-01-11 01:49:15,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711826517] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:15,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:15,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:15,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69802021] [2022-01-11 01:49:15,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:15,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:15,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:15,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:15,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:15,618 INFO L87 Difference]: Start difference. First operand 2538 states and 3462 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:15,742 INFO L93 Difference]: Finished difference Result 4035 states and 5681 transitions. [2022-01-11 01:49:15,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:15,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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:15,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:15,747 INFO L225 Difference]: With dead ends: 4035 [2022-01-11 01:49:15,747 INFO L226 Difference]: Without dead ends: 2538 [2022-01-11 01:49:15,748 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:15,749 INFO L933 BasicCegarLoop]: 1357 mSDtfsCounter, 1346 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 1357 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:15,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1346 Valid, 1357 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:15,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-01-11 01:49:15,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-01-11 01:49:15,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2535 states have (on average 1.362524654832347) internal successors, (3454), 2537 states have internal predecessors, (3454), 0 states have call successors, (0), 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,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3454 transitions. [2022-01-11 01:49:15,884 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3454 transitions. Word has length 110 [2022-01-11 01:49:15,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:15,884 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 3454 transitions. [2022-01-11 01:49:15,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3454 transitions. [2022-01-11 01:49:15,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:15,885 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:15,885 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] [2022-01-11 01:49:15,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 01:49:15,886 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:15,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:15,886 INFO L85 PathProgramCache]: Analyzing trace with hash 629017431, now seen corresponding path program 1 times [2022-01-11 01:49:15,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:15,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799440459] [2022-01-11 01:49:15,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:15,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:15,912 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:15,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:15,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799440459] [2022-01-11 01:49:15,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799440459] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:15,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:15,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:15,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665838582] [2022-01-11 01:49:15,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:15,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:15,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:15,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:15,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:15,913 INFO L87 Difference]: Start difference. First operand 2538 states and 3454 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:16,044 INFO L93 Difference]: Finished difference Result 4034 states and 5664 transitions. [2022-01-11 01:49:16,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:16,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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:16,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:16,048 INFO L225 Difference]: With dead ends: 4034 [2022-01-11 01:49:16,048 INFO L226 Difference]: Without dead ends: 2538 [2022-01-11 01:49:16,050 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:16,050 INFO L933 BasicCegarLoop]: 1352 mSDtfsCounter, 1340 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 1352 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:16,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1340 Valid, 1352 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:16,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-01-11 01:49:16,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-01-11 01:49:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2535 states have (on average 1.3593688362919132) internal successors, (3446), 2537 states have internal predecessors, (3446), 0 states have call successors, (0), 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,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3446 transitions. [2022-01-11 01:49:16,165 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3446 transitions. Word has length 110 [2022-01-11 01:49:16,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:16,165 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 3446 transitions. [2022-01-11 01:49:16,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3446 transitions. [2022-01-11 01:49:16,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:16,167 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:16,167 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] [2022-01-11 01:49:16,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 01:49:16,167 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:16,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:16,168 INFO L85 PathProgramCache]: Analyzing trace with hash -67473609, now seen corresponding path program 1 times [2022-01-11 01:49:16,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:16,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461581110] [2022-01-11 01:49:16,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:16,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:16,204 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:16,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:16,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461581110] [2022-01-11 01:49:16,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461581110] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:16,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:16,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:16,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64243271] [2022-01-11 01:49:16,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:16,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:16,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:16,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:16,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:16,207 INFO L87 Difference]: Start difference. First operand 2538 states and 3446 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:16,349 INFO L93 Difference]: Finished difference Result 4033 states and 5647 transitions. [2022-01-11 01:49:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:16,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:16,352 INFO L225 Difference]: With dead ends: 4033 [2022-01-11 01:49:16,352 INFO L226 Difference]: Without dead ends: 2538 [2022-01-11 01:49:16,353 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:16,354 INFO L933 BasicCegarLoop]: 1347 mSDtfsCounter, 1334 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 1347 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:16,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1334 Valid, 1347 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:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-01-11 01:49:16,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-01-11 01:49:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2535 states have (on average 1.3562130177514793) internal successors, (3438), 2537 states have internal predecessors, (3438), 0 states have call successors, (0), 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,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3438 transitions. [2022-01-11 01:49:16,475 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3438 transitions. Word has length 110 [2022-01-11 01:49:16,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:16,476 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 3438 transitions. [2022-01-11 01:49:16,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3438 transitions. [2022-01-11 01:49:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:16,479 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 01:49:16,479 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:16,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:16,479 INFO L85 PathProgramCache]: Analyzing trace with hash 879890263, now seen corresponding path program 1 times [2022-01-11 01:49:16,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:16,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170488252] [2022-01-11 01:49:16,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:16,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:16,505 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:16,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:16,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170488252] [2022-01-11 01:49:16,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170488252] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:16,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:16,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:16,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026027078] [2022-01-11 01:49:16,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:16,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:16,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:16,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:16,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:16,507 INFO L87 Difference]: Start difference. First operand 2538 states and 3438 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:16,643 INFO L93 Difference]: Finished difference Result 4032 states and 5630 transitions. [2022-01-11 01:49:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:16,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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:16,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:16,648 INFO L225 Difference]: With dead ends: 4032 [2022-01-11 01:49:16,648 INFO L226 Difference]: Without dead ends: 2538 [2022-01-11 01:49:16,650 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:16,651 INFO L933 BasicCegarLoop]: 1342 mSDtfsCounter, 1328 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 1342 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:16,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1328 Valid, 1342 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:16,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-01-11 01:49:16,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-01-11 01:49:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2535 states have (on average 1.3530571992110454) internal successors, (3430), 2537 states have internal predecessors, (3430), 0 states have call successors, (0), 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,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3430 transitions. [2022-01-11 01:49:16,817 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3430 transitions. Word has length 110 [2022-01-11 01:49:16,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:16,817 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 3430 transitions. [2022-01-11 01:49:16,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3430 transitions. [2022-01-11 01:49:16,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:16,819 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:16,819 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] [2022-01-11 01:49:16,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 01:49:16,819 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:16,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:16,820 INFO L85 PathProgramCache]: Analyzing trace with hash -59380937, now seen corresponding path program 1 times [2022-01-11 01:49:16,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:16,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487786622] [2022-01-11 01:49:16,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:16,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:16,856 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:16,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:16,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487786622] [2022-01-11 01:49:16,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487786622] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:16,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:16,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:16,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071101110] [2022-01-11 01:49:16,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:16,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:16,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:16,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:16,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:16,858 INFO L87 Difference]: Start difference. First operand 2538 states and 3430 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:17,032 INFO L93 Difference]: Finished difference Result 4031 states and 5613 transitions. [2022-01-11 01:49:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:17,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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:17,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:17,036 INFO L225 Difference]: With dead ends: 4031 [2022-01-11 01:49:17,036 INFO L226 Difference]: Without dead ends: 2538 [2022-01-11 01:49:17,039 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,039 INFO L933 BasicCegarLoop]: 1337 mSDtfsCounter, 1322 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 1337 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:17,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1322 Valid, 1337 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:17,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-01-11 01:49:17,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-01-11 01:49:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2535 states have (on average 1.3499013806706115) internal successors, (3422), 2537 states have internal predecessors, (3422), 0 states have call successors, (0), 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,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3422 transitions. [2022-01-11 01:49:17,170 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3422 transitions. Word has length 110 [2022-01-11 01:49:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:17,170 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 3422 transitions. [2022-01-11 01:49:17,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3422 transitions. [2022-01-11 01:49:17,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:17,172 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:17,172 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] [2022-01-11 01:49:17,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 01:49:17,173 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:17,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:17,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1198058665, now seen corresponding path program 1 times [2022-01-11 01:49:17,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:17,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670985663] [2022-01-11 01:49:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:17,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:17,199 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:17,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:17,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670985663] [2022-01-11 01:49:17,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670985663] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:17,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:17,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:17,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953209497] [2022-01-11 01:49:17,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:17,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:17,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:17,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:17,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:17,200 INFO L87 Difference]: Start difference. First operand 2538 states and 3422 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:17,336 INFO L93 Difference]: Finished difference Result 4030 states and 5596 transitions. [2022-01-11 01:49:17,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:17,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:17,340 INFO L225 Difference]: With dead ends: 4030 [2022-01-11 01:49:17,340 INFO L226 Difference]: Without dead ends: 2538 [2022-01-11 01:49:17,342 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,342 INFO L933 BasicCegarLoop]: 1332 mSDtfsCounter, 1316 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 1332 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:17,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1316 Valid, 1332 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:17,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-01-11 01:49:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-01-11 01:49:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2535 states have (on average 1.3467455621301776) internal successors, (3414), 2537 states have internal predecessors, (3414), 0 states have call successors, (0), 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,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3414 transitions. [2022-01-11 01:49:17,513 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3414 transitions. Word has length 110 [2022-01-11 01:49:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:17,513 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 3414 transitions. [2022-01-11 01:49:17,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3414 transitions. [2022-01-11 01:49:17,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:17,514 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:17,514 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] [2022-01-11 01:49:17,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 01:49:17,515 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:17,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:17,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1650432201, now seen corresponding path program 1 times [2022-01-11 01:49:17,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:17,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693483464] [2022-01-11 01:49:17,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:17,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:17,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:17,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:17,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693483464] [2022-01-11 01:49:17,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693483464] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:17,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:17,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:17,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212966788] [2022-01-11 01:49:17,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:17,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:17,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:17,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:17,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:17,542 INFO L87 Difference]: Start difference. First operand 2538 states and 3414 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:17,704 INFO L93 Difference]: Finished difference Result 4029 states and 5579 transitions. [2022-01-11 01:49:17,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:17,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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:17,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:17,709 INFO L225 Difference]: With dead ends: 4029 [2022-01-11 01:49:17,709 INFO L226 Difference]: Without dead ends: 2538 [2022-01-11 01:49:17,711 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,715 INFO L933 BasicCegarLoop]: 1307 mSDtfsCounter, 1218 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:17,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1218 Valid, 1385 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-01-11 01:49:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-01-11 01:49:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2535 states have (on average 1.3364891518737672) internal successors, (3388), 2537 states have internal predecessors, (3388), 0 states have call successors, (0), 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,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3388 transitions. [2022-01-11 01:49:17,857 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3388 transitions. Word has length 110 [2022-01-11 01:49:17,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:17,857 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 3388 transitions. [2022-01-11 01:49:17,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3388 transitions. [2022-01-11 01:49:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:17,860 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:17,860 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] [2022-01-11 01:49:17,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 01:49:17,860 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:17,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2091344682, now seen corresponding path program 1 times [2022-01-11 01:49:17,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:17,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307759637] [2022-01-11 01:49:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:17,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:17,903 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:17,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:17,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307759637] [2022-01-11 01:49:17,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307759637] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:17,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:17,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:17,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839804706] [2022-01-11 01:49:17,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:17,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:17,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:17,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:17,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:17,904 INFO L87 Difference]: Start difference. First operand 2538 states and 3388 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:18,080 INFO L93 Difference]: Finished difference Result 4028 states and 5526 transitions. [2022-01-11 01:49:18,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:18,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:18,084 INFO L225 Difference]: With dead ends: 4028 [2022-01-11 01:49:18,084 INFO L226 Difference]: Without dead ends: 2538 [2022-01-11 01:49:18,086 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:18,086 INFO L933 BasicCegarLoop]: 1292 mSDtfsCounter, 1203 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:18,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1203 Valid, 1369 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:18,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-01-11 01:49:18,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-01-11 01:49:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2535 states have (on average 1.326232741617357) internal successors, (3362), 2537 states have internal predecessors, (3362), 0 states have call successors, (0), 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,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3362 transitions. [2022-01-11 01:49:18,223 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3362 transitions. Word has length 110 [2022-01-11 01:49:18,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:18,223 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 3362 transitions. [2022-01-11 01:49:18,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3362 transitions. [2022-01-11 01:49:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:18,225 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:18,225 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] [2022-01-11 01:49:18,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 01:49:18,225 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:18,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:18,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1141291381, now seen corresponding path program 1 times [2022-01-11 01:49:18,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:18,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336137879] [2022-01-11 01:49:18,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:18,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:18,247 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:18,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:18,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336137879] [2022-01-11 01:49:18,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336137879] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:18,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:18,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:18,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147283136] [2022-01-11 01:49:18,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:18,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:18,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:18,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:18,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:18,249 INFO L87 Difference]: Start difference. First operand 2538 states and 3362 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:18,406 INFO L93 Difference]: Finished difference Result 4027 states and 5473 transitions. [2022-01-11 01:49:18,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:18,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:18,410 INFO L225 Difference]: With dead ends: 4027 [2022-01-11 01:49:18,410 INFO L226 Difference]: Without dead ends: 2538 [2022-01-11 01:49:18,412 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:18,412 INFO L933 BasicCegarLoop]: 1277 mSDtfsCounter, 1188 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:18,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1188 Valid, 1353 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:18,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-01-11 01:49:18,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-01-11 01:49:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2535 states have (on average 1.3159763313609467) internal successors, (3336), 2537 states have internal predecessors, (3336), 0 states have call successors, (0), 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 L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3336 transitions. [2022-01-11 01:49:18,587 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3336 transitions. Word has length 110 [2022-01-11 01:49:18,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:18,587 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 3336 transitions. [2022-01-11 01:49:18,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3336 transitions. [2022-01-11 01:49:18,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:18,589 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:18,589 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] [2022-01-11 01:49:18,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 01:49:18,589 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:18,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:18,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1180794260, now seen corresponding path program 1 times [2022-01-11 01:49:18,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:18,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524857268] [2022-01-11 01:49:18,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:18,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:18,613 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:18,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:18,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524857268] [2022-01-11 01:49:18,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524857268] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:18,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:18,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:18,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924341006] [2022-01-11 01:49:18,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:18,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:18,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:18,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:18,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:18,614 INFO L87 Difference]: Start difference. First operand 2538 states and 3336 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:18,786 INFO L93 Difference]: Finished difference Result 4025 states and 5418 transitions. [2022-01-11 01:49:18,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:18,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:18,791 INFO L225 Difference]: With dead ends: 4025 [2022-01-11 01:49:18,791 INFO L226 Difference]: Without dead ends: 2538 [2022-01-11 01:49:18,793 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:18,793 INFO L933 BasicCegarLoop]: 1262 mSDtfsCounter, 1172 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:18,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1172 Valid, 1337 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:18,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-01-11 01:49:18,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-01-11 01:49:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2535 states have (on average 1.3057199211045365) internal successors, (3310), 2537 states have internal predecessors, (3310), 0 states have call successors, (0), 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,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3310 transitions. [2022-01-11 01:49:18,946 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3310 transitions. Word has length 110 [2022-01-11 01:49:18,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:18,947 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 3310 transitions. [2022-01-11 01:49:18,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3310 transitions. [2022-01-11 01:49:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:18,948 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:18,948 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] [2022-01-11 01:49:18,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 01:49:18,948 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:18,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:18,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1181315021, now seen corresponding path program 1 times [2022-01-11 01:49:18,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:18,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232491539] [2022-01-11 01:49:18,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:18,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:18,975 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:18,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:18,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232491539] [2022-01-11 01:49:18,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232491539] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:18,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:18,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:18,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245793524] [2022-01-11 01:49:18,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:18,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:18,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:18,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:18,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:18,977 INFO L87 Difference]: Start difference. First operand 2538 states and 3310 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:19,204 INFO L93 Difference]: Finished difference Result 4024 states and 5365 transitions. [2022-01-11 01:49:19,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:19,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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:19,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:19,209 INFO L225 Difference]: With dead ends: 4024 [2022-01-11 01:49:19,209 INFO L226 Difference]: Without dead ends: 2538 [2022-01-11 01:49:19,211 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,214 INFO L933 BasicCegarLoop]: 1247 mSDtfsCounter, 1157 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:19,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1157 Valid, 1321 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-01-11 01:49:19,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-01-11 01:49:19,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2535 states have (on average 1.2954635108481263) internal successors, (3284), 2537 states have internal predecessors, (3284), 0 states have call successors, (0), 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,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3284 transitions. [2022-01-11 01:49:19,424 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3284 transitions. Word has length 110 [2022-01-11 01:49:19,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:19,424 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 3284 transitions. [2022-01-11 01:49:19,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3284 transitions. [2022-01-11 01:49:19,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:19,425 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:19,426 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] [2022-01-11 01:49:19,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 01:49:19,426 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:19,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:19,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1732040238, now seen corresponding path program 1 times [2022-01-11 01:49:19,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:19,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601026124] [2022-01-11 01:49:19,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:19,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:19,452 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,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:19,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601026124] [2022-01-11 01:49:19,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601026124] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:19,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:19,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:19,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551180327] [2022-01-11 01:49:19,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:19,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:19,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:19,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:19,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:19,453 INFO L87 Difference]: Start difference. First operand 2538 states and 3284 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:19,673 INFO L93 Difference]: Finished difference Result 4023 states and 5312 transitions. [2022-01-11 01:49:19,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:19,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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:19,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:19,678 INFO L225 Difference]: With dead ends: 4023 [2022-01-11 01:49:19,679 INFO L226 Difference]: Without dead ends: 2538 [2022-01-11 01:49:19,681 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,681 INFO L933 BasicCegarLoop]: 1232 mSDtfsCounter, 1142 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:19,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1142 Valid, 1305 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:19,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-01-11 01:49:19,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-01-11 01:49:19,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2535 states have (on average 1.285207100591716) internal successors, (3258), 2537 states have internal predecessors, (3258), 0 states have call successors, (0), 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,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3258 transitions. [2022-01-11 01:49:19,840 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3258 transitions. Word has length 110 [2022-01-11 01:49:19,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:19,840 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 3258 transitions. [2022-01-11 01:49:19,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3258 transitions. [2022-01-11 01:49:19,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:19,841 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:19,841 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] [2022-01-11 01:49:19,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 01:49:19,842 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:19,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:19,842 INFO L85 PathProgramCache]: Analyzing trace with hash 204098289, now seen corresponding path program 1 times [2022-01-11 01:49:19,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:19,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953698004] [2022-01-11 01:49:19,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:19,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:19,864 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,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:19,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953698004] [2022-01-11 01:49:19,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953698004] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:19,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:19,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:19,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139971503] [2022-01-11 01:49:19,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:19,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:19,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:19,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:19,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:19,866 INFO L87 Difference]: Start difference. First operand 2538 states and 3258 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:20,064 INFO L93 Difference]: Finished difference Result 4022 states and 5259 transitions. [2022-01-11 01:49:20,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:20,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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:20,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:20,070 INFO L225 Difference]: With dead ends: 4022 [2022-01-11 01:49:20,070 INFO L226 Difference]: Without dead ends: 2538 [2022-01-11 01:49:20,072 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,073 INFO L933 BasicCegarLoop]: 1217 mSDtfsCounter, 1127 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:20,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1127 Valid, 1289 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-01-11 01:49:20,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-01-11 01:49:20,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2535 states have (on average 1.2749506903353056) internal successors, (3232), 2537 states have internal predecessors, (3232), 0 states have call successors, (0), 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,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3232 transitions. [2022-01-11 01:49:20,233 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3232 transitions. Word has length 110 [2022-01-11 01:49:20,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:20,233 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 3232 transitions. [2022-01-11 01:49:20,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3232 transitions. [2022-01-11 01:49:20,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:20,235 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:20,235 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] [2022-01-11 01:49:20,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 01:49:20,235 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:20,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:20,235 INFO L85 PathProgramCache]: Analyzing trace with hash -899955952, now seen corresponding path program 1 times [2022-01-11 01:49:20,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:20,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422211438] [2022-01-11 01:49:20,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:20,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:20,274 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,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:20,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422211438] [2022-01-11 01:49:20,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422211438] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:20,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:20,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:49:20,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335939365] [2022-01-11 01:49:20,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:20,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:49:20,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:20,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:49:20,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:49:20,275 INFO L87 Difference]: Start difference. First operand 2538 states and 3232 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:20,549 INFO L93 Difference]: Finished difference Result 4633 states and 6069 transitions. [2022-01-11 01:49:20,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:49:20,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:20,554 INFO L225 Difference]: With dead ends: 4633 [2022-01-11 01:49:20,554 INFO L226 Difference]: Without dead ends: 3156 [2022-01-11 01:49:20,556 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:20,557 INFO L933 BasicCegarLoop]: 1324 mSDtfsCounter, 3129 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3129 SdHoareTripleChecker+Valid, 2967 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:20,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3129 Valid, 2967 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:49:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3156 states. [2022-01-11 01:49:20,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3156 to 2544. [2022-01-11 01:49:20,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 2541 states have (on average 1.2672176308539944) internal successors, (3220), 2543 states have internal predecessors, (3220), 0 states have call successors, (0), 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,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3220 transitions. [2022-01-11 01:49:20,738 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 3220 transitions. Word has length 110 [2022-01-11 01:49:20,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:20,738 INFO L470 AbstractCegarLoop]: Abstraction has 2544 states and 3220 transitions. [2022-01-11 01:49:20,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3220 transitions. [2022-01-11 01:49:20,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:20,740 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:20,740 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] [2022-01-11 01:49:20,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 01:49:20,740 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash -32903727, now seen corresponding path program 1 times [2022-01-11 01:49:20,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:20,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454927828] [2022-01-11 01:49:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:20,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:20,785 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,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:20,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454927828] [2022-01-11 01:49:20,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454927828] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:20,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:20,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:49:20,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137761160] [2022-01-11 01:49:20,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:20,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:49:20,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:20,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:49:20,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:49:20,787 INFO L87 Difference]: Start difference. First operand 2544 states and 3220 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:21,133 INFO L93 Difference]: Finished difference Result 4833 states and 6274 transitions. [2022-01-11 01:49:21,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:49:21,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:21,139 INFO L225 Difference]: With dead ends: 4833 [2022-01-11 01:49:21,140 INFO L226 Difference]: Without dead ends: 3364 [2022-01-11 01:49:21,142 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:21,142 INFO L933 BasicCegarLoop]: 1278 mSDtfsCounter, 2875 mSDsluCounter, 2107 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2875 SdHoareTripleChecker+Valid, 3385 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:21,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2875 Valid, 3385 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:49:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2022-01-11 01:49:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 2550. [2022-01-11 01:49:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 2547 states have (on average 1.259521005104044) internal successors, (3208), 2549 states have internal predecessors, (3208), 0 states have call successors, (0), 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,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 3208 transitions. [2022-01-11 01:49:21,354 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 3208 transitions. Word has length 110 [2022-01-11 01:49:21,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:21,354 INFO L470 AbstractCegarLoop]: Abstraction has 2550 states and 3208 transitions. [2022-01-11 01:49:21,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3208 transitions. [2022-01-11 01:49:21,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:21,355 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:21,355 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] [2022-01-11 01:49:21,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 01:49:21,356 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:21,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:21,356 INFO L85 PathProgramCache]: Analyzing trace with hash -241602030, now seen corresponding path program 1 times [2022-01-11 01:49:21,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:21,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182706612] [2022-01-11 01:49:21,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:21,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:21,380 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,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:21,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182706612] [2022-01-11 01:49:21,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182706612] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:21,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:21,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:21,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403942427] [2022-01-11 01:49:21,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:21,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:21,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:21,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:21,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:21,381 INFO L87 Difference]: Start difference. First operand 2550 states and 3208 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:21,676 INFO L93 Difference]: Finished difference Result 5307 states and 6804 transitions. [2022-01-11 01:49:21,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:21,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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:21,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:21,682 INFO L225 Difference]: With dead ends: 5307 [2022-01-11 01:49:21,683 INFO L226 Difference]: Without dead ends: 3834 [2022-01-11 01:49:21,685 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,685 INFO L933 BasicCegarLoop]: 1198 mSDtfsCounter, 1054 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 2137 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:21,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1054 Valid, 2137 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:21,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3834 states. [2022-01-11 01:49:21,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3834 to 3826. [2022-01-11 01:49:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3826 states, 3823 states have (on average 1.2696834946377191) internal successors, (4854), 3825 states have internal predecessors, (4854), 0 states have call successors, (0), 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,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 4854 transitions. [2022-01-11 01:49:21,971 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 4854 transitions. Word has length 110 [2022-01-11 01:49:21,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:21,971 INFO L470 AbstractCegarLoop]: Abstraction has 3826 states and 4854 transitions. [2022-01-11 01:49:21,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 4854 transitions. [2022-01-11 01:49:21,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:21,973 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:21,973 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] [2022-01-11 01:49:21,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 01:49:21,973 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:21,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:21,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1206474415, now seen corresponding path program 1 times [2022-01-11 01:49:21,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:21,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84274376] [2022-01-11 01:49:21,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:21,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:22,007 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,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:22,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84274376] [2022-01-11 01:49:22,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84274376] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:22,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:22,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:49:22,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615467612] [2022-01-11 01:49:22,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:22,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:49:22,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:22,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:49:22,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:49:22,008 INFO L87 Difference]: Start difference. First operand 3826 states and 4854 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:22,538 INFO L93 Difference]: Finished difference Result 8833 states and 11381 transitions. [2022-01-11 01:49:22,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:49:22,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:22,548 INFO L225 Difference]: With dead ends: 8833 [2022-01-11 01:49:22,548 INFO L226 Difference]: Without dead ends: 6088 [2022-01-11 01:49:22,552 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:22,552 INFO L933 BasicCegarLoop]: 1256 mSDtfsCounter, 3137 mSDsluCounter, 4565 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3137 SdHoareTripleChecker+Valid, 5821 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:22,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3137 Valid, 5821 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:49:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6088 states. [2022-01-11 01:49:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6088 to 3883. [2022-01-11 01:49:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3883 states, 3880 states have (on average 1.261082474226804) internal successors, (4893), 3882 states have internal predecessors, (4893), 0 states have call successors, (0), 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 3883 states to 3883 states and 4893 transitions. [2022-01-11 01:49:22,977 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 4893 transitions. Word has length 110 [2022-01-11 01:49:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:22,977 INFO L470 AbstractCegarLoop]: Abstraction has 3883 states and 4893 transitions. [2022-01-11 01:49:22,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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 L276 IsEmpty]: Start isEmpty. Operand 3883 states and 4893 transitions. [2022-01-11 01:49:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [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] [2022-01-11 01:49:22,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 01:49:22,979 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:22,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:22,980 INFO L85 PathProgramCache]: Analyzing trace with hash -576015790, 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 [828803796] [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,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:23,012 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,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:23,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828803796] [2022-01-11 01:49:23,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828803796] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:23,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:23,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:23,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897932931] [2022-01-11 01:49:23,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:23,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:23,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:23,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:23,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:23,013 INFO L87 Difference]: Start difference. First operand 3883 states and 4893 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:23,329 INFO L93 Difference]: Finished difference Result 6665 states and 8466 transitions. [2022-01-11 01:49:23,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:23,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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:23,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:23,335 INFO L225 Difference]: With dead ends: 6665 [2022-01-11 01:49:23,335 INFO L226 Difference]: Without dead ends: 3832 [2022-01-11 01:49:23,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:23,339 INFO L933 BasicCegarLoop]: 1171 mSDtfsCounter, 1022 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:23,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1022 Valid, 1240 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:23,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3832 states. [2022-01-11 01:49:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3832 to 3832. [2022-01-11 01:49:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3832 states, 3829 states have (on average 1.2520240271611387) internal successors, (4794), 3831 states have internal predecessors, (4794), 0 states have call successors, (0), 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,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 4794 transitions. [2022-01-11 01:49:23,636 INFO L78 Accepts]: Start accepts. Automaton has 3832 states and 4794 transitions. Word has length 110 [2022-01-11 01:49:23,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:23,637 INFO L470 AbstractCegarLoop]: Abstraction has 3832 states and 4794 transitions. [2022-01-11 01:49:23,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3832 states and 4794 transitions. [2022-01-11 01:49:23,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:23,638 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:23,638 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] [2022-01-11 01:49:23,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 01:49:23,638 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:23,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:23,639 INFO L85 PathProgramCache]: Analyzing trace with hash -984840015, now seen corresponding path program 1 times [2022-01-11 01:49:23,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:23,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729845999] [2022-01-11 01:49:23,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:23,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:23,684 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,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:23,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729845999] [2022-01-11 01:49:23,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729845999] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:23,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:23,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:23,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625164811] [2022-01-11 01:49:23,685 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,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:23,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:23,686 INFO L87 Difference]: Start difference. First operand 3832 states and 4794 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:24,192 INFO L93 Difference]: Finished difference Result 9228 states and 11665 transitions. [2022-01-11 01:49:24,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:24,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:24,200 INFO L225 Difference]: With dead ends: 9228 [2022-01-11 01:49:24,200 INFO L226 Difference]: Without dead ends: 6452 [2022-01-11 01:49:24,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:24,204 INFO L933 BasicCegarLoop]: 1171 mSDtfsCounter, 1036 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 2089 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:24,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1036 Valid, 2089 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6452 states. [2022-01-11 01:49:24,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6452 to 6234. [2022-01-11 01:49:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6234 states, 6231 states have (on average 1.2550152463489006) internal successors, (7820), 6233 states have internal predecessors, (7820), 0 states have call successors, (0), 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,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 7820 transitions. [2022-01-11 01:49:24,711 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 7820 transitions. Word has length 110 [2022-01-11 01:49:24,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:24,711 INFO L470 AbstractCegarLoop]: Abstraction has 6234 states and 7820 transitions. [2022-01-11 01:49:24,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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,711 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 7820 transitions. [2022-01-11 01:49:24,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-11 01:49:24,712 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:24,712 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:24,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 01:49:24,713 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:24,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1621108930, now seen corresponding path program 1 times [2022-01-11 01:49:24,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:24,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025826578] [2022-01-11 01:49:24,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:24,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:24,742 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:24,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:24,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025826578] [2022-01-11 01:49:24,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025826578] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:24,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:24,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:24,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291461606] [2022-01-11 01:49:24,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:24,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:24,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:24,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:24,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:24,744 INFO L87 Difference]: Start difference. First operand 6234 states and 7820 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:25,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:25,213 INFO L93 Difference]: Finished difference Result 7006 states and 8764 transitions. [2022-01-11 01:49:25,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:25,213 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:25,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:25,220 INFO L225 Difference]: With dead ends: 7006 [2022-01-11 01:49:25,220 INFO L226 Difference]: Without dead ends: 6243 [2022-01-11 01:49:25,222 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:25,222 INFO L933 BasicCegarLoop]: 1178 mSDtfsCounter, 60 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 2246 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:25,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 2246 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:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6243 states. [2022-01-11 01:49:25,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6243 to 6243. [2022-01-11 01:49:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6243 states, 6240 states have (on average 1.2524038461538463) internal successors, (7815), 6242 states have internal predecessors, (7815), 0 states have call successors, (0), 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,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6243 states to 6243 states and 7815 transitions. [2022-01-11 01:49:25,732 INFO L78 Accepts]: Start accepts. Automaton has 6243 states and 7815 transitions. Word has length 113 [2022-01-11 01:49:25,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:25,732 INFO L470 AbstractCegarLoop]: Abstraction has 6243 states and 7815 transitions. [2022-01-11 01:49:25,732 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:25,732 INFO L276 IsEmpty]: Start isEmpty. Operand 6243 states and 7815 transitions. [2022-01-11 01:49:25,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-11 01:49:25,733 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:25,734 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:25,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 01:49:25,734 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:25,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:25,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1172412291, now seen corresponding path program 1 times [2022-01-11 01:49:25,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:25,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648381504] [2022-01-11 01:49:25,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:25,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:25,780 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:25,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:25,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648381504] [2022-01-11 01:49:25,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648381504] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:25,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:25,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:25,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746163454] [2022-01-11 01:49:25,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:25,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:25,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:25,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:25,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:25,783 INFO L87 Difference]: Start difference. First operand 6243 states and 7815 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:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:26,259 INFO L93 Difference]: Finished difference Result 6638 states and 8278 transitions. [2022-01-11 01:49:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:26,260 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:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:26,265 INFO L225 Difference]: With dead ends: 6638 [2022-01-11 01:49:26,265 INFO L226 Difference]: Without dead ends: 5210 [2022-01-11 01:49:26,267 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:26,267 INFO L933 BasicCegarLoop]: 1175 mSDtfsCounter, 1126 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1193 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:26,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1126 Valid, 1193 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:26,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5210 states. [2022-01-11 01:49:26,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5210 to 5210. [2022-01-11 01:49:26,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5210 states, 5208 states have (on average 1.2678571428571428) internal successors, (6603), 5209 states have internal predecessors, (6603), 0 states have call successors, (0), 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,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5210 states to 5210 states and 6603 transitions. [2022-01-11 01:49:26,680 INFO L78 Accepts]: Start accepts. Automaton has 5210 states and 6603 transitions. Word has length 113 [2022-01-11 01:49:26,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:26,680 INFO L470 AbstractCegarLoop]: Abstraction has 5210 states and 6603 transitions. [2022-01-11 01:49:26,680 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:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 5210 states and 6603 transitions. [2022-01-11 01:49:26,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-11 01:49:26,682 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:26,682 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] [2022-01-11 01:49:26,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-11 01:49:26,682 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:26,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:26,683 INFO L85 PathProgramCache]: Analyzing trace with hash 667228794, now seen corresponding path program 1 times [2022-01-11 01:49:26,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:26,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119470368] [2022-01-11 01:49:26,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:26,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:26,717 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:26,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:26,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119470368] [2022-01-11 01:49:26,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119470368] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:26,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:26,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:26,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920331313] [2022-01-11 01:49:26,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:26,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:26,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:26,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:26,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:26,719 INFO L87 Difference]: Start difference. First operand 5210 states and 6603 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:27,525 INFO L93 Difference]: Finished difference Result 15345 states and 19480 transitions. [2022-01-11 01:49:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:27,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2022-01-11 01:49:27,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:27,535 INFO L225 Difference]: With dead ends: 15345 [2022-01-11 01:49:27,536 INFO L226 Difference]: Without dead ends: 10173 [2022-01-11 01:49:27,540 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:27,541 INFO L933 BasicCegarLoop]: 1049 mSDtfsCounter, 949 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:27,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [949 Valid, 1967 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:27,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10173 states. [2022-01-11 01:49:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10173 to 9749. [2022-01-11 01:49:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9749 states, 9747 states have (on average 1.2653124038165589) internal successors, (12333), 9748 states have internal predecessors, (12333), 0 states have call successors, (0), 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,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9749 states to 9749 states and 12333 transitions. [2022-01-11 01:49:28,349 INFO L78 Accepts]: Start accepts. Automaton has 9749 states and 12333 transitions. Word has length 178 [2022-01-11 01:49:28,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:28,350 INFO L470 AbstractCegarLoop]: Abstraction has 9749 states and 12333 transitions. [2022-01-11 01:49:28,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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,350 INFO L276 IsEmpty]: Start isEmpty. Operand 9749 states and 12333 transitions. [2022-01-11 01:49:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-11 01:49:28,353 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:28,353 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] [2022-01-11 01:49:28,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-11 01:49:28,354 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:28,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:28,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1137802745, now seen corresponding path program 1 times [2022-01-11 01:49:28,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:28,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178883197] [2022-01-11 01:49:28,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:28,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:28,394 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:28,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:28,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178883197] [2022-01-11 01:49:28,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178883197] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:28,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:28,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:28,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594890482] [2022-01-11 01:49:28,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:28,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:28,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:28,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:28,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:28,395 INFO L87 Difference]: Start difference. First operand 9749 states and 12333 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:29,905 INFO L93 Difference]: Finished difference Result 28687 states and 36071 transitions. [2022-01-11 01:49:29,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:29,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2022-01-11 01:49:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:29,926 INFO L225 Difference]: With dead ends: 28687 [2022-01-11 01:49:29,927 INFO L226 Difference]: Without dead ends: 19039 [2022-01-11 01:49:29,935 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:29,935 INFO L933 BasicCegarLoop]: 1368 mSDtfsCounter, 946 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:29,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [946 Valid, 2399 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:29,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19039 states. [2022-01-11 01:49:31,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19039 to 18647. [2022-01-11 01:49:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18647 states, 18645 states have (on average 1.2502547599892733) internal successors, (23311), 18646 states have internal predecessors, (23311), 0 states have call successors, (0), 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,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18647 states to 18647 states and 23311 transitions. [2022-01-11 01:49:31,398 INFO L78 Accepts]: Start accepts. Automaton has 18647 states and 23311 transitions. Word has length 178 [2022-01-11 01:49:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:31,399 INFO L470 AbstractCegarLoop]: Abstraction has 18647 states and 23311 transitions. [2022-01-11 01:49:31,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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,399 INFO L276 IsEmpty]: Start isEmpty. Operand 18647 states and 23311 transitions. [2022-01-11 01:49:31,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-11 01:49:31,405 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:31,405 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] [2022-01-11 01:49:31,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-11 01:49:31,405 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:31,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:31,406 INFO L85 PathProgramCache]: Analyzing trace with hash 768746266, now seen corresponding path program 1 times [2022-01-11 01:49:31,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:31,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058633618] [2022-01-11 01:49:31,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:31,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:31,428 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,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:31,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058633618] [2022-01-11 01:49:31,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058633618] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:31,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:31,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:31,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209740560] [2022-01-11 01:49:31,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:31,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:31,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:31,430 INFO L87 Difference]: Start difference. First operand 18647 states and 23311 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:32,882 INFO L93 Difference]: Finished difference Result 37158 states and 46461 transitions. [2022-01-11 01:49:32,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:32,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 178 [2022-01-11 01:49:32,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:32,912 INFO L225 Difference]: With dead ends: 37158 [2022-01-11 01:49:32,912 INFO L226 Difference]: Without dead ends: 18553 [2022-01-11 01:49:32,933 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,933 INFO L933 BasicCegarLoop]: 1060 mSDtfsCounter, 1055 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1061 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,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1055 Valid, 1061 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,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18553 states. [2022-01-11 01:49:34,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18553 to 18553. [2022-01-11 01:49:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18553 states, 18551 states have (on average 1.250606436310711) internal successors, (23200), 18552 states have internal predecessors, (23200), 0 states have call successors, (0), 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:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18553 states to 18553 states and 23200 transitions. [2022-01-11 01:49:34,637 INFO L78 Accepts]: Start accepts. Automaton has 18553 states and 23200 transitions. Word has length 178 [2022-01-11 01:49:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:34,637 INFO L470 AbstractCegarLoop]: Abstraction has 18553 states and 23200 transitions. [2022-01-11 01:49:34,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 18553 states and 23200 transitions. [2022-01-11 01:49:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-01-11 01:49:34,643 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:34,643 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] [2022-01-11 01:49:34,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-11 01:49:34,643 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:34,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:34,644 INFO L85 PathProgramCache]: Analyzing trace with hash 363892076, now seen corresponding path program 1 times [2022-01-11 01:49:34,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:34,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222118262] [2022-01-11 01:49:34,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:34,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:34,684 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:34,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:34,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222118262] [2022-01-11 01:49:34,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222118262] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:34,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:34,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:34,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476565012] [2022-01-11 01:49:34,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:34,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:34,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:34,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:34,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:34,686 INFO L87 Difference]: Start difference. First operand 18553 states and 23200 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:37,408 INFO L93 Difference]: Finished difference Result 53262 states and 66448 transitions. [2022-01-11 01:49:37,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:37,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2022-01-11 01:49:37,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:37,451 INFO L225 Difference]: With dead ends: 53262 [2022-01-11 01:49:37,451 INFO L226 Difference]: Without dead ends: 34810 [2022-01-11 01:49:37,471 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:37,472 INFO L933 BasicCegarLoop]: 1544 mSDtfsCounter, 786 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 2583 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:37,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [786 Valid, 2583 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:37,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34810 states. [2022-01-11 01:49:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34810 to 34806. [2022-01-11 01:49:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34806 states, 34804 states have (on average 1.24365015515458) internal successors, (43284), 34805 states have internal predecessors, (43284), 0 states have call successors, (0), 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:40,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34806 states to 34806 states and 43284 transitions. [2022-01-11 01:49:40,672 INFO L78 Accepts]: Start accepts. Automaton has 34806 states and 43284 transitions. Word has length 179 [2022-01-11 01:49:40,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:40,672 INFO L470 AbstractCegarLoop]: Abstraction has 34806 states and 43284 transitions. [2022-01-11 01:49:40,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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:40,673 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states and 43284 transitions. [2022-01-11 01:49:40,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-01-11 01:49:40,684 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:40,684 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] [2022-01-11 01:49:40,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-11 01:49:40,684 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:40,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:40,684 INFO L85 PathProgramCache]: Analyzing trace with hash -320338229, now seen corresponding path program 1 times [2022-01-11 01:49:40,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:40,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603449580] [2022-01-11 01:49:40,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:40,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:40,708 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:40,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:40,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603449580] [2022-01-11 01:49:40,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603449580] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:40,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:40,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:40,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037829402] [2022-01-11 01:49:40,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:40,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:40,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:40,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:40,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:40,710 INFO L87 Difference]: Start difference. First operand 34806 states and 43284 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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:43,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:43,823 INFO L93 Difference]: Finished difference Result 69418 states and 86342 transitions. [2022-01-11 01:49:43,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:43,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 179 [2022-01-11 01:49:43,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:43,870 INFO L225 Difference]: With dead ends: 69418 [2022-01-11 01:49:43,870 INFO L226 Difference]: Without dead ends: 34713 [2022-01-11 01:49:43,896 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:43,896 INFO L933 BasicCegarLoop]: 1059 mSDtfsCounter, 1053 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 1060 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:43,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1053 Valid, 1060 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:43,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34713 states. [2022-01-11 01:49:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34713 to 34713. [2022-01-11 01:49:46,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34713 states, 34711 states have (on average 1.243842009737547) internal successors, (43175), 34712 states have internal predecessors, (43175), 0 states have call successors, (0), 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:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34713 states to 34713 states and 43175 transitions. [2022-01-11 01:49:46,917 INFO L78 Accepts]: Start accepts. Automaton has 34713 states and 43175 transitions. Word has length 179 [2022-01-11 01:49:46,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:46,917 INFO L470 AbstractCegarLoop]: Abstraction has 34713 states and 43175 transitions. [2022-01-11 01:49:46,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 34713 states and 43175 transitions. [2022-01-11 01:49:47,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-01-11 01:49:47,049 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:47,049 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] [2022-01-11 01:49:47,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-11 01:49:47,049 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:47,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:47,050 INFO L85 PathProgramCache]: Analyzing trace with hash 812130316, now seen corresponding path program 1 times [2022-01-11 01:49:47,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:47,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665171902] [2022-01-11 01:49:47,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:47,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:47,147 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:47,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:47,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665171902] [2022-01-11 01:49:47,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665171902] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:47,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:47,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:47,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704096490] [2022-01-11 01:49:47,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:47,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:47,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:47,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:47,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:47,148 INFO L87 Difference]: Start difference. First operand 34713 states and 43175 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:53,014 INFO L93 Difference]: Finished difference Result 101757 states and 126389 transitions. [2022-01-11 01:49:53,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:53,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2022-01-11 01:49:53,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:53,108 INFO L225 Difference]: With dead ends: 101757 [2022-01-11 01:49:53,108 INFO L226 Difference]: Without dead ends: 67145 [2022-01-11 01:49:53,135 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,137 INFO L933 BasicCegarLoop]: 1517 mSDtfsCounter, 791 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 2554 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:53,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [791 Valid, 2554 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:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67145 states. [2022-01-11 01:49:58,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67145 to 67141. [2022-01-11 01:49:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67141 states, 67139 states have (on average 1.2394733314467001) internal successors, (83217), 67140 states have internal predecessors, (83217), 0 states have call successors, (0), 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:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67141 states to 67141 states and 83217 transitions. [2022-01-11 01:49:58,986 INFO L78 Accepts]: Start accepts. Automaton has 67141 states and 83217 transitions. Word has length 180 [2022-01-11 01:49:58,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:58,986 INFO L470 AbstractCegarLoop]: Abstraction has 67141 states and 83217 transitions. [2022-01-11 01:49:58,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 67141 states and 83217 transitions. [2022-01-11 01:49:59,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-01-11 01:49:59,012 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:59,012 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] [2022-01-11 01:49:59,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-11 01:49:59,012 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:59,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:59,012 INFO L85 PathProgramCache]: Analyzing trace with hash 127900011, now seen corresponding path program 1 times [2022-01-11 01:49:59,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:59,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555246115] [2022-01-11 01:49:59,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:59,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:59,037 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:59,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:59,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555246115] [2022-01-11 01:49:59,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555246115] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:59,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:59,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:59,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715064818] [2022-01-11 01:49:59,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:59,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:59,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:59,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:59,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:59,039 INFO L87 Difference]: Start difference. First operand 67141 states and 83217 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:04,133 INFO L93 Difference]: Finished difference Result 117957 states and 146251 transitions. [2022-01-11 01:50:04,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:04,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 180 [2022-01-11 01:50:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:04,225 INFO L225 Difference]: With dead ends: 117957 [2022-01-11 01:50:04,226 INFO L226 Difference]: Without dead ends: 50917 [2022-01-11 01:50:04,273 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,274 INFO L933 BasicCegarLoop]: 1058 mSDtfsCounter, 1051 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 1059 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:50:04,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1051 Valid, 1059 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:04,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50917 states. [2022-01-11 01:50:08,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50917 to 50917. [2022-01-11 01:50:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50917 states, 50915 states have (on average 1.2403024648924679) internal successors, (63150), 50916 states have internal predecessors, (63150), 0 states have call successors, (0), 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:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50917 states to 50917 states and 63150 transitions. [2022-01-11 01:50:08,867 INFO L78 Accepts]: Start accepts. Automaton has 50917 states and 63150 transitions. Word has length 180 [2022-01-11 01:50:08,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:08,867 INFO L470 AbstractCegarLoop]: Abstraction has 50917 states and 63150 transitions. [2022-01-11 01:50:08,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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:08,868 INFO L276 IsEmpty]: Start isEmpty. Operand 50917 states and 63150 transitions. [2022-01-11 01:50:08,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-01-11 01:50:08,880 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:08,881 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] [2022-01-11 01:50:08,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-11 01:50:08,881 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:50:08,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:08,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1512498013, now seen corresponding path program 1 times [2022-01-11 01:50:08,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:08,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745681911] [2022-01-11 01:50:08,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:08,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:08,918 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:50:08,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:08,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745681911] [2022-01-11 01:50:08,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745681911] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:08,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:08,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:08,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243017611] [2022-01-11 01:50:08,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:08,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:08,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:08,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:08,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:08,919 INFO L87 Difference]: Start difference. First operand 50917 states and 63150 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)