./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d3f6bd0cc41c3fb11f5cfcc3010a6654288179c0475495df5b9f3093567937e2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:33:48,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:33:48,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:33:48,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:33:48,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:33:48,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:33:48,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:33:48,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:33:48,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:33:48,625 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:33:48,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:33:48,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:33:48,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:33:48,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:33:48,626 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:33:48,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:33:48,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:33:48,632 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:33:48,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:33:48,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:33:48,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:33:48,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:33:48,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:33:48,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:33:48,634 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:33:48,634 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:33:48,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:33:48,636 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:33:48,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:33:48,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:33:48,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:33:48,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:33:48,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:33:48,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:33:48,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:33:48,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:33:48,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:33:48,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:33:48,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:33:48,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:33:48,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:33:48,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:33:48,641 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d3f6bd0cc41c3fb11f5cfcc3010a6654288179c0475495df5b9f3093567937e2 [2024-11-09 01:33:48,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:33:48,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:33:48,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:33:48,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:33:48,912 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:33:48,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i [2024-11-09 01:33:50,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:33:50,636 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:33:50,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i [2024-11-09 01:33:50,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e26c737/d7a7c1d0efb642d78b288845f768bca9/FLAG2a892287e [2024-11-09 01:33:50,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e26c737/d7a7c1d0efb642d78b288845f768bca9 [2024-11-09 01:33:50,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:33:50,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:33:50,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:33:50,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:33:50,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:33:50,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:33:50" (1/1) ... [2024-11-09 01:33:50,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26acd8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:50, skipping insertion in model container [2024-11-09 01:33:50,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:33:50" (1/1) ... [2024-11-09 01:33:50,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:33:50,917 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i[916,929] [2024-11-09 01:33:51,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:33:51,035 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:33:51,044 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i[916,929] [2024-11-09 01:33:51,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:33:51,101 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:33:51,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:51 WrapperNode [2024-11-09 01:33:51,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:33:51,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:33:51,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:33:51,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:33:51,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:51" (1/1) ... [2024-11-09 01:33:51,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:51" (1/1) ... [2024-11-09 01:33:51,171 INFO L138 Inliner]: procedures = 26, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 434 [2024-11-09 01:33:51,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:33:51,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:33:51,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:33:51,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:33:51,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:51" (1/1) ... [2024-11-09 01:33:51,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:51" (1/1) ... [2024-11-09 01:33:51,197 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:51" (1/1) ... [2024-11-09 01:33:51,228 INFO L175 MemorySlicer]: Split 123 memory accesses to 6 slices as follows [2, 8, 8, 73, 7, 25]. 59 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 6, 1, 3]. The 16 writes are split as follows [0, 1, 3, 7, 1, 4]. [2024-11-09 01:33:51,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:51" (1/1) ... [2024-11-09 01:33:51,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:51" (1/1) ... [2024-11-09 01:33:51,250 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:51" (1/1) ... [2024-11-09 01:33:51,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:51" (1/1) ... [2024-11-09 01:33:51,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:51" (1/1) ... [2024-11-09 01:33:51,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:51" (1/1) ... [2024-11-09 01:33:51,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:33:51,284 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:33:51,284 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:33:51,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:33:51,285 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:51" (1/1) ... [2024-11-09 01:33:51,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:33:51,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:33:51,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:33:51,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:33:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:33:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:33:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:33:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:33:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:33:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:33:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:33:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:33:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:33:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:33:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:33:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:33:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:33:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:33:51,369 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:33:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:33:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:33:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:33:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:33:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:33:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:33:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:33:51,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:33:51,484 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:33:51,486 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:33:52,022 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-09 01:33:52,023 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:33:52,039 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:33:52,040 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:33:52,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:33:52 BoogieIcfgContainer [2024-11-09 01:33:52,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:33:52,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:33:52,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:33:52,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:33:52,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:33:50" (1/3) ... [2024-11-09 01:33:52,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ade71c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:33:52, skipping insertion in model container [2024-11-09 01:33:52,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:51" (2/3) ... [2024-11-09 01:33:52,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ade71c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:33:52, skipping insertion in model container [2024-11-09 01:33:52,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:33:52" (3/3) ... [2024-11-09 01:33:52,050 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-66.i [2024-11-09 01:33:52,068 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:33:52,068 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:33:52,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:33:52,135 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@67601fde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:33:52,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:33:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 70 states have internal predecessors, (97), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:33:52,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 01:33:52,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:52,158 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:52,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:52,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:52,166 INFO L85 PathProgramCache]: Analyzing trace with hash 566813761, now seen corresponding path program 1 times [2024-11-09 01:33:52,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:52,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90190704] [2024-11-09 01:33:52,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:52,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:52,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:52,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:52,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:52,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:52,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:52,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:52,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:52,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:52,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:52,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:52,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:52,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:52,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:52,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:33:52,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:52,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90190704] [2024-11-09 01:33:52,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90190704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:52,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:52,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:33:52,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781133066] [2024-11-09 01:33:52,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:52,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:33:52,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:52,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:33:52,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:33:52,614 INFO L87 Difference]: Start difference. First operand has 86 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 70 states have internal predecessors, (97), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:33:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:52,640 INFO L93 Difference]: Finished difference Result 165 states and 258 transitions. [2024-11-09 01:33:52,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:33:52,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2024-11-09 01:33:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:52,649 INFO L225 Difference]: With dead ends: 165 [2024-11-09 01:33:52,649 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 01:33:52,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:33:52,657 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:52,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:52,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 01:33:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-09 01:33:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:33:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2024-11-09 01:33:52,724 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 109 [2024-11-09 01:33:52,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:52,726 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2024-11-09 01:33:52,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:33:52,727 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2024-11-09 01:33:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 01:33:52,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:52,732 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:52,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:33:52,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:52,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash 584676645, now seen corresponding path program 1 times [2024-11-09 01:33:52,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:52,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881485139] [2024-11-09 01:33:52,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:52,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:52,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:52,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:33:53,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:53,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881485139] [2024-11-09 01:33:53,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881485139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:53,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:53,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:33:53,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438532953] [2024-11-09 01:33:53,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:53,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:33:53,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:53,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:33:53,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:33:53,059 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:33:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:53,102 INFO L93 Difference]: Finished difference Result 164 states and 237 transitions. [2024-11-09 01:33:53,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:33:53,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2024-11-09 01:33:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:53,105 INFO L225 Difference]: With dead ends: 164 [2024-11-09 01:33:53,105 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 01:33:53,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:33:53,107 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:53,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 334 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:53,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 01:33:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2024-11-09 01:33:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:33:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-11-09 01:33:53,125 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 109 [2024-11-09 01:33:53,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:53,126 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-11-09 01:33:53,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:33:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-11-09 01:33:53,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 01:33:53,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:53,132 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:53,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:33:53,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:53,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:53,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1935283289, now seen corresponding path program 1 times [2024-11-09 01:33:53,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:53,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015483959] [2024-11-09 01:33:53,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:53,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:33:53,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:53,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015483959] [2024-11-09 01:33:53,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015483959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:53,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:53,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:33:53,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126112752] [2024-11-09 01:33:53,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:53,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:33:53,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:53,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:33:53,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:33:53,427 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:33:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:53,468 INFO L93 Difference]: Finished difference Result 168 states and 241 transitions. [2024-11-09 01:33:53,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:33:53,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2024-11-09 01:33:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:53,474 INFO L225 Difference]: With dead ends: 168 [2024-11-09 01:33:53,474 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 01:33:53,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:33:53,478 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:53,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 01:33:53,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-11-09 01:33:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:33:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2024-11-09 01:33:53,494 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 109 [2024-11-09 01:33:53,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:53,495 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2024-11-09 01:33:53,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:33:53,496 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2024-11-09 01:33:53,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 01:33:53,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:53,498 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:53,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:33:53,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:53,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1933436247, now seen corresponding path program 1 times [2024-11-09 01:33:53,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:53,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944484812] [2024-11-09 01:33:53,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:53,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:54,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:54,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:54,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:54,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:54,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:54,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:54,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:54,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:54,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:54,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:54,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:54,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:54,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:54,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:33:54,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:54,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944484812] [2024-11-09 01:33:54,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944484812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:54,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:54,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:33:54,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722686888] [2024-11-09 01:33:54,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:54,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:33:54,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:54,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:33:54,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:33:54,261 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:33:54,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:54,530 INFO L93 Difference]: Finished difference Result 252 states and 360 transitions. [2024-11-09 01:33:54,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:33:54,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2024-11-09 01:33:54,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:54,533 INFO L225 Difference]: With dead ends: 252 [2024-11-09 01:33:54,533 INFO L226 Difference]: Without dead ends: 169 [2024-11-09 01:33:54,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:33:54,539 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 77 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:54,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 276 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:33:54,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-09 01:33:54,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2024-11-09 01:33:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 130 states have internal predecessors, (173), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 01:33:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 229 transitions. [2024-11-09 01:33:54,567 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 229 transitions. Word has length 109 [2024-11-09 01:33:54,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:54,567 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 229 transitions. [2024-11-09 01:33:54,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:33:54,568 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 229 transitions. [2024-11-09 01:33:54,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:33:54,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:54,569 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:54,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:33:54,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:54,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:54,570 INFO L85 PathProgramCache]: Analyzing trace with hash 716307048, now seen corresponding path program 1 times [2024-11-09 01:33:54,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:54,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058286510] [2024-11-09 01:33:54,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:54,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:57,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:57,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:57,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:57,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:57,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:57,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:57,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:57,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:57,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:57,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:57,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:57,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:57,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:57,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:33:57,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:57,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058286510] [2024-11-09 01:33:57,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058286510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:57,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:57,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:33:57,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223492734] [2024-11-09 01:33:57,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:57,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:33:57,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:57,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:33:57,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:33:57,272 INFO L87 Difference]: Start difference. First operand 161 states and 229 transitions. Second operand has 11 states, 8 states have (on average 5.375) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-09 01:33:59,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:59,619 INFO L93 Difference]: Finished difference Result 553 states and 785 transitions. [2024-11-09 01:33:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 01:33:59,621 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 5.375) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 110 [2024-11-09 01:33:59,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:59,625 INFO L225 Difference]: With dead ends: 553 [2024-11-09 01:33:59,625 INFO L226 Difference]: Without dead ends: 395 [2024-11-09 01:33:59,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2024-11-09 01:33:59,632 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 415 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:59,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 895 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 01:33:59,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-09 01:33:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 297. [2024-11-09 01:33:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 240 states have (on average 1.325) internal successors, (318), 242 states have internal predecessors, (318), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:33:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 422 transitions. [2024-11-09 01:33:59,705 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 422 transitions. Word has length 110 [2024-11-09 01:33:59,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:59,706 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 422 transitions. [2024-11-09 01:33:59,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 5.375) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-09 01:33:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 422 transitions. [2024-11-09 01:33:59,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:33:59,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:59,708 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:59,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:33:59,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:59,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:59,709 INFO L85 PathProgramCache]: Analyzing trace with hash 129501034, now seen corresponding path program 1 times [2024-11-09 01:33:59,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:59,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479805863] [2024-11-09 01:33:59,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:59,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:00,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:00,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:00,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:00,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:00,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:00,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:00,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:00,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:00,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:00,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:00,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:00,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:00,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:00,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:00,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:00,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479805863] [2024-11-09 01:34:00,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479805863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:00,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:00,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:34:00,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141838542] [2024-11-09 01:34:00,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:00,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:34:00,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:00,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:34:00,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:34:00,137 INFO L87 Difference]: Start difference. First operand 297 states and 422 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:00,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:00,581 INFO L93 Difference]: Finished difference Result 649 states and 905 transitions. [2024-11-09 01:34:00,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:34:00,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2024-11-09 01:34:00,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:00,588 INFO L225 Difference]: With dead ends: 649 [2024-11-09 01:34:00,589 INFO L226 Difference]: Without dead ends: 498 [2024-11-09 01:34:00,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:34:00,591 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 220 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:00,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 312 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:34:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-09 01:34:00,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 360. [2024-11-09 01:34:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 284 states have (on average 1.2992957746478873) internal successors, (369), 287 states have internal predecessors, (369), 66 states have call successors, (66), 9 states have call predecessors, (66), 9 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:00,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 501 transitions. [2024-11-09 01:34:00,666 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 501 transitions. Word has length 110 [2024-11-09 01:34:00,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:00,667 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 501 transitions. [2024-11-09 01:34:00,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 501 transitions. [2024-11-09 01:34:00,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:34:00,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:00,670 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:00,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:34:00,670 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:00,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:00,671 INFO L85 PathProgramCache]: Analyzing trace with hash -872040854, now seen corresponding path program 1 times [2024-11-09 01:34:00,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:00,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987313633] [2024-11-09 01:34:00,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:00,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:00,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:01,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:01,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987313633] [2024-11-09 01:34:01,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987313633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:01,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:01,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:34:01,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338929563] [2024-11-09 01:34:01,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:01,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:34:01,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:01,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:34:01,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:34:01,026 INFO L87 Difference]: Start difference. First operand 360 states and 501 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:01,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:01,383 INFO L93 Difference]: Finished difference Result 603 states and 834 transitions. [2024-11-09 01:34:01,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:34:01,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2024-11-09 01:34:01,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:01,387 INFO L225 Difference]: With dead ends: 603 [2024-11-09 01:34:01,387 INFO L226 Difference]: Without dead ends: 430 [2024-11-09 01:34:01,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:34:01,388 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 189 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:01,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 437 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:34:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-09 01:34:01,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 426. [2024-11-09 01:34:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 333 states have (on average 1.2822822822822824) internal successors, (427), 337 states have internal predecessors, (427), 80 states have call successors, (80), 12 states have call predecessors, (80), 12 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-09 01:34:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 587 transitions. [2024-11-09 01:34:01,476 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 587 transitions. Word has length 110 [2024-11-09 01:34:01,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:01,477 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 587 transitions. [2024-11-09 01:34:01,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:01,477 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 587 transitions. [2024-11-09 01:34:01,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 01:34:01,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:01,478 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:01,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:34:01,479 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:01,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:01,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2060584621, now seen corresponding path program 1 times [2024-11-09 01:34:01,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:01,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099793873] [2024-11-09 01:34:01,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:01,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:01,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:01,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099793873] [2024-11-09 01:34:01,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099793873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:01,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:01,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:34:01,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554995881] [2024-11-09 01:34:01,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:01,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:34:01,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:01,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:34:01,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:34:01,878 INFO L87 Difference]: Start difference. First operand 426 states and 587 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:02,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:02,109 INFO L93 Difference]: Finished difference Result 822 states and 1133 transitions. [2024-11-09 01:34:02,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:34:02,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-11-09 01:34:02,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:02,113 INFO L225 Difference]: With dead ends: 822 [2024-11-09 01:34:02,114 INFO L226 Difference]: Without dead ends: 432 [2024-11-09 01:34:02,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:34:02,115 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 73 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:02,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 269 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:34:02,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-09 01:34:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 424. [2024-11-09 01:34:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 331 states have (on average 1.2749244712990937) internal successors, (422), 335 states have internal predecessors, (422), 80 states have call successors, (80), 12 states have call predecessors, (80), 12 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-09 01:34:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 582 transitions. [2024-11-09 01:34:02,186 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 582 transitions. Word has length 111 [2024-11-09 01:34:02,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:02,187 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 582 transitions. [2024-11-09 01:34:02,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 582 transitions. [2024-11-09 01:34:02,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 01:34:02,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:02,188 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:02,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:34:02,189 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:02,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:02,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1132244947, now seen corresponding path program 1 times [2024-11-09 01:34:02,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:02,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754737888] [2024-11-09 01:34:02,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:02,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:02,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:02,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754737888] [2024-11-09 01:34:02,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754737888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:02,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:02,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:34:02,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874277019] [2024-11-09 01:34:02,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:02,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:34:02,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:02,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:34:02,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:34:02,627 INFO L87 Difference]: Start difference. First operand 424 states and 582 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:02,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:02,867 INFO L93 Difference]: Finished difference Result 754 states and 1033 transitions. [2024-11-09 01:34:02,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:34:02,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-11-09 01:34:02,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:02,871 INFO L225 Difference]: With dead ends: 754 [2024-11-09 01:34:02,871 INFO L226 Difference]: Without dead ends: 366 [2024-11-09 01:34:02,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:34:02,873 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 76 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:02,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 274 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:34:02,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-09 01:34:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 358. [2024-11-09 01:34:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 278 states have (on average 1.2661870503597121) internal successors, (352), 281 states have internal predecessors, (352), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-09 01:34:02,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 488 transitions. [2024-11-09 01:34:02,934 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 488 transitions. Word has length 111 [2024-11-09 01:34:02,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:02,935 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 488 transitions. [2024-11-09 01:34:02,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 488 transitions. [2024-11-09 01:34:02,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 01:34:02,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:02,936 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:02,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:34:02,937 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:02,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:02,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1141588530, now seen corresponding path program 1 times [2024-11-09 01:34:02,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:02,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119511781] [2024-11-09 01:34:02,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:02,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,021 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:03,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:03,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119511781] [2024-11-09 01:34:03,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119511781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:03,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:03,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:34:03,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773567109] [2024-11-09 01:34:03,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:03,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:34:03,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:03,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:34:03,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:34:03,024 INFO L87 Difference]: Start difference. First operand 358 states and 488 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:03,086 INFO L93 Difference]: Finished difference Result 684 states and 935 transitions. [2024-11-09 01:34:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:34:03,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-09 01:34:03,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:03,090 INFO L225 Difference]: With dead ends: 684 [2024-11-09 01:34:03,090 INFO L226 Difference]: Without dead ends: 362 [2024-11-09 01:34:03,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:34:03,091 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:03,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:34:03,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-09 01:34:03,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2024-11-09 01:34:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 282 states have (on average 1.2624113475177305) internal successors, (356), 285 states have internal predecessors, (356), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-09 01:34:03,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 492 transitions. [2024-11-09 01:34:03,173 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 492 transitions. Word has length 113 [2024-11-09 01:34:03,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:03,173 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 492 transitions. [2024-11-09 01:34:03,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:03,174 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 492 transitions. [2024-11-09 01:34:03,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 01:34:03,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:03,175 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:03,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:34:03,175 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:03,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:03,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1728394544, now seen corresponding path program 1 times [2024-11-09 01:34:03,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:03,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188862653] [2024-11-09 01:34:03,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:03,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:03,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:03,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188862653] [2024-11-09 01:34:03,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188862653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:03,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:03,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:34:03,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441319698] [2024-11-09 01:34:03,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:03,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:34:03,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:03,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:34:03,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:34:03,334 INFO L87 Difference]: Start difference. First operand 362 states and 492 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:03,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:03,413 INFO L93 Difference]: Finished difference Result 700 states and 951 transitions. [2024-11-09 01:34:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:34:03,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-09 01:34:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:03,417 INFO L225 Difference]: With dead ends: 700 [2024-11-09 01:34:03,417 INFO L226 Difference]: Without dead ends: 374 [2024-11-09 01:34:03,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:34:03,419 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:03,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 443 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:34:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-09 01:34:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-11-09 01:34:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 294 states have (on average 1.251700680272109) internal successors, (368), 297 states have internal predecessors, (368), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-09 01:34:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 504 transitions. [2024-11-09 01:34:03,478 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 504 transitions. Word has length 113 [2024-11-09 01:34:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:03,478 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 504 transitions. [2024-11-09 01:34:03,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 504 transitions. [2024-11-09 01:34:03,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 01:34:03,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:03,480 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:03,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:34:03,480 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:03,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1336855875, now seen corresponding path program 1 times [2024-11-09 01:34:03,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:03,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103268654] [2024-11-09 01:34:03,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:03,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:04,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:04,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:04,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:04,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:04,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:04,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:04,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:04,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:04,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:04,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:04,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:04,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:04,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:04,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:04,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:04,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103268654] [2024-11-09 01:34:04,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103268654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:04,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:04,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:34:04,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114999370] [2024-11-09 01:34:04,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:04,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:34:04,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:04,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:34:04,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:34:04,158 INFO L87 Difference]: Start difference. First operand 374 states and 504 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:05,484 INFO L93 Difference]: Finished difference Result 965 states and 1291 transitions. [2024-11-09 01:34:05,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 01:34:05,484 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-09 01:34:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:05,488 INFO L225 Difference]: With dead ends: 965 [2024-11-09 01:34:05,488 INFO L226 Difference]: Without dead ends: 714 [2024-11-09 01:34:05,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-09 01:34:05,490 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 504 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:05,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 852 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 01:34:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-11-09 01:34:05,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 380. [2024-11-09 01:34:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 300 states have (on average 1.2566666666666666) internal successors, (377), 303 states have internal predecessors, (377), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-09 01:34:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 513 transitions. [2024-11-09 01:34:05,555 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 513 transitions. Word has length 113 [2024-11-09 01:34:05,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:05,555 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 513 transitions. [2024-11-09 01:34:05,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 513 transitions. [2024-11-09 01:34:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 01:34:05,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:05,557 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:05,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:34:05,557 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:05,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:05,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1956569533, now seen corresponding path program 1 times [2024-11-09 01:34:05,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:05,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997642117] [2024-11-09 01:34:05,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:05,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:06,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:06,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:06,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:06,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:06,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:06,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:06,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:06,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:06,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:06,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:06,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:06,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:06,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:06,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:06,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997642117] [2024-11-09 01:34:06,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997642117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:06,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:06,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:34:06,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231639967] [2024-11-09 01:34:06,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:06,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:34:06,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:06,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:34:06,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:34:06,339 INFO L87 Difference]: Start difference. First operand 380 states and 513 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:07,198 INFO L93 Difference]: Finished difference Result 807 states and 1088 transitions. [2024-11-09 01:34:07,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:34:07,199 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2024-11-09 01:34:07,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:07,202 INFO L225 Difference]: With dead ends: 807 [2024-11-09 01:34:07,202 INFO L226 Difference]: Without dead ends: 550 [2024-11-09 01:34:07,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:34:07,204 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 413 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:07,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 710 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:34:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-09 01:34:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 386. [2024-11-09 01:34:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 306 states have (on average 1.261437908496732) internal successors, (386), 309 states have internal predecessors, (386), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-09 01:34:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 522 transitions. [2024-11-09 01:34:07,268 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 522 transitions. Word has length 113 [2024-11-09 01:34:07,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:07,269 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 522 transitions. [2024-11-09 01:34:07,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 522 transitions. [2024-11-09 01:34:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 01:34:07,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:07,270 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:07,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:34:07,271 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:07,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:07,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1369763519, now seen corresponding path program 1 times [2024-11-09 01:34:07,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:07,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445612258] [2024-11-09 01:34:07,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:07,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:07,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:07,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:07,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:07,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:07,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:07,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:07,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:07,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:07,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:07,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:07,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:07,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:07,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:07,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:07,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:07,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445612258] [2024-11-09 01:34:07,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445612258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:07,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:07,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:34:07,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438806868] [2024-11-09 01:34:07,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:07,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:34:07,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:07,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:34:07,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:34:07,850 INFO L87 Difference]: Start difference. First operand 386 states and 522 transitions. Second operand has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 01:34:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:08,131 INFO L93 Difference]: Finished difference Result 657 states and 888 transitions. [2024-11-09 01:34:08,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:34:08,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2024-11-09 01:34:08,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:08,135 INFO L225 Difference]: With dead ends: 657 [2024-11-09 01:34:08,135 INFO L226 Difference]: Without dead ends: 394 [2024-11-09 01:34:08,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:34:08,137 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 85 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:08,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 954 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:34:08,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-09 01:34:08,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2024-11-09 01:34:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 311 states have (on average 1.257234726688103) internal successors, (391), 314 states have internal predecessors, (391), 68 states have call successors, (68), 12 states have call predecessors, (68), 12 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-09 01:34:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 527 transitions. [2024-11-09 01:34:08,221 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 527 transitions. Word has length 113 [2024-11-09 01:34:08,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:08,221 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 527 transitions. [2024-11-09 01:34:08,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 01:34:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 527 transitions. [2024-11-09 01:34:08,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 01:34:08,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:08,223 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:08,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:34:08,223 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:08,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:08,223 INFO L85 PathProgramCache]: Analyzing trace with hash -914154049, now seen corresponding path program 1 times [2024-11-09 01:34:08,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:08,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266252003] [2024-11-09 01:34:08,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:08,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:09,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:09,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:09,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:09,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:09,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:09,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:09,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:09,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:09,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:09,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:09,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:09,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:09,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:09,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:09,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:09,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266252003] [2024-11-09 01:34:09,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266252003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:09,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:09,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 01:34:09,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116038756] [2024-11-09 01:34:09,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:09,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 01:34:09,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:09,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 01:34:09,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:34:09,935 INFO L87 Difference]: Start difference. First operand 392 states and 527 transitions. Second operand has 17 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 17 states have internal predecessors, (46), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-09 01:34:13,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:13,568 INFO L93 Difference]: Finished difference Result 930 states and 1249 transitions. [2024-11-09 01:34:13,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-09 01:34:13,569 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 17 states have internal predecessors, (46), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) Word has length 113 [2024-11-09 01:34:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:13,573 INFO L225 Difference]: With dead ends: 930 [2024-11-09 01:34:13,573 INFO L226 Difference]: Without dead ends: 661 [2024-11-09 01:34:13,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=250, Invalid=1390, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 01:34:13,577 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 478 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 2093 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 2093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:13,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1727 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 2093 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 01:34:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-09 01:34:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 480. [2024-11-09 01:34:13,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 385 states have (on average 1.264935064935065) internal successors, (487), 389 states have internal predecessors, (487), 78 states have call successors, (78), 16 states have call predecessors, (78), 16 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-09 01:34:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 643 transitions. [2024-11-09 01:34:13,646 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 643 transitions. Word has length 113 [2024-11-09 01:34:13,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:13,647 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 643 transitions. [2024-11-09 01:34:13,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 17 states have internal predecessors, (46), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-09 01:34:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 643 transitions. [2024-11-09 01:34:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 01:34:13,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:13,649 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:13,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 01:34:13,650 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:13,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:13,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1915695937, now seen corresponding path program 1 times [2024-11-09 01:34:13,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:13,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20817337] [2024-11-09 01:34:13,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:13,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:14,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:14,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:14,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:14,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:14,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:14,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:14,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:14,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:14,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:14,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:14,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:14,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:14,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:14,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:14,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:14,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20817337] [2024-11-09 01:34:14,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20817337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:14,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:14,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:34:14,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496881333] [2024-11-09 01:34:14,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:14,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:34:14,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:14,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:34:14,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:34:14,143 INFO L87 Difference]: Start difference. First operand 480 states and 643 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:14,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:14,705 INFO L93 Difference]: Finished difference Result 759 states and 1016 transitions. [2024-11-09 01:34:14,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:34:14,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-09 01:34:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:14,708 INFO L225 Difference]: With dead ends: 759 [2024-11-09 01:34:14,709 INFO L226 Difference]: Without dead ends: 490 [2024-11-09 01:34:14,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:34:14,711 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 272 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:14,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 481 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:34:14,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-09 01:34:14,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 404. [2024-11-09 01:34:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 323 states have (on average 1.2600619195046439) internal successors, (407), 326 states have internal predecessors, (407), 66 states have call successors, (66), 14 states have call predecessors, (66), 14 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 539 transitions. [2024-11-09 01:34:14,772 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 539 transitions. Word has length 113 [2024-11-09 01:34:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:14,772 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 539 transitions. [2024-11-09 01:34:14,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 539 transitions. [2024-11-09 01:34:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:34:14,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:14,774 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:14,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 01:34:14,774 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:14,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:14,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1567346285, now seen corresponding path program 1 times [2024-11-09 01:34:14,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:14,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665947916] [2024-11-09 01:34:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:14,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:16,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:16,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:16,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:16,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:16,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:16,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:16,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:16,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:16,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:16,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:16,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:16,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:16,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:16,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:16,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:16,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665947916] [2024-11-09 01:34:16,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665947916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:16,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:16,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 01:34:16,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967469405] [2024-11-09 01:34:16,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:16,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 01:34:16,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:16,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 01:34:16,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:34:16,216 INFO L87 Difference]: Start difference. First operand 404 states and 539 transitions. Second operand has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 01:34:17,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:17,139 INFO L93 Difference]: Finished difference Result 707 states and 940 transitions. [2024-11-09 01:34:17,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 01:34:17,140 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2024-11-09 01:34:17,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:17,143 INFO L225 Difference]: With dead ends: 707 [2024-11-09 01:34:17,143 INFO L226 Difference]: Without dead ends: 514 [2024-11-09 01:34:17,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2024-11-09 01:34:17,145 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 284 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:17,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 999 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:34:17,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-09 01:34:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 417. [2024-11-09 01:34:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 336 states have (on average 1.2678571428571428) internal successors, (426), 339 states have internal predecessors, (426), 66 states have call successors, (66), 14 states have call predecessors, (66), 14 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:17,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 558 transitions. [2024-11-09 01:34:17,211 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 558 transitions. Word has length 115 [2024-11-09 01:34:17,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:17,211 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 558 transitions. [2024-11-09 01:34:17,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 01:34:17,212 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 558 transitions. [2024-11-09 01:34:17,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:34:17,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:17,213 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:17,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 01:34:17,213 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:17,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:17,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2043987111, now seen corresponding path program 1 times [2024-11-09 01:34:17,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:17,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179518035] [2024-11-09 01:34:17,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:17,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:17,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:17,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:17,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:17,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:17,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:17,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:17,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:17,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:17,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:17,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:17,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:17,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:17,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:17,890 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:17,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:17,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179518035] [2024-11-09 01:34:17,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179518035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:17,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:17,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:34:17,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297042306] [2024-11-09 01:34:17,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:17,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:34:17,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:17,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:34:17,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:34:17,892 INFO L87 Difference]: Start difference. First operand 417 states and 558 transitions. Second operand has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 01:34:18,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:18,211 INFO L93 Difference]: Finished difference Result 754 states and 1016 transitions. [2024-11-09 01:34:18,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:34:18,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2024-11-09 01:34:18,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:18,215 INFO L225 Difference]: With dead ends: 754 [2024-11-09 01:34:18,215 INFO L226 Difference]: Without dead ends: 501 [2024-11-09 01:34:18,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:34:18,217 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 57 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:18,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 611 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:34:18,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-09 01:34:18,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 434. [2024-11-09 01:34:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 353 states have (on average 1.2804532577903682) internal successors, (452), 356 states have internal predecessors, (452), 66 states have call successors, (66), 14 states have call predecessors, (66), 14 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 584 transitions. [2024-11-09 01:34:18,280 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 584 transitions. Word has length 115 [2024-11-09 01:34:18,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:18,280 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 584 transitions. [2024-11-09 01:34:18,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 01:34:18,281 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 584 transitions. [2024-11-09 01:34:18,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:34:18,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:18,282 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:18,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 01:34:18,283 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:18,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:18,283 INFO L85 PathProgramCache]: Analyzing trace with hash -503072153, now seen corresponding path program 1 times [2024-11-09 01:34:18,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:18,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991519977] [2024-11-09 01:34:18,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:18,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:18,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:18,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:18,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:18,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:18,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:18,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:18,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:18,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:18,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:18,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:18,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:18,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:18,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:18,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:18,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:18,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991519977] [2024-11-09 01:34:18,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991519977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:18,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:18,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:34:18,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867380305] [2024-11-09 01:34:18,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:18,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:34:18,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:18,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:34:18,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:34:18,732 INFO L87 Difference]: Start difference. First operand 434 states and 584 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:19,148 INFO L93 Difference]: Finished difference Result 719 states and 969 transitions. [2024-11-09 01:34:19,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:34:19,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-09 01:34:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:19,152 INFO L225 Difference]: With dead ends: 719 [2024-11-09 01:34:19,152 INFO L226 Difference]: Without dead ends: 432 [2024-11-09 01:34:19,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:34:19,154 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 278 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:19,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 272 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:34:19,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-09 01:34:19,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 416. [2024-11-09 01:34:19,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 335 states have (on average 1.2597014925373133) internal successors, (422), 338 states have internal predecessors, (422), 66 states have call successors, (66), 14 states have call predecessors, (66), 14 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:19,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 554 transitions. [2024-11-09 01:34:19,213 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 554 transitions. Word has length 115 [2024-11-09 01:34:19,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:19,214 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 554 transitions. [2024-11-09 01:34:19,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:19,214 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 554 transitions. [2024-11-09 01:34:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:34:19,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:19,216 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:19,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 01:34:19,216 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:19,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:19,217 INFO L85 PathProgramCache]: Analyzing trace with hash 331745610, now seen corresponding path program 1 times [2024-11-09 01:34:19,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:19,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596102263] [2024-11-09 01:34:19,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:19,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,470 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:19,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:19,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596102263] [2024-11-09 01:34:19,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596102263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:19,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:19,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:34:19,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929901704] [2024-11-09 01:34:19,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:19,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:34:19,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:19,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:34:19,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:34:19,474 INFO L87 Difference]: Start difference. First operand 416 states and 554 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:19,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:19,580 INFO L93 Difference]: Finished difference Result 857 states and 1142 transitions. [2024-11-09 01:34:19,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:34:19,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-09 01:34:19,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:19,583 INFO L225 Difference]: With dead ends: 857 [2024-11-09 01:34:19,583 INFO L226 Difference]: Without dead ends: 481 [2024-11-09 01:34:19,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:34:19,585 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 106 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:19,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 482 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:34:19,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-09 01:34:19,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 416. [2024-11-09 01:34:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 335 states have (on average 1.2507462686567163) internal successors, (419), 338 states have internal predecessors, (419), 66 states have call successors, (66), 14 states have call predecessors, (66), 14 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 551 transitions. [2024-11-09 01:34:19,654 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 551 transitions. Word has length 116 [2024-11-09 01:34:19,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:19,655 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 551 transitions. [2024-11-09 01:34:19,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 551 transitions. [2024-11-09 01:34:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:34:19,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:19,656 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:19,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 01:34:19,657 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:19,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:19,657 INFO L85 PathProgramCache]: Analyzing trace with hash 754447436, now seen corresponding path program 1 times [2024-11-09 01:34:19,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:19,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847433289] [2024-11-09 01:34:19,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:19,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:19,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:20,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:20,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847433289] [2024-11-09 01:34:20,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847433289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:20,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:20,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:34:20,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18352972] [2024-11-09 01:34:20,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:20,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:34:20,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:20,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:34:20,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:34:20,009 INFO L87 Difference]: Start difference. First operand 416 states and 551 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:20,564 INFO L93 Difference]: Finished difference Result 896 states and 1190 transitions. [2024-11-09 01:34:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:34:20,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-09 01:34:20,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:20,568 INFO L225 Difference]: With dead ends: 896 [2024-11-09 01:34:20,569 INFO L226 Difference]: Without dead ends: 520 [2024-11-09 01:34:20,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:34:20,570 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 197 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:20,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 521 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:34:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-09 01:34:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 415. [2024-11-09 01:34:20,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 334 states have (on average 1.248502994011976) internal successors, (417), 337 states have internal predecessors, (417), 66 states have call successors, (66), 14 states have call predecessors, (66), 14 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 549 transitions. [2024-11-09 01:34:20,648 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 549 transitions. Word has length 116 [2024-11-09 01:34:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:20,648 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 549 transitions. [2024-11-09 01:34:20,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:20,649 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 549 transitions. [2024-11-09 01:34:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:34:20,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:20,650 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:20,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 01:34:20,650 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:20,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash -525416242, now seen corresponding path program 1 times [2024-11-09 01:34:20,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:20,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210526151] [2024-11-09 01:34:20,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:20,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:20,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:20,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210526151] [2024-11-09 01:34:20,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210526151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:20,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:20,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:34:20,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221998430] [2024-11-09 01:34:20,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:20,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:34:20,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:20,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:34:20,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:34:20,921 INFO L87 Difference]: Start difference. First operand 415 states and 549 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:21,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:21,025 INFO L93 Difference]: Finished difference Result 843 states and 1115 transitions. [2024-11-09 01:34:21,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:34:21,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-09 01:34:21,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:21,029 INFO L225 Difference]: With dead ends: 843 [2024-11-09 01:34:21,029 INFO L226 Difference]: Without dead ends: 468 [2024-11-09 01:34:21,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:34:21,031 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 46 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:21,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 583 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:34:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-09 01:34:21,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 403. [2024-11-09 01:34:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 322 states have (on average 1.2329192546583851) internal successors, (397), 325 states have internal predecessors, (397), 66 states have call successors, (66), 14 states have call predecessors, (66), 14 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 529 transitions. [2024-11-09 01:34:21,088 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 529 transitions. Word has length 116 [2024-11-09 01:34:21,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:21,088 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 529 transitions. [2024-11-09 01:34:21,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 529 transitions. [2024-11-09 01:34:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:34:21,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:21,090 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:21,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 01:34:21,090 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:21,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:21,090 INFO L85 PathProgramCache]: Analyzing trace with hash 70813536, now seen corresponding path program 1 times [2024-11-09 01:34:21,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:21,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513441529] [2024-11-09 01:34:21,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:21,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:21,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:21,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:21,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:21,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:21,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:21,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:21,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:21,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:21,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:21,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:21,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:21,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:21,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:21,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:21,423 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:21,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:21,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513441529] [2024-11-09 01:34:21,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513441529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:21,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:21,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:34:21,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106482658] [2024-11-09 01:34:21,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:21,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:34:21,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:21,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:34:21,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:34:21,425 INFO L87 Difference]: Start difference. First operand 403 states and 529 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:21,580 INFO L93 Difference]: Finished difference Result 772 states and 1013 transitions. [2024-11-09 01:34:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:34:21,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-09 01:34:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:21,583 INFO L225 Difference]: With dead ends: 772 [2024-11-09 01:34:21,583 INFO L226 Difference]: Without dead ends: 409 [2024-11-09 01:34:21,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:34:21,584 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 47 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:21,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 277 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:34:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-09 01:34:21,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 403. [2024-11-09 01:34:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 322 states have (on average 1.2298136645962734) internal successors, (396), 325 states have internal predecessors, (396), 66 states have call successors, (66), 14 states have call predecessors, (66), 14 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 528 transitions. [2024-11-09 01:34:21,642 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 528 transitions. Word has length 116 [2024-11-09 01:34:21,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:21,642 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 528 transitions. [2024-11-09 01:34:21,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 528 transitions. [2024-11-09 01:34:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:34:21,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:21,644 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:21,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 01:34:21,644 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:21,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:21,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2102425942, now seen corresponding path program 1 times [2024-11-09 01:34:21,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:21,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912158016] [2024-11-09 01:34:21,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:21,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:23,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:23,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:23,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:23,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:23,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:23,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:23,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:23,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:23,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:23,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:23,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:23,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:23,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:23,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:23,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912158016] [2024-11-09 01:34:23,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912158016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:23,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:23,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 01:34:23,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170123972] [2024-11-09 01:34:23,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:23,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:34:23,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:23,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:34:23,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:34:23,068 INFO L87 Difference]: Start difference. First operand 403 states and 528 transitions. Second operand has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:23,687 INFO L93 Difference]: Finished difference Result 465 states and 603 transitions. [2024-11-09 01:34:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 01:34:23,688 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-11-09 01:34:23,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:23,691 INFO L225 Difference]: With dead ends: 465 [2024-11-09 01:34:23,691 INFO L226 Difference]: Without dead ends: 463 [2024-11-09 01:34:23,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:34:23,693 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 180 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:23,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 706 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:34:23,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-09 01:34:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 419. [2024-11-09 01:34:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 337 states have (on average 1.2195845697329377) internal successors, (411), 340 states have internal predecessors, (411), 66 states have call successors, (66), 15 states have call predecessors, (66), 15 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:23,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 543 transitions. [2024-11-09 01:34:23,759 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 543 transitions. Word has length 117 [2024-11-09 01:34:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:23,759 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 543 transitions. [2024-11-09 01:34:23,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 543 transitions. [2024-11-09 01:34:23,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:34:23,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:23,761 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:23,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 01:34:23,761 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:23,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:23,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2100578900, now seen corresponding path program 1 times [2024-11-09 01:34:23,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:23,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010606912] [2024-11-09 01:34:23,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:23,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:24,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:24,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:24,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:24,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:24,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:24,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:24,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:24,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:24,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:24,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:24,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:24,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:24,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:24,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:24,565 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:24,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:24,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010606912] [2024-11-09 01:34:24,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010606912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:24,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:24,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:34:24,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233885230] [2024-11-09 01:34:24,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:24,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:34:24,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:24,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:34:24,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:34:24,568 INFO L87 Difference]: Start difference. First operand 419 states and 543 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:25,343 INFO L93 Difference]: Finished difference Result 919 states and 1188 transitions. [2024-11-09 01:34:25,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:34:25,343 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-11-09 01:34:25,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:25,346 INFO L225 Difference]: With dead ends: 919 [2024-11-09 01:34:25,346 INFO L226 Difference]: Without dead ends: 544 [2024-11-09 01:34:25,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2024-11-09 01:34:25,348 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 300 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:25,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 678 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:34:25,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-09 01:34:25,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 435. [2024-11-09 01:34:25,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 349 states have (on average 1.2005730659025788) internal successors, (419), 352 states have internal predecessors, (419), 66 states have call successors, (66), 19 states have call predecessors, (66), 19 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 551 transitions. [2024-11-09 01:34:25,415 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 551 transitions. Word has length 117 [2024-11-09 01:34:25,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:25,416 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 551 transitions. [2024-11-09 01:34:25,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 551 transitions. [2024-11-09 01:34:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:34:25,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:25,418 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:25,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 01:34:25,418 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:25,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:25,419 INFO L85 PathProgramCache]: Analyzing trace with hash -325571538, now seen corresponding path program 1 times [2024-11-09 01:34:25,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:25,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114637633] [2024-11-09 01:34:25,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:25,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:25,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:25,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:25,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:25,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:25,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:25,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:25,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:25,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:25,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:25,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:25,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:25,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:25,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:34:25,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:25,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114637633] [2024-11-09 01:34:25,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114637633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:34:25,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393428275] [2024-11-09 01:34:25,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:25,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:34:25,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:34:25,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:34:25,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:34:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:26,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 01:34:26,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:26,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:26,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2024-11-09 01:34:26,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 34 [2024-11-09 01:34:26,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-09 01:34:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:26,471 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:34:26,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393428275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:26,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:34:26,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-11-09 01:34:26,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129704265] [2024-11-09 01:34:26,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:26,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:34:26,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:26,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:34:26,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:34:26,474 INFO L87 Difference]: Start difference. First operand 435 states and 551 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:26,841 INFO L93 Difference]: Finished difference Result 758 states and 961 transitions. [2024-11-09 01:34:26,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:34:26,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-11-09 01:34:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:26,845 INFO L225 Difference]: With dead ends: 758 [2024-11-09 01:34:26,845 INFO L226 Difference]: Without dead ends: 533 [2024-11-09 01:34:26,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:34:26,847 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 161 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:26,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 825 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:34:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-09 01:34:26,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 472. [2024-11-09 01:34:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 386 states have (on average 1.2072538860103628) internal successors, (466), 389 states have internal predecessors, (466), 66 states have call successors, (66), 19 states have call predecessors, (66), 19 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 598 transitions. [2024-11-09 01:34:26,921 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 598 transitions. Word has length 117 [2024-11-09 01:34:26,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:26,921 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 598 transitions. [2024-11-09 01:34:26,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:26,921 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 598 transitions. [2024-11-09 01:34:26,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:34:26,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:26,923 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:26,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:34:27,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 01:34:27,124 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:27,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:27,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1293632746, now seen corresponding path program 1 times [2024-11-09 01:34:27,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:27,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805777285] [2024-11-09 01:34:27,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:27,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:27,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:27,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:27,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:27,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:27,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:27,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:27,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:27,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:27,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:27,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:27,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:27,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:27,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:27,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:27,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:27,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805777285] [2024-11-09 01:34:27,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805777285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:27,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:27,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:34:27,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247617194] [2024-11-09 01:34:27,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:27,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:34:27,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:27,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:34:27,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:34:27,724 INFO L87 Difference]: Start difference. First operand 472 states and 598 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:28,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:28,356 INFO L93 Difference]: Finished difference Result 901 states and 1150 transitions. [2024-11-09 01:34:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:34:28,357 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-11-09 01:34:28,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:28,361 INFO L225 Difference]: With dead ends: 901 [2024-11-09 01:34:28,361 INFO L226 Difference]: Without dead ends: 639 [2024-11-09 01:34:28,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:34:28,362 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 302 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:28,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 573 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:34:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-09 01:34:28,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 492. [2024-11-09 01:34:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 406 states have (on average 1.20935960591133) internal successors, (491), 409 states have internal predecessors, (491), 66 states have call successors, (66), 19 states have call predecessors, (66), 19 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 623 transitions. [2024-11-09 01:34:28,436 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 623 transitions. Word has length 118 [2024-11-09 01:34:28,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:28,437 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 623 transitions. [2024-11-09 01:34:28,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 623 transitions. [2024-11-09 01:34:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:34:28,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:28,438 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:28,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 01:34:28,439 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:28,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:28,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1604330016, now seen corresponding path program 1 times [2024-11-09 01:34:28,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:28,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93627379] [2024-11-09 01:34:28,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:28,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:28,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:28,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:28,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:28,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:28,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:28,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:28,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:28,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:28,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:28,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:28,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:28,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:28,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:28,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:28,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93627379] [2024-11-09 01:34:28,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93627379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:28,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:28,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:34:28,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814646562] [2024-11-09 01:34:28,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:28,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:34:28,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:28,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:34:28,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:34:28,902 INFO L87 Difference]: Start difference. First operand 492 states and 623 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:29,401 INFO L93 Difference]: Finished difference Result 965 states and 1229 transitions. [2024-11-09 01:34:29,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:34:29,402 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-11-09 01:34:29,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:29,405 INFO L225 Difference]: With dead ends: 965 [2024-11-09 01:34:29,405 INFO L226 Difference]: Without dead ends: 639 [2024-11-09 01:34:29,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:34:29,407 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 190 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:29,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 631 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:34:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-09 01:34:29,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 521. [2024-11-09 01:34:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 435 states have (on average 1.2137931034482758) internal successors, (528), 438 states have internal predecessors, (528), 66 states have call successors, (66), 19 states have call predecessors, (66), 19 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 660 transitions. [2024-11-09 01:34:29,489 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 660 transitions. Word has length 118 [2024-11-09 01:34:29,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:29,490 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 660 transitions. [2024-11-09 01:34:29,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:29,490 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 660 transitions. [2024-11-09 01:34:29,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:34:29,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:29,491 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:29,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 01:34:29,492 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:29,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:29,492 INFO L85 PathProgramCache]: Analyzing trace with hash 324466338, now seen corresponding path program 1 times [2024-11-09 01:34:29,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:29,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123163592] [2024-11-09 01:34:29,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:30,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:30,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123163592] [2024-11-09 01:34:30,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123163592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:30,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:30,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:34:30,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137886292] [2024-11-09 01:34:30,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:30,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:34:30,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:30,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:34:30,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:34:30,041 INFO L87 Difference]: Start difference. First operand 521 states and 660 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:30,575 INFO L93 Difference]: Finished difference Result 958 states and 1214 transitions. [2024-11-09 01:34:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:34:30,576 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-11-09 01:34:30,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:30,585 INFO L225 Difference]: With dead ends: 958 [2024-11-09 01:34:30,585 INFO L226 Difference]: Without dead ends: 639 [2024-11-09 01:34:30,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:34:30,587 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 231 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:30,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 597 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:34:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-09 01:34:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 527. [2024-11-09 01:34:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 441 states have (on average 1.2086167800453516) internal successors, (533), 444 states have internal predecessors, (533), 66 states have call successors, (66), 19 states have call predecessors, (66), 19 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 665 transitions. [2024-11-09 01:34:30,659 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 665 transitions. Word has length 118 [2024-11-09 01:34:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:30,659 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 665 transitions. [2024-11-09 01:34:30,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 665 transitions. [2024-11-09 01:34:30,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:34:30,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:30,660 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:30,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 01:34:30,661 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:30,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:30,661 INFO L85 PathProgramCache]: Analyzing trace with hash -303223042, now seen corresponding path program 1 times [2024-11-09 01:34:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:30,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955381767] [2024-11-09 01:34:30,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:30,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:30,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:30,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955381767] [2024-11-09 01:34:30,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955381767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:30,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:30,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:34:30,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906238848] [2024-11-09 01:34:30,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:30,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:34:30,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:30,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:34:30,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:34:30,923 INFO L87 Difference]: Start difference. First operand 527 states and 665 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:31,057 INFO L93 Difference]: Finished difference Result 1099 states and 1389 transitions. [2024-11-09 01:34:31,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:34:31,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-09 01:34:31,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:31,064 INFO L225 Difference]: With dead ends: 1099 [2024-11-09 01:34:31,064 INFO L226 Difference]: Without dead ends: 616 [2024-11-09 01:34:31,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:34:31,067 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 80 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:31,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 512 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:34:31,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-09 01:34:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 571. [2024-11-09 01:34:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 485 states have (on average 1.2247422680412372) internal successors, (594), 488 states have internal predecessors, (594), 66 states have call successors, (66), 19 states have call predecessors, (66), 19 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 726 transitions. [2024-11-09 01:34:31,175 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 726 transitions. Word has length 119 [2024-11-09 01:34:31,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:31,175 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 726 transitions. [2024-11-09 01:34:31,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:34:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 726 transitions. [2024-11-09 01:34:31,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:34:31,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:31,177 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:31,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 01:34:31,177 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:31,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:31,177 INFO L85 PathProgramCache]: Analyzing trace with hash -45057604, now seen corresponding path program 1 times [2024-11-09 01:34:31,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:31,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742287822] [2024-11-09 01:34:31,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:31,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:31,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:31,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:31,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:31,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:31,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:31,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:31,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:31,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:31,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:31,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:31,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:31,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:31,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:31,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:31,814 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:31,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:31,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742287822] [2024-11-09 01:34:31,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742287822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:31,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:31,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:34:31,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599655426] [2024-11-09 01:34:31,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:31,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:34:31,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:31,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:34:31,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:34:31,817 INFO L87 Difference]: Start difference. First operand 571 states and 726 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:32,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:32,158 INFO L93 Difference]: Finished difference Result 1201 states and 1519 transitions. [2024-11-09 01:34:32,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:34:32,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-09 01:34:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:32,162 INFO L225 Difference]: With dead ends: 1201 [2024-11-09 01:34:32,162 INFO L226 Difference]: Without dead ends: 674 [2024-11-09 01:34:32,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:34:32,163 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 152 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:32,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 780 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:34:32,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-09 01:34:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 587. [2024-11-09 01:34:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 501 states have (on average 1.219560878243513) internal successors, (611), 504 states have internal predecessors, (611), 66 states have call successors, (66), 19 states have call predecessors, (66), 19 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 743 transitions. [2024-11-09 01:34:32,232 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 743 transitions. Word has length 119 [2024-11-09 01:34:32,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:32,233 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 743 transitions. [2024-11-09 01:34:32,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:32,233 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 743 transitions. [2024-11-09 01:34:32,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:34:32,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:32,234 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:32,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 01:34:32,234 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:32,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:32,234 INFO L85 PathProgramCache]: Analyzing trace with hash 656006974, now seen corresponding path program 1 times [2024-11-09 01:34:32,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:32,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872156978] [2024-11-09 01:34:32,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:32,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:32,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:32,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:32,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:32,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:32,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:32,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:32,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:32,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:32,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:32,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:32,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:32,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:32,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:32,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:32,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:32,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872156978] [2024-11-09 01:34:32,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872156978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:32,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:32,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:34:32,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056207626] [2024-11-09 01:34:32,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:32,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:34:32,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:32,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:34:32,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:34:32,689 INFO L87 Difference]: Start difference. First operand 587 states and 743 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:33,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:33,044 INFO L93 Difference]: Finished difference Result 1373 states and 1735 transitions. [2024-11-09 01:34:33,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:34:33,044 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-09 01:34:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:33,048 INFO L225 Difference]: With dead ends: 1373 [2024-11-09 01:34:33,048 INFO L226 Difference]: Without dead ends: 830 [2024-11-09 01:34:33,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:34:33,050 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 182 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:33,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 714 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:34:33,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-11-09 01:34:33,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 748. [2024-11-09 01:34:33,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 662 states have (on average 1.2356495468277946) internal successors, (818), 664 states have internal predecessors, (818), 66 states have call successors, (66), 19 states have call predecessors, (66), 19 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 950 transitions. [2024-11-09 01:34:33,142 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 950 transitions. Word has length 119 [2024-11-09 01:34:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:33,142 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 950 transitions. [2024-11-09 01:34:33,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:33,143 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 950 transitions. [2024-11-09 01:34:33,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:34:33,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:33,144 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:33,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 01:34:33,145 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:33,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:33,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1850495938, now seen corresponding path program 1 times [2024-11-09 01:34:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:33,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307397071] [2024-11-09 01:34:33,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:33,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:33,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:33,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:33,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:33,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:33,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:33,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:33,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:33,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:33,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:33,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:33,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:33,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:33,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:33,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:33,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307397071] [2024-11-09 01:34:33,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307397071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:33,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:33,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:34:33,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528331703] [2024-11-09 01:34:33,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:33,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:34:33,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:33,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:34:33,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:34:33,546 INFO L87 Difference]: Start difference. First operand 748 states and 950 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:33,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:33,827 INFO L93 Difference]: Finished difference Result 1359 states and 1725 transitions. [2024-11-09 01:34:33,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:34:33,827 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-09 01:34:33,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:33,830 INFO L225 Difference]: With dead ends: 1359 [2024-11-09 01:34:33,830 INFO L226 Difference]: Without dead ends: 736 [2024-11-09 01:34:33,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:34:33,831 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 113 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:33,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 528 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:34:33,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-11-09 01:34:33,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2024-11-09 01:34:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 650 states have (on average 1.2323076923076923) internal successors, (801), 652 states have internal predecessors, (801), 66 states have call successors, (66), 19 states have call predecessors, (66), 19 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 933 transitions. [2024-11-09 01:34:33,914 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 933 transitions. Word has length 119 [2024-11-09 01:34:33,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:33,914 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 933 transitions. [2024-11-09 01:34:33,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:34:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 933 transitions. [2024-11-09 01:34:33,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:34:33,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:33,915 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:33,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 01:34:33,916 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:33,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:33,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1275504314, now seen corresponding path program 1 times [2024-11-09 01:34:33,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:33,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787647472] [2024-11-09 01:34:33,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:33,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:34,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:34,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:34,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:34,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:34,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:34,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:34,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:34:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:34,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:34:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:34,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:34,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:34:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:34,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:34:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:34,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:34:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:34,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:34:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:34,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:34:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:34:34,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:34,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787647472] [2024-11-09 01:34:34,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787647472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:34,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:34,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:34:34,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342339972] [2024-11-09 01:34:34,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:34,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:34:34,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:34,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:34:34,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:34:34,948 INFO L87 Difference]: Start difference. First operand 736 states and 933 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 01:34:36,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:36,056 INFO L93 Difference]: Finished difference Result 1406 states and 1781 transitions. [2024-11-09 01:34:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 01:34:36,057 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2024-11-09 01:34:36,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:36,061 INFO L225 Difference]: With dead ends: 1406 [2024-11-09 01:34:36,062 INFO L226 Difference]: Without dead ends: 1051 [2024-11-09 01:34:36,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:34:36,063 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 312 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:36,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 766 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:34:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-11-09 01:34:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 775. [2024-11-09 01:34:36,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 689 states have (on average 1.227866473149492) internal successors, (846), 691 states have internal predecessors, (846), 66 states have call successors, (66), 19 states have call predecessors, (66), 19 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 01:34:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 978 transitions. [2024-11-09 01:34:36,143 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 978 transitions. Word has length 119 [2024-11-09 01:34:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:36,143 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 978 transitions. [2024-11-09 01:34:36,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 01:34:36,144 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 978 transitions. [2024-11-09 01:34:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 01:34:36,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:36,145 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:36,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 01:34:36,145 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:36,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:36,146 INFO L85 PathProgramCache]: Analyzing trace with hash -943492236, now seen corresponding path program 1 times [2024-11-09 01:34:36,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:36,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063950778] [2024-11-09 01:34:36,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:36,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat