./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.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-56.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 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:32:36,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:32:37,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:32:37,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:32:37,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:32:37,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:32:37,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:32:37,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:32:37,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:32:37,086 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:32:37,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:32:37,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:32:37,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:32:37,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:32:37,089 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:32:37,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:32:37,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:32:37,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:32:37,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:32:37,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:32:37,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:32:37,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:32:37,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:32:37,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:32:37,092 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:32:37,092 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:32:37,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:32:37,093 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:32:37,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:32:37,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:32:37,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:32:37,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:32:37,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:32:37,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:32:37,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:32:37,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:32:37,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:32:37,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:32:37,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:32:37,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:32:37,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:32:37,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:32:37,097 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 -> 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 [2024-11-09 01:32:37,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:32:37,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:32:37,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:32:37,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:32:37,398 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:32:37,399 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-56.i [2024-11-09 01:32:38,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:32:39,023 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:32:39,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i [2024-11-09 01:32:39,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34693ec62/ddc9fb0101b24fb5a2b9cb6c47122ca9/FLAG1a9ba337c [2024-11-09 01:32:39,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34693ec62/ddc9fb0101b24fb5a2b9cb6c47122ca9 [2024-11-09 01:32:39,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:32:39,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:32:39,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:32:39,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:32:39,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:32:39,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:32:39" (1/1) ... [2024-11-09 01:32:39,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a082e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:39, skipping insertion in model container [2024-11-09 01:32:39,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:32:39" (1/1) ... [2024-11-09 01:32:39,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:32:39,624 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-56.i[916,929] [2024-11-09 01:32:39,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:32:39,711 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:32:39,725 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-56.i[916,929] [2024-11-09 01:32:39,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:32:39,791 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:32:39,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:39 WrapperNode [2024-11-09 01:32:39,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:32:39,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:32:39,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:32:39,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:32:39,799 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:32:39" (1/1) ... [2024-11-09 01:32:39,816 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:32:39" (1/1) ... [2024-11-09 01:32:39,878 INFO L138 Inliner]: procedures = 29, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 575 [2024-11-09 01:32:39,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:32:39,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:32:39,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:32:39,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:32:39,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:39" (1/1) ... [2024-11-09 01:32:39,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:39" (1/1) ... [2024-11-09 01:32:39,914 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:39" (1/1) ... [2024-11-09 01:32:39,937 INFO L175 MemorySlicer]: Split 147 memory accesses to 5 slices as follows [2, 41, 11, 16, 77]. 52 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 5, 2, 1, 6]. The 18 writes are split as follows [0, 8, 2, 1, 7]. [2024-11-09 01:32:39,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:39" (1/1) ... [2024-11-09 01:32:39,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:39" (1/1) ... [2024-11-09 01:32:39,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:39" (1/1) ... [2024-11-09 01:32:39,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:39" (1/1) ... [2024-11-09 01:32:39,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:39" (1/1) ... [2024-11-09 01:32:40,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:39" (1/1) ... [2024-11-09 01:32:40,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:32:40,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:32:40,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:32:40,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:32:40,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:39" (1/1) ... [2024-11-09 01:32:40,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:32:40,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:32:40,121 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:32:40,131 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:32:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:32:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:32:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:32:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:32:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:32:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:32:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:32:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:32:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:32:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:32:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:32:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:32:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:32:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:32:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:32:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:32:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:32:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:32:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:32:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:32:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:32:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:32:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:32:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:32:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:32:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:32:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:32:40,178 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:32:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:32:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:32:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:32:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:32:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:32:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:32:40,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:32:40,323 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:32:40,325 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:32:40,863 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-11-09 01:32:40,863 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:32:40,881 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:32:40,881 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:32:40,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:32:40 BoogieIcfgContainer [2024-11-09 01:32:40,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:32:40,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:32:40,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:32:40,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:32:40,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:32:39" (1/3) ... [2024-11-09 01:32:40,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3061186c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:32:40, skipping insertion in model container [2024-11-09 01:32:40,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:39" (2/3) ... [2024-11-09 01:32:40,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3061186c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:32:40, skipping insertion in model container [2024-11-09 01:32:40,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:32:40" (3/3) ... [2024-11-09 01:32:40,890 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-56.i [2024-11-09 01:32:40,904 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:32:40,904 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:32:40,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:32:40,973 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;@54cddc9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:32:40,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:32:40,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:32:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 01:32:40,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:40,996 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:40,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:41,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:41,004 INFO L85 PathProgramCache]: Analyzing trace with hash -70143542, now seen corresponding path program 1 times [2024-11-09 01:32:41,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:41,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622943785] [2024-11-09 01:32:41,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:41,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:32:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:32:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:32:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:32:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:32:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:32:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:32:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:32:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:32:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:32:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:32:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:32:41,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:41,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622943785] [2024-11-09 01:32:41,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622943785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:41,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:41,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:32:41,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397774208] [2024-11-09 01:32:41,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:41,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:32:41,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:41,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:32:41,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:32:41,572 INFO L87 Difference]: Start difference. First operand has 126 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 01:32:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:41,603 INFO L93 Difference]: Finished difference Result 245 states and 387 transitions. [2024-11-09 01:32:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:32:41,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-11-09 01:32:41,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:41,617 INFO L225 Difference]: With dead ends: 245 [2024-11-09 01:32:41,617 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 01:32:41,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:32:41,627 INFO L432 NwaCegarLoop]: 180 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, 180 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:32:41,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:32:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 01:32:41,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-09 01:32:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:32:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2024-11-09 01:32:41,671 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 151 [2024-11-09 01:32:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:41,672 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2024-11-09 01:32:41,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 01:32:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2024-11-09 01:32:41,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 01:32:41,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:41,677 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:41,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:32:41,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:41,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:41,678 INFO L85 PathProgramCache]: Analyzing trace with hash 155255632, now seen corresponding path program 1 times [2024-11-09 01:32:41,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:41,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732310312] [2024-11-09 01:32:41,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:41,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:32:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:32:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:32:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:32:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:32:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:32:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:32:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:32:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:32:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:32:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:32:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:32:41,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:41,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732310312] [2024-11-09 01:32:41,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732310312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:41,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:41,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:32:41,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456110884] [2024-11-09 01:32:41,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:41,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:32:41,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:41,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:32:41,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:32:41,997 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:32:42,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:42,039 INFO L93 Difference]: Finished difference Result 242 states and 359 transitions. [2024-11-09 01:32:42,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:32:42,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-09 01:32:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:42,042 INFO L225 Difference]: With dead ends: 242 [2024-11-09 01:32:42,042 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 01:32:42,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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:32:42,044 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:42,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:32:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 01:32:42,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-09 01:32:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:32:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2024-11-09 01:32:42,064 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 181 transitions. Word has length 151 [2024-11-09 01:32:42,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:42,066 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 181 transitions. [2024-11-09 01:32:42,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:32:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 181 transitions. [2024-11-09 01:32:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 01:32:42,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:42,069 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:42,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:32:42,070 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:42,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:42,071 INFO L85 PathProgramCache]: Analyzing trace with hash -662392818, now seen corresponding path program 1 times [2024-11-09 01:32:42,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:42,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268640573] [2024-11-09 01:32:42,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:42,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:32:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:32:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:32:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:32:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:32:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:32:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:32:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:32:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:32:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:32:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:32:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:32:43,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:43,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268640573] [2024-11-09 01:32:43,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268640573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:43,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:43,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:32:43,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029162976] [2024-11-09 01:32:43,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:43,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:32:43,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:43,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:32:43,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:32:43,737 INFO L87 Difference]: Start difference. First operand 123 states and 181 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:32:45,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:45,064 INFO L93 Difference]: Finished difference Result 725 states and 1076 transitions. [2024-11-09 01:32:45,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 01:32:45,065 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-09 01:32:45,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:45,073 INFO L225 Difference]: With dead ends: 725 [2024-11-09 01:32:45,073 INFO L226 Difference]: Without dead ends: 605 [2024-11-09 01:32:45,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:32:45,079 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 700 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:45,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 2275 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 01:32:45,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-09 01:32:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 382. [2024-11-09 01:32:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 331 states have (on average 1.4501510574018126) internal successors, (480), 332 states have internal predecessors, (480), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-09 01:32:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 574 transitions. [2024-11-09 01:32:45,143 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 574 transitions. Word has length 151 [2024-11-09 01:32:45,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:45,145 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 574 transitions. [2024-11-09 01:32:45,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:32:45,146 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 574 transitions. [2024-11-09 01:32:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 01:32:45,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:45,152 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:45,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:32:45,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:45,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:45,155 INFO L85 PathProgramCache]: Analyzing trace with hash 439138535, now seen corresponding path program 1 times [2024-11-09 01:32:45,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:45,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423708713] [2024-11-09 01:32:45,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:45,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:32:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:32:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:32:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:32:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:32:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:32:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:32:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:32:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:32:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:32:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:32:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,315 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:32:45,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:45,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423708713] [2024-11-09 01:32:45,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423708713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:45,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:45,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:32:45,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633256219] [2024-11-09 01:32:45,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:45,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:32:45,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:45,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:32:45,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:32:45,318 INFO L87 Difference]: Start difference. First operand 382 states and 574 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:32:45,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:45,349 INFO L93 Difference]: Finished difference Result 758 states and 1141 transitions. [2024-11-09 01:32:45,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:32:45,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-09 01:32:45,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:45,356 INFO L225 Difference]: With dead ends: 758 [2024-11-09 01:32:45,357 INFO L226 Difference]: Without dead ends: 379 [2024-11-09 01:32:45,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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:32:45,362 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:45,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:32:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-09 01:32:45,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-11-09 01:32:45,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 328 states have (on average 1.4451219512195121) internal successors, (474), 329 states have internal predecessors, (474), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-09 01:32:45,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 568 transitions. [2024-11-09 01:32:45,389 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 568 transitions. Word has length 152 [2024-11-09 01:32:45,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:45,390 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 568 transitions. [2024-11-09 01:32:45,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:32:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 568 transitions. [2024-11-09 01:32:45,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 01:32:45,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:45,394 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:45,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:32:45,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:45,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:45,396 INFO L85 PathProgramCache]: Analyzing trace with hash -234426631, now seen corresponding path program 1 times [2024-11-09 01:32:45,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:45,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37834620] [2024-11-09 01:32:45,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:45,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:32:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:32:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:32:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:32:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:32:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:32:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:32:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:32:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:32:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:32:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:32:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:32:45,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:45,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37834620] [2024-11-09 01:32:45,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37834620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:45,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:45,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:32:45,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697980154] [2024-11-09 01:32:45,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:45,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:32:45,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:45,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:32:45,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:32:45,552 INFO L87 Difference]: Start difference. First operand 379 states and 568 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:32:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:45,591 INFO L93 Difference]: Finished difference Result 760 states and 1143 transitions. [2024-11-09 01:32:45,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:32:45,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-09 01:32:45,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:45,598 INFO L225 Difference]: With dead ends: 760 [2024-11-09 01:32:45,598 INFO L226 Difference]: Without dead ends: 384 [2024-11-09 01:32:45,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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:32:45,600 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:45,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:32:45,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-09 01:32:45,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-11-09 01:32:45,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 333 states have (on average 1.4384384384384385) internal successors, (479), 334 states have internal predecessors, (479), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-09 01:32:45,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 573 transitions. [2024-11-09 01:32:45,640 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 573 transitions. Word has length 152 [2024-11-09 01:32:45,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:45,640 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 573 transitions. [2024-11-09 01:32:45,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:32:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 573 transitions. [2024-11-09 01:32:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 01:32:45,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:45,643 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:45,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:32:45,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:45,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:45,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1910188739, now seen corresponding path program 1 times [2024-11-09 01:32:45,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:45,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141233222] [2024-11-09 01:32:45,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:45,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:32:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:32:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:32:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:32:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:32:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:32:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:32:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:32:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:32:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:32:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:32:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:32:45,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:45,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141233222] [2024-11-09 01:32:45,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141233222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:45,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:45,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:32:45,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816643180] [2024-11-09 01:32:45,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:45,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:32:45,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:45,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:32:45,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:32:45,773 INFO L87 Difference]: Start difference. First operand 384 states and 573 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:32:45,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:45,808 INFO L93 Difference]: Finished difference Result 760 states and 1135 transitions. [2024-11-09 01:32:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:32:45,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-09 01:32:45,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:45,814 INFO L225 Difference]: With dead ends: 760 [2024-11-09 01:32:45,814 INFO L226 Difference]: Without dead ends: 379 [2024-11-09 01:32:45,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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:32:45,816 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:45,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:32:45,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-09 01:32:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-11-09 01:32:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 328 states have (on average 1.4298780487804879) internal successors, (469), 329 states have internal predecessors, (469), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-09 01:32:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 563 transitions. [2024-11-09 01:32:45,838 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 563 transitions. Word has length 152 [2024-11-09 01:32:45,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:45,839 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 563 transitions. [2024-11-09 01:32:45,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:32:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 563 transitions. [2024-11-09 01:32:45,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 01:32:45,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:45,842 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:45,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:32:45,842 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:45,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:45,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2133860781, now seen corresponding path program 1 times [2024-11-09 01:32:45,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:45,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522282891] [2024-11-09 01:32:45,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:45,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:32:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:32:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:32:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:32:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:32:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:32:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:32:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:32:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:32:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:32:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:32:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:32:46,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:46,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522282891] [2024-11-09 01:32:46,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522282891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:46,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:46,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:32:46,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747507827] [2024-11-09 01:32:46,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:46,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:32:46,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:46,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:32:46,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:32:46,097 INFO L87 Difference]: Start difference. First operand 379 states and 563 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:32:46,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:46,135 INFO L93 Difference]: Finished difference Result 764 states and 1135 transitions. [2024-11-09 01:32:46,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:32:46,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-09 01:32:46,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:46,138 INFO L225 Difference]: With dead ends: 764 [2024-11-09 01:32:46,140 INFO L226 Difference]: Without dead ends: 388 [2024-11-09 01:32:46,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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:32:46,142 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 691 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:32:46,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 691 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:32:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-09 01:32:46,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-11-09 01:32:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 337 states have (on average 1.4183976261127595) internal successors, (478), 338 states have internal predecessors, (478), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-09 01:32:46,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 572 transitions. [2024-11-09 01:32:46,162 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 572 transitions. Word has length 153 [2024-11-09 01:32:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:46,165 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 572 transitions. [2024-11-09 01:32:46,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:32:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 572 transitions. [2024-11-09 01:32:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 01:32:46,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:46,167 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:46,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:32:46,167 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:46,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:46,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1297495016, now seen corresponding path program 1 times [2024-11-09 01:32:46,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:46,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856002965] [2024-11-09 01:32:46,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:46,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:32:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:32:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:32:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:32:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:32:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:32:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:32:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:32:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:32:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:32:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:32:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:32:47,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:47,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856002965] [2024-11-09 01:32:47,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856002965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:47,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:47,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:32:47,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605745903] [2024-11-09 01:32:47,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:47,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:32:47,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:47,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:32:47,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:32:47,878 INFO L87 Difference]: Start difference. First operand 388 states and 572 transitions. Second operand has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-09 01:32:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:48,477 INFO L93 Difference]: Finished difference Result 986 states and 1455 transitions. [2024-11-09 01:32:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:32:48,477 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) Word has length 153 [2024-11-09 01:32:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:48,481 INFO L225 Difference]: With dead ends: 986 [2024-11-09 01:32:48,481 INFO L226 Difference]: Without dead ends: 601 [2024-11-09 01:32:48,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:32:48,482 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 120 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:48,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1116 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:32:48,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-09 01:32:48,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 527. [2024-11-09 01:32:48,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 466 states have (on average 1.4356223175965666) internal successors, (669), 468 states have internal predecessors, (669), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-09 01:32:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 781 transitions. [2024-11-09 01:32:48,511 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 781 transitions. Word has length 153 [2024-11-09 01:32:48,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:48,511 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 781 transitions. [2024-11-09 01:32:48,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-09 01:32:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 781 transitions. [2024-11-09 01:32:48,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 01:32:48,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:48,514 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:48,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:32:48,514 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:48,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash 17631338, now seen corresponding path program 1 times [2024-11-09 01:32:48,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:48,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97166609] [2024-11-09 01:32:48,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:48,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:32:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:32:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:32:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:32:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:32:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:32:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:32:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:32:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:32:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:32:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:32:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:32:50,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:50,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97166609] [2024-11-09 01:32:50,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97166609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:50,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:50,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:32:50,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444786328] [2024-11-09 01:32:50,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:50,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:32:50,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:32:50,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:32:50,474 INFO L87 Difference]: Start difference. First operand 527 states and 781 transitions. Second operand has 12 states, 8 states have (on average 7.625) internal successors, (61), 12 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-09 01:32:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:51,265 INFO L93 Difference]: Finished difference Result 1125 states and 1661 transitions. [2024-11-09 01:32:51,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:32:51,266 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 7.625) internal successors, (61), 12 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) Word has length 153 [2024-11-09 01:32:51,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:51,270 INFO L225 Difference]: With dead ends: 1125 [2024-11-09 01:32:51,270 INFO L226 Difference]: Without dead ends: 601 [2024-11-09 01:32:51,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:32:51,273 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 118 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:51,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1219 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:32:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-09 01:32:51,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 529. [2024-11-09 01:32:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 468 states have (on average 1.4337606837606838) internal successors, (671), 470 states have internal predecessors, (671), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-09 01:32:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 783 transitions. [2024-11-09 01:32:51,311 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 783 transitions. Word has length 153 [2024-11-09 01:32:51,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:51,311 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 783 transitions. [2024-11-09 01:32:51,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 8 states have (on average 7.625) internal successors, (61), 12 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-09 01:32:51,312 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 783 transitions. [2024-11-09 01:32:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 01:32:51,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:51,314 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:51,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:32:51,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:51,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:51,315 INFO L85 PathProgramCache]: Analyzing trace with hash -569174676, now seen corresponding path program 1 times [2024-11-09 01:32:51,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:51,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441655290] [2024-11-09 01:32:51,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:51,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:32:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:32:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:32:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:32:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:32:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:32:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:32:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:32:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:32:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:32:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:32:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:32:52,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:52,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441655290] [2024-11-09 01:32:52,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441655290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:52,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:52,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:32:52,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764523627] [2024-11-09 01:32:52,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:52,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:32:52,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:52,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:32:52,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:32:52,515 INFO L87 Difference]: Start difference. First operand 529 states and 783 transitions. Second operand has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 01:32:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:53,003 INFO L93 Difference]: Finished difference Result 1122 states and 1656 transitions. [2024-11-09 01:32:53,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:32:53,004 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2024-11-09 01:32:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:53,007 INFO L225 Difference]: With dead ends: 1122 [2024-11-09 01:32:53,007 INFO L226 Difference]: Without dead ends: 596 [2024-11-09 01:32:53,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:32:53,009 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 115 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:53,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 944 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:32:53,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-09 01:32:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 523. [2024-11-09 01:32:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 462 states have (on average 1.432900432900433) internal successors, (662), 464 states have internal predecessors, (662), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-09 01:32:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 774 transitions. [2024-11-09 01:32:53,047 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 774 transitions. Word has length 153 [2024-11-09 01:32:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:53,048 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 774 transitions. [2024-11-09 01:32:53,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 01:32:53,048 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 774 transitions. [2024-11-09 01:32:53,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 01:32:53,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:53,050 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:53,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:32:53,050 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:53,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:53,051 INFO L85 PathProgramCache]: Analyzing trace with hash 561773252, now seen corresponding path program 1 times [2024-11-09 01:32:53,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:53,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124254434] [2024-11-09 01:32:53,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:53,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:32:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:32:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:32:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:32:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:32:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:32:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:32:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:32:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:32:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:32:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:32:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:32:53,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:53,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124254434] [2024-11-09 01:32:53,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124254434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:53,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:53,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:32:53,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036465422] [2024-11-09 01:32:53,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:53,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:32:53,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:53,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:32:53,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:32:53,223 INFO L87 Difference]: Start difference. First operand 523 states and 774 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:32:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:53,316 INFO L93 Difference]: Finished difference Result 1080 states and 1599 transitions. [2024-11-09 01:32:53,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:32:53,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-09 01:32:53,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:53,320 INFO L225 Difference]: With dead ends: 1080 [2024-11-09 01:32:53,320 INFO L226 Difference]: Without dead ends: 560 [2024-11-09 01:32:53,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:32:53,322 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 78 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:53,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 642 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:32:53,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-09 01:32:53,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 520. [2024-11-09 01:32:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 459 states have (on average 1.4226579520697167) internal successors, (653), 461 states have internal predecessors, (653), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-09 01:32:53,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 765 transitions. [2024-11-09 01:32:53,353 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 765 transitions. Word has length 153 [2024-11-09 01:32:53,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:53,353 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 765 transitions. [2024-11-09 01:32:53,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:32:53,354 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 765 transitions. [2024-11-09 01:32:53,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 01:32:53,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:53,355 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:53,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:32:53,356 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:53,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:53,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1542718732, now seen corresponding path program 1 times [2024-11-09 01:32:53,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:53,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175151282] [2024-11-09 01:32:53,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:53,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:32:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:32:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:32:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:32:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:32:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:32:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:32:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:32:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:32:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:32:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:32:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:32:54,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:54,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175151282] [2024-11-09 01:32:54,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175151282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:54,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:54,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:32:54,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652245092] [2024-11-09 01:32:54,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:54,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:32:54,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:54,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:32:54,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:32:54,536 INFO L87 Difference]: Start difference. First operand 520 states and 765 transitions. Second operand has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-09 01:32:55,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:55,129 INFO L93 Difference]: Finished difference Result 1213 states and 1782 transitions. [2024-11-09 01:32:55,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:32:55,129 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2024-11-09 01:32:55,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:55,133 INFO L225 Difference]: With dead ends: 1213 [2024-11-09 01:32:55,133 INFO L226 Difference]: Without dead ends: 696 [2024-11-09 01:32:55,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:32:55,135 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 110 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:55,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1677 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:32:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-11-09 01:32:55,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 569. [2024-11-09 01:32:55,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 508 states have (on average 1.4330708661417322) internal successors, (728), 510 states have internal predecessors, (728), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-09 01:32:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 840 transitions. [2024-11-09 01:32:55,172 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 840 transitions. Word has length 153 [2024-11-09 01:32:55,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:55,172 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 840 transitions. [2024-11-09 01:32:55,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-09 01:32:55,173 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 840 transitions. [2024-11-09 01:32:55,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 01:32:55,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:55,175 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:55,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:32:55,175 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:55,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:55,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2129524746, now seen corresponding path program 1 times [2024-11-09 01:32:55,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:55,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175567502] [2024-11-09 01:32:55,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:55,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:32:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:32:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:32:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:32:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:32:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:32:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:32:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:32:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:32:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:32:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:32:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:32:56,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:56,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175567502] [2024-11-09 01:32:56,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175567502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:56,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:56,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:32:56,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574709594] [2024-11-09 01:32:56,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:56,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:32:56,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:56,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:32:56,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:32:56,569 INFO L87 Difference]: Start difference. First operand 569 states and 840 transitions. Second operand has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-09 01:32:57,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:57,359 INFO L93 Difference]: Finished difference Result 1262 states and 1855 transitions. [2024-11-09 01:32:57,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:32:57,360 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) Word has length 153 [2024-11-09 01:32:57,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:57,364 INFO L225 Difference]: With dead ends: 1262 [2024-11-09 01:32:57,364 INFO L226 Difference]: Without dead ends: 696 [2024-11-09 01:32:57,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:32:57,367 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 108 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:57,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 2080 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:32:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-11-09 01:32:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 568. [2024-11-09 01:32:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 507 states have (on average 1.4319526627218935) internal successors, (726), 509 states have internal predecessors, (726), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-09 01:32:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 838 transitions. [2024-11-09 01:32:57,416 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 838 transitions. Word has length 153 [2024-11-09 01:32:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:57,417 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 838 transitions. [2024-11-09 01:32:57,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 8.714285714285714) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-09 01:32:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 838 transitions. [2024-11-09 01:32:57,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 01:32:57,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:57,419 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:57,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:32:57,420 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:57,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:57,420 INFO L85 PathProgramCache]: Analyzing trace with hash 788021926, now seen corresponding path program 1 times [2024-11-09 01:32:57,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:57,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638494035] [2024-11-09 01:32:57,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:57,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:32:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:32:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:32:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:32:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:32:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:32:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:32:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:32:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:32:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:32:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:32:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:32:58,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:58,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638494035] [2024-11-09 01:32:58,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638494035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:58,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:58,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:32:58,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545365541] [2024-11-09 01:32:58,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:58,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:32:58,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:58,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:32:58,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:32:58,250 INFO L87 Difference]: Start difference. First operand 568 states and 838 transitions. Second operand has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 01:32:58,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:58,633 INFO L93 Difference]: Finished difference Result 1287 states and 1887 transitions. [2024-11-09 01:32:58,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:32:58,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2024-11-09 01:32:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:58,637 INFO L225 Difference]: With dead ends: 1287 [2024-11-09 01:32:58,637 INFO L226 Difference]: Without dead ends: 722 [2024-11-09 01:32:58,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:32:58,639 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 122 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:58,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1207 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:32:58,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2024-11-09 01:32:58,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 718. [2024-11-09 01:32:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 628 states have (on average 1.4028662420382165) internal successors, (881), 632 states have internal predecessors, (881), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-09 01:32:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1045 transitions. [2024-11-09 01:32:58,688 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1045 transitions. Word has length 153 [2024-11-09 01:32:58,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:58,688 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1045 transitions. [2024-11-09 01:32:58,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 01:32:58,689 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1045 transitions. [2024-11-09 01:32:58,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 01:32:58,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:58,691 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:58,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:32:58,691 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:58,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:58,691 INFO L85 PathProgramCache]: Analyzing trace with hash -491841752, now seen corresponding path program 1 times [2024-11-09 01:32:58,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:58,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991595829] [2024-11-09 01:32:58,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:58,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:32:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:32:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:32:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:32:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:32:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:32:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:32:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:32:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:32:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:32:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:32:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,292 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:32:59,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:59,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991595829] [2024-11-09 01:32:59,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991595829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:59,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:59,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:32:59,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079561655] [2024-11-09 01:32:59,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:59,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:32:59,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:59,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:32:59,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:32:59,294 INFO L87 Difference]: Start difference. First operand 718 states and 1045 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 01:32:59,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:59,592 INFO L93 Difference]: Finished difference Result 1714 states and 2481 transitions. [2024-11-09 01:32:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:32:59,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-11-09 01:32:59,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:59,599 INFO L225 Difference]: With dead ends: 1714 [2024-11-09 01:32:59,599 INFO L226 Difference]: Without dead ends: 999 [2024-11-09 01:32:59,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:32:59,603 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 98 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:59,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 943 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:32:59,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2024-11-09 01:32:59,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 924. [2024-11-09 01:32:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 800 states have (on average 1.37875) internal successors, (1103), 807 states have internal predecessors, (1103), 113 states have call successors, (113), 10 states have call predecessors, (113), 10 states have return successors, (113), 106 states have call predecessors, (113), 113 states have call successors, (113) [2024-11-09 01:32:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1329 transitions. [2024-11-09 01:32:59,683 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1329 transitions. Word has length 153 [2024-11-09 01:32:59,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:59,684 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1329 transitions. [2024-11-09 01:32:59,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 01:32:59,685 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1329 transitions. [2024-11-09 01:32:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 01:32:59,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:59,687 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:59,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 01:32:59,687 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:59,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:59,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1078647766, now seen corresponding path program 1 times [2024-11-09 01:32:59,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:59,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811744472] [2024-11-09 01:32:59,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:59,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:33:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:33:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:33:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:33:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:33:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:33:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:33:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:33:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:33:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:33:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:33:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:33:00,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:00,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811744472] [2024-11-09 01:33:00,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811744472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:00,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:00,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:33:00,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913256669] [2024-11-09 01:33:00,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:00,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:33:00,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:00,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:33:00,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:33:00,789 INFO L87 Difference]: Start difference. First operand 924 states and 1329 transitions. Second operand has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-09 01:33:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:01,427 INFO L93 Difference]: Finished difference Result 2016 states and 2896 transitions. [2024-11-09 01:33:01,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:33:01,428 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2024-11-09 01:33:01,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:01,433 INFO L225 Difference]: With dead ends: 2016 [2024-11-09 01:33:01,433 INFO L226 Difference]: Without dead ends: 1095 [2024-11-09 01:33:01,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:33:01,436 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 105 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:01,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1554 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:33:01,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2024-11-09 01:33:01,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 940. [2024-11-09 01:33:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 816 states have (on average 1.3811274509803921) internal successors, (1127), 823 states have internal predecessors, (1127), 113 states have call successors, (113), 10 states have call predecessors, (113), 10 states have return successors, (113), 106 states have call predecessors, (113), 113 states have call successors, (113) [2024-11-09 01:33:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1353 transitions. [2024-11-09 01:33:01,512 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1353 transitions. Word has length 153 [2024-11-09 01:33:01,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:01,513 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1353 transitions. [2024-11-09 01:33:01,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-09 01:33:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1353 transitions. [2024-11-09 01:33:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 01:33:01,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:01,515 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 01:33:01,515 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:01,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:01,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1655969460, now seen corresponding path program 1 times [2024-11-09 01:33:01,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:01,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666426168] [2024-11-09 01:33:01,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:01,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:33:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:33:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:33:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:33:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:33:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:33:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:33:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:33:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:33:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:33:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:33:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,268 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:33:02,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:02,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666426168] [2024-11-09 01:33:02,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666426168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:02,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:02,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:33:02,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115127702] [2024-11-09 01:33:02,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:02,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:33:02,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:02,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:33:02,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:33:02,271 INFO L87 Difference]: Start difference. First operand 940 states and 1353 transitions. Second operand has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 01:33:03,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:03,233 INFO L93 Difference]: Finished difference Result 2124 states and 3054 transitions. [2024-11-09 01:33:03,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:33:03,233 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-11-09 01:33:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:03,239 INFO L225 Difference]: With dead ends: 2124 [2024-11-09 01:33:03,239 INFO L226 Difference]: Without dead ends: 1187 [2024-11-09 01:33:03,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:33:03,242 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 442 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:03,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1414 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:33:03,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2024-11-09 01:33:03,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 940. [2024-11-09 01:33:03,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 816 states have (on average 1.3799019607843137) internal successors, (1126), 823 states have internal predecessors, (1126), 113 states have call successors, (113), 10 states have call predecessors, (113), 10 states have return successors, (113), 106 states have call predecessors, (113), 113 states have call successors, (113) [2024-11-09 01:33:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1352 transitions. [2024-11-09 01:33:03,305 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1352 transitions. Word has length 153 [2024-11-09 01:33:03,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:03,306 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1352 transitions. [2024-11-09 01:33:03,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 01:33:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1352 transitions. [2024-11-09 01:33:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 01:33:03,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:03,308 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 01:33:03,308 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:03,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:03,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1718009074, now seen corresponding path program 1 times [2024-11-09 01:33:03,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:03,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107149585] [2024-11-09 01:33:03,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:03,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:33:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:33:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:33:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:33:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:33:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:33:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:33:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:33:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:33:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:33:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:33:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:33:04,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:04,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107149585] [2024-11-09 01:33:04,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107149585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:04,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:04,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:33:04,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875440819] [2024-11-09 01:33:04,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:04,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:33:04,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:04,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:33:04,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:33:04,263 INFO L87 Difference]: Start difference. First operand 940 states and 1352 transitions. Second operand has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 01:33:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:04,988 INFO L93 Difference]: Finished difference Result 2001 states and 2874 transitions. [2024-11-09 01:33:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:33:04,989 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2024-11-09 01:33:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:04,995 INFO L225 Difference]: With dead ends: 2001 [2024-11-09 01:33:04,996 INFO L226 Difference]: Without dead ends: 1064 [2024-11-09 01:33:04,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:33:04,999 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 106 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:04,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1688 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:33:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2024-11-09 01:33:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 940. [2024-11-09 01:33:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 816 states have (on average 1.3786764705882353) internal successors, (1125), 823 states have internal predecessors, (1125), 113 states have call successors, (113), 10 states have call predecessors, (113), 10 states have return successors, (113), 106 states have call predecessors, (113), 113 states have call successors, (113) [2024-11-09 01:33:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1351 transitions. [2024-11-09 01:33:05,076 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1351 transitions. Word has length 153 [2024-11-09 01:33:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:05,076 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1351 transitions. [2024-11-09 01:33:05,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 01:33:05,077 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1351 transitions. [2024-11-09 01:33:05,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 01:33:05,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:05,079 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 01:33:05,079 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:05,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:05,080 INFO L85 PathProgramCache]: Analyzing trace with hash 412170648, now seen corresponding path program 1 times [2024-11-09 01:33:05,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:05,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733309434] [2024-11-09 01:33:05,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:05,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:33:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:33:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:33:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:33:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:33:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:33:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:33:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:33:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:33:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:33:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:33:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:33:05,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:05,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733309434] [2024-11-09 01:33:05,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733309434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:05,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:05,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:33:05,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831244086] [2024-11-09 01:33:05,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:05,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:05,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:05,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:05,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:33:05,222 INFO L87 Difference]: Start difference. First operand 940 states and 1351 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:33:05,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:05,343 INFO L93 Difference]: Finished difference Result 1877 states and 2698 transitions. [2024-11-09 01:33:05,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:33:05,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-09 01:33:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:05,349 INFO L225 Difference]: With dead ends: 1877 [2024-11-09 01:33:05,350 INFO L226 Difference]: Without dead ends: 940 [2024-11-09 01:33:05,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:05,352 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 81 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:05,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 786 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2024-11-09 01:33:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 938. [2024-11-09 01:33:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 814 states have (on average 1.3771498771498771) internal successors, (1121), 821 states have internal predecessors, (1121), 113 states have call successors, (113), 10 states have call predecessors, (113), 10 states have return successors, (113), 106 states have call predecessors, (113), 113 states have call successors, (113) [2024-11-09 01:33:05,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1347 transitions. [2024-11-09 01:33:05,422 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1347 transitions. Word has length 153 [2024-11-09 01:33:05,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:05,423 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1347 transitions. [2024-11-09 01:33:05,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:33:05,423 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1347 transitions. [2024-11-09 01:33:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-09 01:33:05,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:05,425 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 01:33:05,425 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:05,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:05,426 INFO L85 PathProgramCache]: Analyzing trace with hash 254682777, now seen corresponding path program 1 times [2024-11-09 01:33:05,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:05,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566576893] [2024-11-09 01:33:05,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:05,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:33:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:33:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:33:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:33:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:33:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:33:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:33:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:33:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:33:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:33:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:33:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:33:05,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:05,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566576893] [2024-11-09 01:33:05,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566576893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:05,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:05,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:33:05,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804977960] [2024-11-09 01:33:05,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:05,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:33:05,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:05,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:33:05,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:33:05,524 INFO L87 Difference]: Start difference. First operand 938 states and 1347 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:33:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:05,596 INFO L93 Difference]: Finished difference Result 1745 states and 2503 transitions. [2024-11-09 01:33:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:33:05,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2024-11-09 01:33:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:05,602 INFO L225 Difference]: With dead ends: 1745 [2024-11-09 01:33:05,602 INFO L226 Difference]: Without dead ends: 810 [2024-11-09 01:33:05,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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:33:05,605 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:05,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:05,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2024-11-09 01:33:05,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 731. [2024-11-09 01:33:05,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 640 states have (on average 1.384375) internal successors, (886), 644 states have internal predecessors, (886), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-09 01:33:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1050 transitions. [2024-11-09 01:33:05,657 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1050 transitions. Word has length 154 [2024-11-09 01:33:05,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:05,658 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1050 transitions. [2024-11-09 01:33:05,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:33:05,658 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1050 transitions. [2024-11-09 01:33:05,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 01:33:05,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:05,660 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 01:33:05,661 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:05,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:05,661 INFO L85 PathProgramCache]: Analyzing trace with hash -301787730, now seen corresponding path program 1 times [2024-11-09 01:33:05,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:05,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384564144] [2024-11-09 01:33:05,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:05,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:33:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:33:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:33:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:33:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:33:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:33:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:33:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:33:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:33:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:33:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:33:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:33:06,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:06,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384564144] [2024-11-09 01:33:06,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384564144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:06,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:06,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 01:33:06,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049972465] [2024-11-09 01:33:06,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:06,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 01:33:06,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:06,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 01:33:06,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:33:06,913 INFO L87 Difference]: Start difference. First operand 731 states and 1050 transitions. Second operand has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 01:33:08,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:08,902 INFO L93 Difference]: Finished difference Result 2185 states and 3121 transitions. [2024-11-09 01:33:08,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-09 01:33:08,903 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-09 01:33:08,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:08,909 INFO L225 Difference]: With dead ends: 2185 [2024-11-09 01:33:08,909 INFO L226 Difference]: Without dead ends: 1457 [2024-11-09 01:33:08,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=342, Invalid=2010, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 01:33:08,912 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 1647 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1647 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 1825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:08,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1647 Valid, 2369 Invalid, 1825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 01:33:08,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2024-11-09 01:33:09,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1207. [2024-11-09 01:33:09,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1043 states have (on average 1.3633748801534036) internal successors, (1422), 1052 states have internal predecessors, (1422), 147 states have call successors, (147), 16 states have call predecessors, (147), 16 states have return successors, (147), 138 states have call predecessors, (147), 147 states have call successors, (147) [2024-11-09 01:33:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1716 transitions. [2024-11-09 01:33:09,011 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1716 transitions. Word has length 155 [2024-11-09 01:33:09,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:09,012 INFO L471 AbstractCegarLoop]: Abstraction has 1207 states and 1716 transitions. [2024-11-09 01:33:09,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 01:33:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1716 transitions. [2024-11-09 01:33:09,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 01:33:09,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:09,014 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 01:33:09,014 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:09,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:09,014 INFO L85 PathProgramCache]: Analyzing trace with hash -239748116, now seen corresponding path program 1 times [2024-11-09 01:33:09,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:09,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831209829] [2024-11-09 01:33:09,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:09,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:33:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:33:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:33:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:33:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:33:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:33:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:33:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:33:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:33:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:33:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:33:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:09,592 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:33:09,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:09,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831209829] [2024-11-09 01:33:09,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831209829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:09,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:09,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:09,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783796810] [2024-11-09 01:33:09,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:09,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:33:09,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:09,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:33:09,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:09,594 INFO L87 Difference]: Start difference. First operand 1207 states and 1716 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 01:33:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:09,929 INFO L93 Difference]: Finished difference Result 2462 states and 3486 transitions. [2024-11-09 01:33:09,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:33:09,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-09 01:33:09,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:09,936 INFO L225 Difference]: With dead ends: 2462 [2024-11-09 01:33:09,936 INFO L226 Difference]: Without dead ends: 1258 [2024-11-09 01:33:09,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:33:09,940 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 112 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:09,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1119 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:33:09,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2024-11-09 01:33:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1255. [2024-11-09 01:33:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1073 states have (on average 1.348555452003728) internal successors, (1447), 1083 states have internal predecessors, (1447), 158 states have call successors, (158), 23 states have call predecessors, (158), 23 states have return successors, (158), 148 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-09 01:33:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1763 transitions. [2024-11-09 01:33:10,052 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1763 transitions. Word has length 155 [2024-11-09 01:33:10,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:10,052 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1763 transitions. [2024-11-09 01:33:10,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 01:33:10,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1763 transitions. [2024-11-09 01:33:10,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 01:33:10,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:10,054 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 01:33:10,054 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:10,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:10,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1412848974, now seen corresponding path program 1 times [2024-11-09 01:33:10,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:10,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971901066] [2024-11-09 01:33:10,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:10,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:33:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:33:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:33:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:33:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:33:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:33:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:33:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:33:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:33:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:33:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:33:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:33:11,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:11,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971901066] [2024-11-09 01:33:11,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971901066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:11,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:11,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 01:33:11,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483965979] [2024-11-09 01:33:11,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:11,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 01:33:11,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:11,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 01:33:11,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:33:11,099 INFO L87 Difference]: Start difference. First operand 1255 states and 1763 transitions. Second operand has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 01:33:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:12,064 INFO L93 Difference]: Finished difference Result 3078 states and 4303 transitions. [2024-11-09 01:33:12,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 01:33:12,065 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2024-11-09 01:33:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:12,073 INFO L225 Difference]: With dead ends: 3078 [2024-11-09 01:33:12,073 INFO L226 Difference]: Without dead ends: 1858 [2024-11-09 01:33:12,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2024-11-09 01:33:12,076 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 132 mSDsluCounter, 2725 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 2993 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:12,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 2993 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:33:12,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2024-11-09 01:33:12,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1854. [2024-11-09 01:33:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1572 states have (on average 1.3346055979643765) internal successors, (2098), 1588 states have internal predecessors, (2098), 242 states have call successors, (242), 39 states have call predecessors, (242), 39 states have return successors, (242), 226 states have call predecessors, (242), 242 states have call successors, (242) [2024-11-09 01:33:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2582 transitions. [2024-11-09 01:33:12,263 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2582 transitions. Word has length 155 [2024-11-09 01:33:12,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:12,263 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2582 transitions. [2024-11-09 01:33:12,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 01:33:12,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2582 transitions. [2024-11-09 01:33:12,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 01:33:12,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:12,265 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 01:33:12,266 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:12,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:12,266 INFO L85 PathProgramCache]: Analyzing trace with hash 826042960, now seen corresponding path program 1 times [2024-11-09 01:33:12,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:12,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129698411] [2024-11-09 01:33:12,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:12,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:33:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:33:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:33:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:33:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:33:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:33:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:33:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:33:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:33:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:33:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:33:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:12,527 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:33:12,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:12,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129698411] [2024-11-09 01:33:12,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129698411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:12,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:12,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:33:12,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265192457] [2024-11-09 01:33:12,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:12,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:12,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:12,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:12,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:33:12,530 INFO L87 Difference]: Start difference. First operand 1854 states and 2582 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:33:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:12,872 INFO L93 Difference]: Finished difference Result 3730 states and 5172 transitions. [2024-11-09 01:33:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:33:12,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-09 01:33:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:12,881 INFO L225 Difference]: With dead ends: 3730 [2024-11-09 01:33:12,881 INFO L226 Difference]: Without dead ends: 1911 [2024-11-09 01:33:12,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:12,885 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 100 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:12,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 592 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:12,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2024-11-09 01:33:13,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1348. [2024-11-09 01:33:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1161 states have (on average 1.3505598621877692) internal successors, (1568), 1170 states have internal predecessors, (1568), 159 states have call successors, (159), 27 states have call predecessors, (159), 27 states have return successors, (159), 150 states have call predecessors, (159), 159 states have call successors, (159) [2024-11-09 01:33:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1886 transitions. [2024-11-09 01:33:13,021 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1886 transitions. Word has length 155 [2024-11-09 01:33:13,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:13,024 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 1886 transitions. [2024-11-09 01:33:13,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 01:33:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1886 transitions. [2024-11-09 01:33:13,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 01:33:13,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:13,026 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 01:33:13,027 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:13,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:13,027 INFO L85 PathProgramCache]: Analyzing trace with hash -453820718, now seen corresponding path program 1 times [2024-11-09 01:33:13,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:13,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774949678] [2024-11-09 01:33:13,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:13,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:33:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:33:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:33:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:33:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:33:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:33:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:33:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:33:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:33:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:33:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:33:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,858 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:33:14,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:14,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774949678] [2024-11-09 01:33:14,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774949678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:14,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:14,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 01:33:14,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157078889] [2024-11-09 01:33:14,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:14,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 01:33:14,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:14,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 01:33:14,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:33:14,860 INFO L87 Difference]: Start difference. First operand 1348 states and 1886 transitions. Second operand has 15 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 15 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-09 01:33:16,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:16,483 INFO L93 Difference]: Finished difference Result 3018 states and 4216 transitions. [2024-11-09 01:33:16,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 01:33:16,484 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 15 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) Word has length 155 [2024-11-09 01:33:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:16,495 INFO L225 Difference]: With dead ends: 3018 [2024-11-09 01:33:16,495 INFO L226 Difference]: Without dead ends: 1701 [2024-11-09 01:33:16,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2024-11-09 01:33:16,499 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 811 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 2673 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:16,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 2673 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 01:33:16,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2024-11-09 01:33:16,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1376. [2024-11-09 01:33:16,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1189 states have (on average 1.3549201009251473) internal successors, (1611), 1198 states have internal predecessors, (1611), 159 states have call successors, (159), 27 states have call predecessors, (159), 27 states have return successors, (159), 150 states have call predecessors, (159), 159 states have call successors, (159) [2024-11-09 01:33:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1929 transitions. [2024-11-09 01:33:16,643 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1929 transitions. Word has length 155 [2024-11-09 01:33:16,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:16,644 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 1929 transitions. [2024-11-09 01:33:16,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 15 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-09 01:33:16,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1929 transitions. [2024-11-09 01:33:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 01:33:16,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:16,649 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 01:33:16,650 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:16,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:16,650 INFO L85 PathProgramCache]: Analyzing trace with hash 903375884, now seen corresponding path program 1 times [2024-11-09 01:33:16,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:16,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785674789] [2024-11-09 01:33:16,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:16,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:33:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:33:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:33:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:33:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:33:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:33:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:33:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:33:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:33:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:33:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:33:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:17,103 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:33:17,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:17,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785674789] [2024-11-09 01:33:17,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785674789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:17,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:17,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:17,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107688748] [2024-11-09 01:33:17,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:17,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:33:17,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:17,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:33:17,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:17,105 INFO L87 Difference]: Start difference. First operand 1376 states and 1929 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 01:33:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:17,436 INFO L93 Difference]: Finished difference Result 2956 states and 4116 transitions. [2024-11-09 01:33:17,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:33:17,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-09 01:33:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:17,445 INFO L225 Difference]: With dead ends: 2956 [2024-11-09 01:33:17,445 INFO L226 Difference]: Without dead ends: 1615 [2024-11-09 01:33:17,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:33:17,448 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 133 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:17,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 682 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:33:17,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2024-11-09 01:33:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1294. [2024-11-09 01:33:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1107 states have (on average 1.3432700993676603) internal successors, (1487), 1116 states have internal predecessors, (1487), 159 states have call successors, (159), 27 states have call predecessors, (159), 27 states have return successors, (159), 150 states have call predecessors, (159), 159 states have call successors, (159) [2024-11-09 01:33:17,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1805 transitions. [2024-11-09 01:33:17,598 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1805 transitions. Word has length 155 [2024-11-09 01:33:17,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:17,598 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1805 transitions. [2024-11-09 01:33:17,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 01:33:17,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1805 transitions. [2024-11-09 01:33:17,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 01:33:17,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:17,601 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 01:33:17,601 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:17,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:17,602 INFO L85 PathProgramCache]: Analyzing trace with hash -940661554, now seen corresponding path program 1 times [2024-11-09 01:33:17,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:17,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000804463] [2024-11-09 01:33:17,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:17,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:33:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:33:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:33:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:33:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:33:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:33:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:33:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:33:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:33:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:33:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:33:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:18,608 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:33:18,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:18,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000804463] [2024-11-09 01:33:18,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000804463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:18,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:18,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 01:33:18,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5524193] [2024-11-09 01:33:18,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:18,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 01:33:18,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:18,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 01:33:18,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:33:18,610 INFO L87 Difference]: Start difference. First operand 1294 states and 1805 transitions. Second operand has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 01:33:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:19,509 INFO L93 Difference]: Finished difference Result 2785 states and 3872 transitions. [2024-11-09 01:33:19,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 01:33:19,510 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2024-11-09 01:33:19,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:19,517 INFO L225 Difference]: With dead ends: 2785 [2024-11-09 01:33:19,518 INFO L226 Difference]: Without dead ends: 1526 [2024-11-09 01:33:19,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2024-11-09 01:33:19,521 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 118 mSDsluCounter, 3007 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 3282 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:19,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 3282 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:33:19,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2024-11-09 01:33:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1294. [2024-11-09 01:33:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1107 states have (on average 1.3423667570009032) internal successors, (1486), 1116 states have internal predecessors, (1486), 159 states have call successors, (159), 27 states have call predecessors, (159), 27 states have return successors, (159), 150 states have call predecessors, (159), 159 states have call successors, (159) [2024-11-09 01:33:19,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1804 transitions. [2024-11-09 01:33:19,712 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1804 transitions. Word has length 155 [2024-11-09 01:33:19,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:19,712 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1804 transitions. [2024-11-09 01:33:19,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 01:33:19,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1804 transitions. [2024-11-09 01:33:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 01:33:19,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:19,715 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 01:33:19,715 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:19,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:19,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1869854258, now seen corresponding path program 1 times [2024-11-09 01:33:19,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:19,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119871362] [2024-11-09 01:33:19,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:19,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:33:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:33:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:33:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:33:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:33:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:33:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:33:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:33:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:33:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:33:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:33:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 01:33:27,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:27,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119871362] [2024-11-09 01:33:27,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119871362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:27,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:27,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-09 01:33:27,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292583851] [2024-11-09 01:33:27,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:27,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 01:33:27,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:27,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 01:33:27,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:33:27,131 INFO L87 Difference]: Start difference. First operand 1294 states and 1804 transitions. Second operand has 19 states, 16 states have (on average 3.9375) internal successors, (63), 19 states have internal predecessors, (63), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-09 01:33:29,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:33:34,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:33:36,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:33:39,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:33:41,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []