/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/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 00:35:35,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 00:35:35,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 00:35:35,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 00:35:35,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 00:35:35,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 00:35:35,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 00:35:35,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 00:35:35,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 00:35:35,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 00:35:35,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 00:35:35,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 00:35:35,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 00:35:35,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 00:35:35,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 00:35:35,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 00:35:35,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 00:35:35,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 00:35:35,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 00:35:35,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 00:35:35,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 00:35:35,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 00:35:35,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 00:35:35,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 00:35:35,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 00:35:35,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 00:35:35,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 00:35:35,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 00:35:35,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 00:35:35,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 00:35:35,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 00:35:35,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 00:35:35,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 00:35:35,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 00:35:35,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 00:35:35,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 00:35:35,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 00:35:35,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 00:35:35,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 00:35:35,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 00:35:35,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 00:35:35,682 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 00:35:35,699 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 00:35:35,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 00:35:35,700 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 00:35:35,700 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 00:35:35,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 00:35:35,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 00:35:35,701 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 00:35:35,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 00:35:35,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 00:35:35,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 00:35:35,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 00:35:35,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 00:35:35,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 00:35:35,702 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 00:35:35,703 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 00:35:35,703 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 00:35:35,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 00:35:35,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 00:35:35,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 00:35:35,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 00:35:35,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 00:35:35,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:35:35,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 00:35:35,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 00:35:35,705 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 00:35:35,705 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 00:35:35,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 00:35:35,705 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 00:35:35,705 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 00:35:35,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 00:35:35,706 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 00:35:35,706 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 00:35:35,706 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 00:35:35,706 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 00:35:35,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 00:35:35,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 00:35:35,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 00:35:35,957 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 00:35:35,959 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 00:35:35,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-01-11 00:35:36,026 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11a3271b9/59ec43ec5aea4c1ab165b118c6483463/FLAGb87cca262 [2022-01-11 00:35:36,455 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 00:35:36,456 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-01-11 00:35:36,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11a3271b9/59ec43ec5aea4c1ab165b118c6483463/FLAGb87cca262 [2022-01-11 00:35:36,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11a3271b9/59ec43ec5aea4c1ab165b118c6483463 [2022-01-11 00:35:36,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 00:35:36,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 00:35:36,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 00:35:36,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 00:35:36,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 00:35:36,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:35:36" (1/1) ... [2022-01-11 00:35:36,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ceaa7f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:35:36, skipping insertion in model container [2022-01-11 00:35:36,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:35:36" (1/1) ... [2022-01-11 00:35:36,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 00:35:36,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:35:37,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7067,7080] [2022-01-11 00:35:37,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:35:37,171 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 00:35:37,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7067,7080] [2022-01-11 00:35:37,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:35:37,268 INFO L208 MainTranslator]: Completed translation [2022-01-11 00:35:37,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:35:37 WrapperNode [2022-01-11 00:35:37,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 00:35:37,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 00:35:37,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 00:35:37,270 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 00:35:37,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:35:37" (1/1) ... [2022-01-11 00:35:37,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:35:37" (1/1) ... [2022-01-11 00:35:37,323 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 552 [2022-01-11 00:35:37,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 00:35:37,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 00:35:37,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 00:35:37,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 00:35:37,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:35:37" (1/1) ... [2022-01-11 00:35:37,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:35:37" (1/1) ... [2022-01-11 00:35:37,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:35:37" (1/1) ... [2022-01-11 00:35:37,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:35:37" (1/1) ... [2022-01-11 00:35:37,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:35:37" (1/1) ... [2022-01-11 00:35:37,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:35:37" (1/1) ... [2022-01-11 00:35:37,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:35:37" (1/1) ... [2022-01-11 00:35:37,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 00:35:37,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 00:35:37,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 00:35:37,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 00:35:37,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:35:37" (1/1) ... [2022-01-11 00:35:37,390 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:35:37,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:35:37,414 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 00:35:37,427 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 00:35:37,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 00:35:37,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 00:35:37,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 00:35:37,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 00:35:37,607 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 00:35:37,609 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 00:35:38,077 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 00:35:38,091 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 00:35:38,091 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-11 00:35:38,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:35:38 BoogieIcfgContainer [2022-01-11 00:35:38,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 00:35:38,094 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 00:35:38,095 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 00:35:38,099 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 00:35:38,102 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:35:38" (1/1) ... [2022-01-11 00:35:38,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:35:38 BasicIcfg [2022-01-11 00:35:38,509 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 00:35:38,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 00:35:38,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 00:35:38,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 00:35:38,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 12:35:36" (1/4) ... [2022-01-11 00:35:38,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f18724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:35:38, skipping insertion in model container [2022-01-11 00:35:38,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:35:37" (2/4) ... [2022-01-11 00:35:38,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f18724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:35:38, skipping insertion in model container [2022-01-11 00:35:38,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:35:38" (3/4) ... [2022-01-11 00:35:38,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f18724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:35:38, skipping insertion in model container [2022-01-11 00:35:38,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:35:38" (4/4) ... [2022-01-11 00:35:38,520 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.cTransformedIcfg [2022-01-11 00:35:38,525 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 00:35:38,525 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 00:35:38,581 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 00:35:38,589 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 00:35:38,589 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 00:35:38,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.763779527559055) internal successors, (224), 128 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:38,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 00:35:38,618 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:35:38,618 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 00:35:38,619 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:35:38,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:35:38,625 INFO L85 PathProgramCache]: Analyzing trace with hash -376380172, now seen corresponding path program 1 times [2022-01-11 00:35:38,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:35:38,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577838134] [2022-01-11 00:35:38,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:35:38,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:35:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:35:39,303 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 00:35:39,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:35:39,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577838134] [2022-01-11 00:35:39,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577838134] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:35:39,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:35:39,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:35:39,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631822151] [2022-01-11 00:35:39,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:35:39,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:35:39,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:35:39,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:35:39,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:35:39,344 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.763779527559055) internal successors, (224), 128 states have internal predecessors, (224), 0 states have call successors, (0), 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 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 00:35:41,407 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 00:35:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:35:41,622 INFO L93 Difference]: Finished difference Result 282 states and 479 transitions. [2022-01-11 00:35:41,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:35:41,625 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 00:35:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:35:41,639 INFO L225 Difference]: With dead ends: 282 [2022-01-11 00:35:41,639 INFO L226 Difference]: Without dead ends: 195 [2022-01-11 00:35:41,642 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 00:35:41,644 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 125 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-11 00:35:41,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 484 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-11 00:35:41,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-01-11 00:35:41,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2022-01-11 00:35:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.5989583333333333) internal successors, (307), 192 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 307 transitions. [2022-01-11 00:35:41,716 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 307 transitions. Word has length 51 [2022-01-11 00:35:41,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:35:41,717 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 307 transitions. [2022-01-11 00:35:41,717 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 00:35:41,717 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 307 transitions. [2022-01-11 00:35:41,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-11 00:35:41,723 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:35:41,723 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] [2022-01-11 00:35:41,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 00:35:41,724 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:35:41,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:35:41,725 INFO L85 PathProgramCache]: Analyzing trace with hash 830705965, now seen corresponding path program 1 times [2022-01-11 00:35:41,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:35:41,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775759478] [2022-01-11 00:35:41,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:35:41,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:35:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:35:41,901 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 00:35:41,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:35:41,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775759478] [2022-01-11 00:35:41,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775759478] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:35:41,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:35:41,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:35:41,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197527199] [2022-01-11 00:35:41,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:35:41,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:35:41,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:35:41,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:35:41,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:35:41,912 INFO L87 Difference]: Start difference. First operand 193 states and 307 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:43,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 00:35:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:35:44,108 INFO L93 Difference]: Finished difference Result 332 states and 542 transitions. [2022-01-11 00:35:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:35:44,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 00:35:44,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:35:44,112 INFO L225 Difference]: With dead ends: 332 [2022-01-11 00:35:44,112 INFO L226 Difference]: Without dead ends: 254 [2022-01-11 00:35:44,113 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 00:35:44,114 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 116 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-11 00:35:44,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 456 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-11 00:35:44,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-01-11 00:35:44,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2022-01-11 00:35:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.6215139442231075) internal successors, (407), 251 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 407 transitions. [2022-01-11 00:35:44,154 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 407 transitions. Word has length 53 [2022-01-11 00:35:44,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:35:44,155 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 407 transitions. [2022-01-11 00:35:44,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 407 transitions. [2022-01-11 00:35:44,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-11 00:35:44,162 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:35:44,162 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] [2022-01-11 00:35:44,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 00:35:44,167 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:35:44,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:35:44,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2035081028, now seen corresponding path program 1 times [2022-01-11 00:35:44,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:35:44,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226097097] [2022-01-11 00:35:44,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:35:44,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:35:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:35:44,332 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 00:35:44,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:35:44,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226097097] [2022-01-11 00:35:44,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226097097] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:35:44,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:35:44,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:35:44,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431886610] [2022-01-11 00:35:44,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:35:44,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:35:44,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:35:44,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:35:44,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:35:44,339 INFO L87 Difference]: Start difference. First operand 252 states and 407 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:35:44,472 INFO L93 Difference]: Finished difference Result 714 states and 1150 transitions. [2022-01-11 00:35:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:35:44,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 00:35:44,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:35:44,476 INFO L225 Difference]: With dead ends: 714 [2022-01-11 00:35:44,476 INFO L226 Difference]: Without dead ends: 487 [2022-01-11 00:35:44,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:35:44,481 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 405 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:35:44,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 481 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:35:44,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-01-11 00:35:44,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 485. [2022-01-11 00:35:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.609504132231405) internal successors, (779), 484 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 779 transitions. [2022-01-11 00:35:44,546 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 779 transitions. Word has length 53 [2022-01-11 00:35:44,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:35:44,547 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 779 transitions. [2022-01-11 00:35:44,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 779 transitions. [2022-01-11 00:35:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-11 00:35:44,548 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:35:44,548 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] [2022-01-11 00:35:44,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 00:35:44,549 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:35:44,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:35:44,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1018900720, now seen corresponding path program 1 times [2022-01-11 00:35:44,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:35:44,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479237503] [2022-01-11 00:35:44,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:35:44,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:35:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:35:44,653 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 00:35:44,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:35:44,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479237503] [2022-01-11 00:35:44,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479237503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:35:44,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:35:44,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:35:44,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821229272] [2022-01-11 00:35:44,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:35:44,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:35:44,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:35:44,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:35:44,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:35:44,658 INFO L87 Difference]: Start difference. First operand 485 states and 779 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:35:44,744 INFO L93 Difference]: Finished difference Result 1417 states and 2273 transitions. [2022-01-11 00:35:44,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:35:44,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-01-11 00:35:44,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:35:44,748 INFO L225 Difference]: With dead ends: 1417 [2022-01-11 00:35:44,748 INFO L226 Difference]: Without dead ends: 960 [2022-01-11 00:35:44,749 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 00:35:44,756 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 187 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:35:44,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 571 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:35:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2022-01-11 00:35:44,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 487. [2022-01-11 00:35:44,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 1.6069958847736625) internal successors, (781), 486 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 781 transitions. [2022-01-11 00:35:44,811 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 781 transitions. Word has length 54 [2022-01-11 00:35:44,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:35:44,812 INFO L470 AbstractCegarLoop]: Abstraction has 487 states and 781 transitions. [2022-01-11 00:35:44,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 781 transitions. [2022-01-11 00:35:44,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 00:35:44,814 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:35:44,815 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] [2022-01-11 00:35:44,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 00:35:44,815 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:35:44,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:35:44,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2015817791, now seen corresponding path program 1 times [2022-01-11 00:35:44,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:35:44,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991905054] [2022-01-11 00:35:44,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:35:44,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:35:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:35:44,998 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 00:35:44,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:35:44,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991905054] [2022-01-11 00:35:44,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991905054] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:35:44,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:35:44,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:35:44,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239387338] [2022-01-11 00:35:44,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:35:45,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:35:45,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:35:45,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:35:45,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:35:45,001 INFO L87 Difference]: Start difference. First operand 487 states and 781 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:35:45,271 INFO L93 Difference]: Finished difference Result 1870 states and 2998 transitions. [2022-01-11 00:35:45,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:35:45,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-01-11 00:35:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:35:45,278 INFO L225 Difference]: With dead ends: 1870 [2022-01-11 00:35:45,278 INFO L226 Difference]: Without dead ends: 1395 [2022-01-11 00:35:45,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 00:35:45,279 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 510 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:35:45,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [510 Valid, 826 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:35:45,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2022-01-11 00:35:45,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 936. [2022-01-11 00:35:45,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 935 states have (on average 1.5935828877005347) internal successors, (1490), 935 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:45,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1490 transitions. [2022-01-11 00:35:45,388 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1490 transitions. Word has length 55 [2022-01-11 00:35:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:35:45,391 INFO L470 AbstractCegarLoop]: Abstraction has 936 states and 1490 transitions. [2022-01-11 00:35:45,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1490 transitions. [2022-01-11 00:35:45,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 00:35:45,394 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:35:45,394 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] [2022-01-11 00:35:45,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 00:35:45,394 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:35:45,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:35:45,395 INFO L85 PathProgramCache]: Analyzing trace with hash 668617181, now seen corresponding path program 1 times [2022-01-11 00:35:45,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:35:45,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630578923] [2022-01-11 00:35:45,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:35:45,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:35:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:35:45,577 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 00:35:45,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:35:45,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630578923] [2022-01-11 00:35:45,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630578923] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:35:45,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:35:45,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:35:45,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777008986] [2022-01-11 00:35:45,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:35:45,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:35:45,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:35:45,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:35:45,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:35:45,579 INFO L87 Difference]: Start difference. First operand 936 states and 1490 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:47,616 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 00:35:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:35:48,060 INFO L93 Difference]: Finished difference Result 2374 states and 3874 transitions. [2022-01-11 00:35:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:35:48,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-01-11 00:35:48,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:35:48,069 INFO L225 Difference]: With dead ends: 2374 [2022-01-11 00:35:48,069 INFO L226 Difference]: Without dead ends: 1616 [2022-01-11 00:35:48,071 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 00:35:48,072 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 110 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-11 00:35:48,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 450 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-11 00:35:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2022-01-11 00:35:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1614. [2022-01-11 00:35:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1613 states have (on average 1.611903285802852) internal successors, (2600), 1613 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:48,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2600 transitions. [2022-01-11 00:35:48,286 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2600 transitions. Word has length 55 [2022-01-11 00:35:48,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:35:48,286 INFO L470 AbstractCegarLoop]: Abstraction has 1614 states and 2600 transitions. [2022-01-11 00:35:48,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2600 transitions. [2022-01-11 00:35:48,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-11 00:35:48,288 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:35:48,288 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] [2022-01-11 00:35:48,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 00:35:48,288 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:35:48,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:35:48,289 INFO L85 PathProgramCache]: Analyzing trace with hash 512176196, now seen corresponding path program 1 times [2022-01-11 00:35:48,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:35:48,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387723872] [2022-01-11 00:35:48,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:35:48,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:35:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:35:48,410 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 00:35:48,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:35:48,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387723872] [2022-01-11 00:35:48,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387723872] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:35:48,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:35:48,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:35:48,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819916707] [2022-01-11 00:35:48,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:35:48,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:35:48,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:35:48,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:35:48,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:35:48,412 INFO L87 Difference]: Start difference. First operand 1614 states and 2600 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:50,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 00:35:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:35:50,834 INFO L93 Difference]: Finished difference Result 2944 states and 4808 transitions. [2022-01-11 00:35:50,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:35:50,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-01-11 00:35:50,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:35:50,845 INFO L225 Difference]: With dead ends: 2944 [2022-01-11 00:35:50,845 INFO L226 Difference]: Without dead ends: 2186 [2022-01-11 00:35:50,847 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 00:35:50,848 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 111 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-11 00:35:50,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 437 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-11 00:35:50,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2022-01-11 00:35:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 2184. [2022-01-11 00:35:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 2183 states have (on average 1.6170407695831424) internal successors, (3530), 2183 states have internal predecessors, (3530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 3530 transitions. [2022-01-11 00:35:51,130 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 3530 transitions. Word has length 57 [2022-01-11 00:35:51,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:35:51,131 INFO L470 AbstractCegarLoop]: Abstraction has 2184 states and 3530 transitions. [2022-01-11 00:35:51,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 3530 transitions. [2022-01-11 00:35:51,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-11 00:35:51,132 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:35:51,133 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] [2022-01-11 00:35:51,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 00:35:51,133 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:35:51,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:35:51,133 INFO L85 PathProgramCache]: Analyzing trace with hash -202574828, now seen corresponding path program 1 times [2022-01-11 00:35:51,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:35:51,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564527794] [2022-01-11 00:35:51,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:35:51,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:35:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:35:51,264 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 00:35:51,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:35:51,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564527794] [2022-01-11 00:35:51,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564527794] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:35:51,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:35:51,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:35:51,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145126] [2022-01-11 00:35:51,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:35:51,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:35:51,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:35:51,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:35:51,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:35:51,267 INFO L87 Difference]: Start difference. First operand 2184 states and 3530 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:51,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:35:51,871 INFO L93 Difference]: Finished difference Result 6348 states and 10264 transitions. [2022-01-11 00:35:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:35:51,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-01-11 00:35:51,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:35:51,888 INFO L225 Difference]: With dead ends: 6348 [2022-01-11 00:35:51,888 INFO L226 Difference]: Without dead ends: 4226 [2022-01-11 00:35:51,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:35:51,892 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 389 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:35:51,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 462 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:35:51,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4226 states. [2022-01-11 00:35:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4226 to 4224. [2022-01-11 00:35:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4224 states, 4223 states have (on average 1.6092825005919962) internal successors, (6796), 4223 states have internal predecessors, (6796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:52,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4224 states to 4224 states and 6796 transitions. [2022-01-11 00:35:52,392 INFO L78 Accepts]: Start accepts. Automaton has 4224 states and 6796 transitions. Word has length 57 [2022-01-11 00:35:52,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:35:52,393 INFO L470 AbstractCegarLoop]: Abstraction has 4224 states and 6796 transitions. [2022-01-11 00:35:52,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:52,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4224 states and 6796 transitions. [2022-01-11 00:35:52,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-11 00:35:52,395 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:35:52,395 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] [2022-01-11 00:35:52,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 00:35:52,395 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:35:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:35:52,396 INFO L85 PathProgramCache]: Analyzing trace with hash 301713608, now seen corresponding path program 1 times [2022-01-11 00:35:52,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:35:52,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136006796] [2022-01-11 00:35:52,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:35:52,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:35:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:35:52,448 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 00:35:52,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:35:52,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136006796] [2022-01-11 00:35:52,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136006796] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:35:52,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:35:52,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:35:52,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356005672] [2022-01-11 00:35:52,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:35:52,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:35:52,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:35:52,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:35:52,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:35:52,450 INFO L87 Difference]: Start difference. First operand 4224 states and 6796 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:53,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:35:53,313 INFO L93 Difference]: Finished difference Result 12548 states and 20186 transitions. [2022-01-11 00:35:53,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:35:53,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-01-11 00:35:53,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:35:53,345 INFO L225 Difference]: With dead ends: 12548 [2022-01-11 00:35:53,346 INFO L226 Difference]: Without dead ends: 8398 [2022-01-11 00:35:53,353 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 00:35:53,354 INFO L933 BasicCegarLoop]: 368 mSDtfsCounter, 173 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:35:53,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 557 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:35:53,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8398 states. [2022-01-11 00:35:53,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8398 to 4232. [2022-01-11 00:35:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4232 states, 4231 states have (on average 1.6081304656109667) internal successors, (6804), 4231 states have internal predecessors, (6804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4232 states to 4232 states and 6804 transitions. [2022-01-11 00:35:53,958 INFO L78 Accepts]: Start accepts. Automaton has 4232 states and 6804 transitions. Word has length 58 [2022-01-11 00:35:53,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:35:53,958 INFO L470 AbstractCegarLoop]: Abstraction has 4232 states and 6804 transitions. [2022-01-11 00:35:53,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 4232 states and 6804 transitions. [2022-01-11 00:35:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-11 00:35:53,960 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:35:53,960 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] [2022-01-11 00:35:53,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 00:35:53,961 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:35:53,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:35:53,961 INFO L85 PathProgramCache]: Analyzing trace with hash -787411879, now seen corresponding path program 1 times [2022-01-11 00:35:53,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:35:53,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502101009] [2022-01-11 00:35:53,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:35:53,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:35:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:35:54,093 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 00:35:54,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:35:54,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502101009] [2022-01-11 00:35:54,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502101009] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:35:54,097 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:35:54,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:35:54,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126671367] [2022-01-11 00:35:54,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:35:54,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:35:54,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:35:54,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:35:54,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:35:54,099 INFO L87 Difference]: Start difference. First operand 4232 states and 6804 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:35:55,358 INFO L93 Difference]: Finished difference Result 16284 states and 26266 transitions. [2022-01-11 00:35:55,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:35:55,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-01-11 00:35:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:35:55,397 INFO L225 Difference]: With dead ends: 16284 [2022-01-11 00:35:55,397 INFO L226 Difference]: Without dead ends: 12110 [2022-01-11 00:35:55,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 00:35:55,409 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 619 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:35:55,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [619 Valid, 641 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:35:55,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12110 states. [2022-01-11 00:35:56,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12110 to 8142. [2022-01-11 00:35:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8142 states, 8141 states have (on average 1.592433361994841) internal successors, (12964), 8141 states have internal predecessors, (12964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8142 states to 8142 states and 12964 transitions. [2022-01-11 00:35:56,462 INFO L78 Accepts]: Start accepts. Automaton has 8142 states and 12964 transitions. Word has length 59 [2022-01-11 00:35:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:35:56,462 INFO L470 AbstractCegarLoop]: Abstraction has 8142 states and 12964 transitions. [2022-01-11 00:35:56,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 8142 states and 12964 transitions. [2022-01-11 00:35:56,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-11 00:35:56,465 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:35:56,465 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:35:56,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 00:35:56,465 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:35:56,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:35:56,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1829903733, now seen corresponding path program 1 times [2022-01-11 00:35:56,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:35:56,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436254109] [2022-01-11 00:35:56,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:35:56,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:35:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:35:56,600 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 00:35:56,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:35:56,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436254109] [2022-01-11 00:35:56,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436254109] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:35:56,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:35:56,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:35:56,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023787789] [2022-01-11 00:35:56,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:35:56,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:35:56,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:35:56,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:35:56,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:35:56,602 INFO L87 Difference]: Start difference. First operand 8142 states and 12964 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:35:58,705 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 00:36:01,156 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 00:36:02,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:02,755 INFO L93 Difference]: Finished difference Result 22066 states and 35622 transitions. [2022-01-11 00:36:02,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:36:02,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-01-11 00:36:02,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:02,786 INFO L225 Difference]: With dead ends: 22066 [2022-01-11 00:36:02,786 INFO L226 Difference]: Without dead ends: 14672 [2022-01-11 00:36:02,798 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 00:36:02,798 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 105 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-01-11 00:36:02,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 432 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-01-11 00:36:02,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14672 states. [2022-01-11 00:36:04,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14672 to 14670. [2022-01-11 00:36:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14670 states, 14669 states have (on average 1.5971095507532893) internal successors, (23428), 14669 states have internal predecessors, (23428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14670 states to 14670 states and 23428 transitions. [2022-01-11 00:36:04,580 INFO L78 Accepts]: Start accepts. Automaton has 14670 states and 23428 transitions. Word has length 59 [2022-01-11 00:36:04,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:04,580 INFO L470 AbstractCegarLoop]: Abstraction has 14670 states and 23428 transitions. [2022-01-11 00:36:04,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:04,581 INFO L276 IsEmpty]: Start isEmpty. Operand 14670 states and 23428 transitions. [2022-01-11 00:36:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-11 00:36:04,583 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:04,583 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] [2022-01-11 00:36:04,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 00:36:04,584 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:04,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash 119888783, now seen corresponding path program 1 times [2022-01-11 00:36:04,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:04,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580829727] [2022-01-11 00:36:04,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:04,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:04,652 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 00:36:04,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:04,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580829727] [2022-01-11 00:36:04,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580829727] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:04,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:04,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:36:04,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145151114] [2022-01-11 00:36:04,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:04,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:36:04,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:04,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:36:04,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:04,654 INFO L87 Difference]: Start difference. First operand 14670 states and 23428 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:07,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 00:36:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:09,056 INFO L93 Difference]: Finished difference Result 27010 states and 43558 transitions. [2022-01-11 00:36:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:36:09,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-01-11 00:36:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:09,102 INFO L225 Difference]: With dead ends: 27010 [2022-01-11 00:36:09,102 INFO L226 Difference]: Without dead ends: 19616 [2022-01-11 00:36:09,116 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 00:36:09,117 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 106 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-11 00:36:09,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 418 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-11 00:36:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19616 states. [2022-01-11 00:36:11,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19616 to 19614. [2022-01-11 00:36:11,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19614 states, 19613 states have (on average 1.5983276398307245) internal successors, (31348), 19613 states have internal predecessors, (31348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19614 states to 19614 states and 31348 transitions. [2022-01-11 00:36:11,462 INFO L78 Accepts]: Start accepts. Automaton has 19614 states and 31348 transitions. Word has length 61 [2022-01-11 00:36:11,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:11,463 INFO L470 AbstractCegarLoop]: Abstraction has 19614 states and 31348 transitions. [2022-01-11 00:36:11,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 19614 states and 31348 transitions. [2022-01-11 00:36:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-11 00:36:11,465 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:11,465 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:36:11,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 00:36:11,466 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:11,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:11,466 INFO L85 PathProgramCache]: Analyzing trace with hash 484409950, now seen corresponding path program 1 times [2022-01-11 00:36:11,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:11,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600919506] [2022-01-11 00:36:11,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:11,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:11,561 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 00:36:11,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:11,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600919506] [2022-01-11 00:36:11,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600919506] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:11,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:11,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:36:11,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60435432] [2022-01-11 00:36:11,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:11,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:36:11,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:11,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:36:11,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:36:11,563 INFO L87 Difference]: Start difference. First operand 19614 states and 31348 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:16,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:16,300 INFO L93 Difference]: Finished difference Result 57242 states and 91550 transitions. [2022-01-11 00:36:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:36:16,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-01-11 00:36:16,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:16,386 INFO L225 Difference]: With dead ends: 57242 [2022-01-11 00:36:16,386 INFO L226 Difference]: Without dead ends: 37792 [2022-01-11 00:36:16,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:36:16,424 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 376 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:36:16,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 446 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:16,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37792 states. [2022-01-11 00:36:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37792 to 37790. [2022-01-11 00:36:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37790 states, 37789 states have (on average 1.5878694858292095) internal successors, (60004), 37789 states have internal predecessors, (60004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37790 states to 37790 states and 60004 transitions. [2022-01-11 00:36:21,502 INFO L78 Accepts]: Start accepts. Automaton has 37790 states and 60004 transitions. Word has length 61 [2022-01-11 00:36:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:21,502 INFO L470 AbstractCegarLoop]: Abstraction has 37790 states and 60004 transitions. [2022-01-11 00:36:21,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 37790 states and 60004 transitions. [2022-01-11 00:36:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-11 00:36:21,507 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:21,507 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] [2022-01-11 00:36:21,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 00:36:21,507 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:21,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:21,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1076763278, now seen corresponding path program 1 times [2022-01-11 00:36:21,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:21,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245196574] [2022-01-11 00:36:21,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:21,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:21,563 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 00:36:21,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:21,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245196574] [2022-01-11 00:36:21,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245196574] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:21,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:21,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:36:21,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981713627] [2022-01-11 00:36:21,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:21,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:36:21,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:21,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:36:21,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:21,564 INFO L87 Difference]: Start difference. First operand 37790 states and 60004 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:31,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:31,274 INFO L93 Difference]: Finished difference Result 112178 states and 178470 transitions. [2022-01-11 00:36:31,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:36:31,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-01-11 00:36:31,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:31,452 INFO L225 Difference]: With dead ends: 112178 [2022-01-11 00:36:31,452 INFO L226 Difference]: Without dead ends: 75344 [2022-01-11 00:36:31,510 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 00:36:31,511 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 159 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:36:31,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 543 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75344 states. [2022-01-11 00:36:36,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75344 to 37822. [2022-01-11 00:36:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37822 states, 37821 states have (on average 1.5873720948679304) internal successors, (60036), 37821 states have internal predecessors, (60036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:36,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37822 states to 37822 states and 60036 transitions. [2022-01-11 00:36:36,849 INFO L78 Accepts]: Start accepts. Automaton has 37822 states and 60036 transitions. Word has length 62 [2022-01-11 00:36:36,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:36,849 INFO L470 AbstractCegarLoop]: Abstraction has 37822 states and 60036 transitions. [2022-01-11 00:36:36,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:36,849 INFO L276 IsEmpty]: Start isEmpty. Operand 37822 states and 60036 transitions. [2022-01-11 00:36:36,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-11 00:36:36,852 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:36,852 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] [2022-01-11 00:36:36,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 00:36:36,853 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:36,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:36,853 INFO L85 PathProgramCache]: Analyzing trace with hash -578864604, now seen corresponding path program 1 times [2022-01-11 00:36:36,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:36,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152720335] [2022-01-11 00:36:36,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:36,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:36,950 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 00:36:36,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:36,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152720335] [2022-01-11 00:36:36,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152720335] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:36,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:36,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:36:36,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600842713] [2022-01-11 00:36:36,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:36,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:36:36,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:36,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:36:36,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:36:36,952 INFO L87 Difference]: Start difference. First operand 37822 states and 60036 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)