./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-58.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-ap_file-58.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 a41aa9d8768b1b5dd89ea1dccd189b98246dddc52870a67830fa0c3c6660983c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:43:24,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:43:24,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:43:24,809 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:43:24,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:43:24,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:43:24,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:43:24,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:43:24,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:43:24,844 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:43:24,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:43:24,845 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:43:24,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:43:24,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:43:24,848 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:43:24,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:43:24,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:43:24,849 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:43:24,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:43:24,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:43:24,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:43:24,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:43:24,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:43:24,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:43:24,852 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:43:24,852 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:43:24,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:43:24,853 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:43:24,853 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:43:24,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:43:24,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:43:24,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:43:24,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:43:24,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:43:24,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:43:24,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:43:24,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:43:24,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:43:24,857 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:43:24,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:43:24,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:43:24,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:43:24,859 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 -> a41aa9d8768b1b5dd89ea1dccd189b98246dddc52870a67830fa0c3c6660983c [2024-11-09 01:43:25,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:43:25,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:43:25,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:43:25,150 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:43:25,150 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:43:25,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-58.i [2024-11-09 01:43:26,583 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:43:26,803 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:43:26,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-58.i [2024-11-09 01:43:26,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25d39b0e/e2443d009cf54e25b8bde71abd9023fe/FLAG415bb749c [2024-11-09 01:43:26,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25d39b0e/e2443d009cf54e25b8bde71abd9023fe [2024-11-09 01:43:26,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:43:26,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:43:26,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:43:26,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:43:26,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:43:26,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:43:26" (1/1) ... [2024-11-09 01:43:26,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673c44f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:43:26, skipping insertion in model container [2024-11-09 01:43:26,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:43:26" (1/1) ... [2024-11-09 01:43:26,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:43:27,075 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-ap_file-58.i[917,930] [2024-11-09 01:43:27,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:43:27,160 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:43:27,171 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-ap_file-58.i[917,930] [2024-11-09 01:43:27,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:43:27,239 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:43:27,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:43:27 WrapperNode [2024-11-09 01:43:27,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:43:27,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:43:27,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:43:27,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:43:27,248 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:43:27" (1/1) ... [2024-11-09 01:43:27,270 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:43:27" (1/1) ... [2024-11-09 01:43:27,313 INFO L138 Inliner]: procedures = 26, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 455 [2024-11-09 01:43:27,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:43:27,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:43:27,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:43:27,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:43:27,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:43:27" (1/1) ... [2024-11-09 01:43:27,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:43:27" (1/1) ... [2024-11-09 01:43:27,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:43:27" (1/1) ... [2024-11-09 01:43:27,379 INFO L175 MemorySlicer]: Split 125 memory accesses to 6 slices as follows [2, 6, 11, 7, 74, 25]. 59 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 6, 2]. The 15 writes are split as follows [0, 1, 1, 3, 8, 2]. [2024-11-09 01:43:27,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:43:27" (1/1) ... [2024-11-09 01:43:27,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:43:27" (1/1) ... [2024-11-09 01:43:27,413 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:43:27" (1/1) ... [2024-11-09 01:43:27,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:43:27" (1/1) ... [2024-11-09 01:43:27,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:43:27" (1/1) ... [2024-11-09 01:43:27,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:43:27" (1/1) ... [2024-11-09 01:43:27,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:43:27,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:43:27,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:43:27,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:43:27,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:43:27" (1/1) ... [2024-11-09 01:43:27,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:43:27,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:43:27,472 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:43:27,479 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:43:27,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:43:27,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:43:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:43:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:43:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:43:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:43:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:43:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:43:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:43:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:43:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:43:27,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:43:27,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:43:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:43:27,528 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:43:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:43:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:43:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:43:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:43:27,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:43:27,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:43:27,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:43:27,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:43:27,678 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:43:27,681 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:43:28,191 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-11-09 01:43:28,191 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:43:28,204 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:43:28,205 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:43:28,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:43:28 BoogieIcfgContainer [2024-11-09 01:43:28,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:43:28,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:43:28,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:43:28,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:43:28,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:43:26" (1/3) ... [2024-11-09 01:43:28,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e37f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:43:28, skipping insertion in model container [2024-11-09 01:43:28,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:43:27" (2/3) ... [2024-11-09 01:43:28,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e37f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:43:28, skipping insertion in model container [2024-11-09 01:43:28,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:43:28" (3/3) ... [2024-11-09 01:43:28,214 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-58.i [2024-11-09 01:43:28,236 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:43:28,237 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:43:28,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:43:28,303 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;@550b5576, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:43:28,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:43:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 75 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:43:28,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:43:28,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:28,317 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:28,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:28,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:28,322 INFO L85 PathProgramCache]: Analyzing trace with hash 355485762, now seen corresponding path program 1 times [2024-11-09 01:43:28,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:28,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275928309] [2024-11-09 01:43:28,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:28,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:28,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:28,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:28,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:28,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:28,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:28,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:28,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:43:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:28,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:43:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:28,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:28,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:28,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:28,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:28,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:28,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:28,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:43:28,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:28,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275928309] [2024-11-09 01:43:28,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275928309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:28,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:28,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:43:28,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821083719] [2024-11-09 01:43:28,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:28,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:43:28,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:28,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:43:28,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:43:28,826 INFO L87 Difference]: Start difference. First operand has 92 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 75 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:43:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:28,867 INFO L93 Difference]: Finished difference Result 173 states and 269 transitions. [2024-11-09 01:43:28,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:43:28,870 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2024-11-09 01:43:28,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:28,885 INFO L225 Difference]: With dead ends: 173 [2024-11-09 01:43:28,885 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 01:43:28,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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:43:28,914 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:28,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:43:28,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 01:43:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 01:43:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:43:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2024-11-09 01:43:28,961 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 116 [2024-11-09 01:43:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:28,961 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2024-11-09 01:43:28,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:43:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2024-11-09 01:43:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:43:28,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:28,965 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:28,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:43:28,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:28,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:28,967 INFO L85 PathProgramCache]: Analyzing trace with hash -129349408, now seen corresponding path program 1 times [2024-11-09 01:43:28,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:28,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024530821] [2024-11-09 01:43:28,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:28,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:29,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:29,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:29,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:29,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:29,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:29,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:29,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:43:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:29,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:43:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:29,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:29,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:29,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:29,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:29,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:29,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:29,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:29,343 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:43:29,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:29,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024530821] [2024-11-09 01:43:29,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024530821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:29,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:29,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:43:29,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79615393] [2024-11-09 01:43:29,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:29,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:43:29,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:29,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:43:29,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:43:29,350 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:43:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:29,396 INFO L93 Difference]: Finished difference Result 168 states and 237 transitions. [2024-11-09 01:43:29,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:43:29,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-11-09 01:43:29,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:29,401 INFO L225 Difference]: With dead ends: 168 [2024-11-09 01:43:29,401 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 01:43:29,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:43:29,403 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:29,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 336 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:43:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 01:43:29,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-11-09 01:43:29,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:43:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2024-11-09 01:43:29,419 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 116 [2024-11-09 01:43:29,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:29,420 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2024-11-09 01:43:29,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:43:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2024-11-09 01:43:29,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:43:29,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:29,427 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:29,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:43:29,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:29,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:29,428 INFO L85 PathProgramCache]: Analyzing trace with hash -127502366, now seen corresponding path program 1 times [2024-11-09 01:43:29,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:29,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579503363] [2024-11-09 01:43:29,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:29,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:31,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:31,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:31,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:31,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:31,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:31,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:31,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:43:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:43:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:31,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:31,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:31,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:31,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:31,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:31,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:31,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:31,281 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:43:31,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:31,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579503363] [2024-11-09 01:43:31,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579503363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:31,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:31,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:43:31,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31609464] [2024-11-09 01:43:31,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:31,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:43:31,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:31,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:43:31,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:43:31,284 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:43:31,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:31,854 INFO L93 Difference]: Finished difference Result 228 states and 317 transitions. [2024-11-09 01:43:31,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:43:31,855 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 116 [2024-11-09 01:43:31,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:31,857 INFO L225 Difference]: With dead ends: 228 [2024-11-09 01:43:31,857 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 01:43:31,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:43:31,859 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 210 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:31,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 457 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:43:31,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 01:43:31,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2024-11-09 01:43:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 119 states have (on average 1.319327731092437) internal successors, (157), 120 states have internal predecessors, (157), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:43:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 197 transitions. [2024-11-09 01:43:31,884 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 197 transitions. Word has length 116 [2024-11-09 01:43:31,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:31,885 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 197 transitions. [2024-11-09 01:43:31,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:43:31,885 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 197 transitions. [2024-11-09 01:43:31,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:43:31,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:31,887 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:31,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:43:31,887 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:31,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash 130663072, now seen corresponding path program 1 times [2024-11-09 01:43:31,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:31,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193757708] [2024-11-09 01:43:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:31,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:33,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:33,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:33,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:33,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:33,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:33,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:33,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:43:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:33,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:43:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:33,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:33,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:33,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:33,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:33,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:33,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:33,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:43:33,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:33,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193757708] [2024-11-09 01:43:33,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193757708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:33,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:33,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:43:33,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716256990] [2024-11-09 01:43:33,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:33,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:43:33,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:33,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:43:33,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:43:33,803 INFO L87 Difference]: Start difference. First operand 142 states and 197 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:43:34,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:34,649 INFO L93 Difference]: Finished difference Result 307 states and 424 transitions. [2024-11-09 01:43:34,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:43:34,650 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 116 [2024-11-09 01:43:34,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:34,652 INFO L225 Difference]: With dead ends: 307 [2024-11-09 01:43:34,652 INFO L226 Difference]: Without dead ends: 168 [2024-11-09 01:43:34,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:43:34,654 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 223 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:34,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 354 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:43:34,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-09 01:43:34,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 141. [2024-11-09 01:43:34,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 119 states have internal predecessors, (155), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:43:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 195 transitions. [2024-11-09 01:43:34,682 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 195 transitions. Word has length 116 [2024-11-09 01:43:34,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:34,682 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 195 transitions. [2024-11-09 01:43:34,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:43:34,682 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 195 transitions. [2024-11-09 01:43:34,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:43:34,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:34,684 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:34,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:43:34,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:34,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:34,686 INFO L85 PathProgramCache]: Analyzing trace with hash 602238711, now seen corresponding path program 1 times [2024-11-09 01:43:34,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:34,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960289562] [2024-11-09 01:43:34,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:34,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:34,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:34,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:34,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:34,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:34,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:34,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:34,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:43:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:34,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:43:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:34,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:34,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:34,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:34,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:34,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:34,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:34,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:43:34,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:34,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960289562] [2024-11-09 01:43:34,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960289562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:34,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:34,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:43:34,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520839345] [2024-11-09 01:43:34,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:34,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:43:34,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:34,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:43:34,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:43:34,941 INFO L87 Difference]: Start difference. First operand 141 states and 195 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:43:35,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:35,128 INFO L93 Difference]: Finished difference Result 360 states and 497 transitions. [2024-11-09 01:43:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:43:35,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-11-09 01:43:35,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:35,131 INFO L225 Difference]: With dead ends: 360 [2024-11-09 01:43:35,131 INFO L226 Difference]: Without dead ends: 222 [2024-11-09 01:43:35,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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:43:35,133 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 92 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:35,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 500 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:43:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-09 01:43:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2024-11-09 01:43:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 176 states have (on average 1.2784090909090908) internal successors, (225), 179 states have internal predecessors, (225), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 01:43:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 301 transitions. [2024-11-09 01:43:35,197 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 301 transitions. Word has length 116 [2024-11-09 01:43:35,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:35,198 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 301 transitions. [2024-11-09 01:43:35,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:43:35,198 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 301 transitions. [2024-11-09 01:43:35,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:43:35,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:35,199 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:35,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:43:35,200 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:35,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:35,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1715850268, now seen corresponding path program 1 times [2024-11-09 01:43:35,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:35,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767011359] [2024-11-09 01:43:35,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:35,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:36,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:36,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:36,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:36,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:36,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:36,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:36,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:43:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:36,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:43:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:36,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:36,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:36,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:36,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:36,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:36,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:36,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:36,865 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:43:36,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:36,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767011359] [2024-11-09 01:43:36,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767011359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:36,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:36,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:43:36,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446942938] [2024-11-09 01:43:36,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:36,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:43:36,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:36,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:43:36,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:43:36,869 INFO L87 Difference]: Start difference. First operand 219 states and 301 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:43:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:37,693 INFO L93 Difference]: Finished difference Result 427 states and 585 transitions. [2024-11-09 01:43:37,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:43:37,694 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 116 [2024-11-09 01:43:37,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:37,696 INFO L225 Difference]: With dead ends: 427 [2024-11-09 01:43:37,697 INFO L226 Difference]: Without dead ends: 226 [2024-11-09 01:43:37,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:43:37,699 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 267 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:37,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 445 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:43:37,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-09 01:43:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 186. [2024-11-09 01:43:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 148 states have (on average 1.2635135135135136) internal successors, (187), 150 states have internal predecessors, (187), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:43:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 253 transitions. [2024-11-09 01:43:37,754 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 253 transitions. Word has length 116 [2024-11-09 01:43:37,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:37,755 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 253 transitions. [2024-11-09 01:43:37,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:43:37,755 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 253 transitions. [2024-11-09 01:43:37,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:43:37,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:37,756 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:37,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:43:37,757 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:37,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:37,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1457684830, now seen corresponding path program 1 times [2024-11-09 01:43:37,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:37,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773781428] [2024-11-09 01:43:37,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:37,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:38,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:38,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:38,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:38,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:38,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:38,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:38,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:43:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:38,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:43:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:38,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:38,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:38,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:38,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:38,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:38,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:38,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:43:38,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:38,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773781428] [2024-11-09 01:43:38,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773781428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:38,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:38,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:43:38,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038644692] [2024-11-09 01:43:38,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:38,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:43:38,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:38,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:43:38,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:43:38,882 INFO L87 Difference]: Start difference. First operand 186 states and 253 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 01:43:39,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:39,612 INFO L93 Difference]: Finished difference Result 394 states and 536 transitions. [2024-11-09 01:43:39,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:43:39,614 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 116 [2024-11-09 01:43:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:39,616 INFO L225 Difference]: With dead ends: 394 [2024-11-09 01:43:39,616 INFO L226 Difference]: Without dead ends: 226 [2024-11-09 01:43:39,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:43:39,618 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 212 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:39,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 698 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:43:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-09 01:43:39,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 183. [2024-11-09 01:43:39,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 145 states have (on average 1.2620689655172415) internal successors, (183), 147 states have internal predecessors, (183), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:43:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 249 transitions. [2024-11-09 01:43:39,668 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 249 transitions. Word has length 116 [2024-11-09 01:43:39,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:39,669 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 249 transitions. [2024-11-09 01:43:39,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 01:43:39,669 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 249 transitions. [2024-11-09 01:43:39,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:43:39,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:39,670 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:39,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:43:39,671 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:39,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:39,671 INFO L85 PathProgramCache]: Analyzing trace with hash 671172388, now seen corresponding path program 1 times [2024-11-09 01:43:39,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:39,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229957364] [2024-11-09 01:43:39,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:39,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:39,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:39,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:39,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:39,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:39,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:39,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:39,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:43:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:39,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:43:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:39,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:39,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:39,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:39,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:39,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:39,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:39,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:39,916 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:43:39,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:39,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229957364] [2024-11-09 01:43:39,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229957364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:39,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:39,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:43:39,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019993958] [2024-11-09 01:43:39,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:39,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:43:39,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:39,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:43:39,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:43:39,919 INFO L87 Difference]: Start difference. First operand 183 states and 249 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:43:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:40,099 INFO L93 Difference]: Finished difference Result 353 states and 478 transitions. [2024-11-09 01:43:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:43:40,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-11-09 01:43:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:40,101 INFO L225 Difference]: With dead ends: 353 [2024-11-09 01:43:40,101 INFO L226 Difference]: Without dead ends: 188 [2024-11-09 01:43:40,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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:43:40,102 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 94 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:40,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 439 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:43:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-09 01:43:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2024-11-09 01:43:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 146 states have (on average 1.2465753424657535) internal successors, (182), 148 states have internal predecessors, (182), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:43:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 248 transitions. [2024-11-09 01:43:40,151 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 248 transitions. Word has length 117 [2024-11-09 01:43:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:40,151 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 248 transitions. [2024-11-09 01:43:40,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:43:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 248 transitions. [2024-11-09 01:43:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:43:40,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:40,153 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:40,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:43:40,153 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:40,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:40,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1400913465, now seen corresponding path program 1 times [2024-11-09 01:43:40,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:40,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752673074] [2024-11-09 01:43:40,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:40,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:41,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:41,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:41,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:41,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:41,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:41,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:43:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:41,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:43:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:41,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:41,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:41,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:41,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:41,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:41,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:41,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:43:41,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:41,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752673074] [2024-11-09 01:43:41,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752673074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:41,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:41,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:43:41,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613372832] [2024-11-09 01:43:41,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:41,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:43:41,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:41,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:43:41,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:43:41,135 INFO L87 Difference]: Start difference. First operand 185 states and 248 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:43:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:41,847 INFO L93 Difference]: Finished difference Result 407 states and 547 transitions. [2024-11-09 01:43:41,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:43:41,848 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 117 [2024-11-09 01:43:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:41,849 INFO L225 Difference]: With dead ends: 407 [2024-11-09 01:43:41,849 INFO L226 Difference]: Without dead ends: 240 [2024-11-09 01:43:41,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:43:41,850 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 357 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:41,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 350 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:43:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-09 01:43:41,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 222. [2024-11-09 01:43:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 183 states have (on average 1.273224043715847) internal successors, (233), 185 states have internal predecessors, (233), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:43:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 299 transitions. [2024-11-09 01:43:41,900 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 299 transitions. Word has length 117 [2024-11-09 01:43:41,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:41,900 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 299 transitions. [2024-11-09 01:43:41,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:43:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 299 transitions. [2024-11-09 01:43:41,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:43:41,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:41,902 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:41,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:43:41,902 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:41,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:41,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1142748027, now seen corresponding path program 1 times [2024-11-09 01:43:41,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:41,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299176339] [2024-11-09 01:43:41,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:41,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:42,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:42,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:42,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:42,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:42,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:42,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:42,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:43:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:42,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:43:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:42,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:42,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:42,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:42,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:42,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:42,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:42,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:43:42,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:42,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299176339] [2024-11-09 01:43:42,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299176339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:42,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:42,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 01:43:42,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757317787] [2024-11-09 01:43:42,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:42,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 01:43:42,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:42,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 01:43:42,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:43:42,963 INFO L87 Difference]: Start difference. First operand 222 states and 299 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:43:43,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:43,959 INFO L93 Difference]: Finished difference Result 459 states and 616 transitions. [2024-11-09 01:43:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:43:43,960 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 117 [2024-11-09 01:43:43,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:43,961 INFO L225 Difference]: With dead ends: 459 [2024-11-09 01:43:43,961 INFO L226 Difference]: Without dead ends: 240 [2024-11-09 01:43:43,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:43:43,963 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 292 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:43,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 828 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:43:43,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-09 01:43:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 222. [2024-11-09 01:43:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 183 states have (on average 1.2677595628415301) internal successors, (232), 185 states have internal predecessors, (232), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:43:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 298 transitions. [2024-11-09 01:43:44,004 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 298 transitions. Word has length 117 [2024-11-09 01:43:44,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:44,004 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 298 transitions. [2024-11-09 01:43:44,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:43:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 298 transitions. [2024-11-09 01:43:44,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:43:44,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:44,008 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:44,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:43:44,008 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:44,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:44,008 INFO L85 PathProgramCache]: Analyzing trace with hash -593231241, now seen corresponding path program 1 times [2024-11-09 01:43:44,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:44,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774824896] [2024-11-09 01:43:44,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:44,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:44,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:44,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:44,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:44,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:44,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:44,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:44,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:43:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:44,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:43:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:44,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:44,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:44,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:44,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:44,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:44,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:44,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:43:44,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:44,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774824896] [2024-11-09 01:43:44,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774824896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:44,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:44,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:43:44,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082303142] [2024-11-09 01:43:44,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:44,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:43:44,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:44,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:43:44,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:43:44,543 INFO L87 Difference]: Start difference. First operand 222 states and 298 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:43:45,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:45,133 INFO L93 Difference]: Finished difference Result 451 states and 602 transitions. [2024-11-09 01:43:45,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:43:45,134 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-11-09 01:43:45,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:45,137 INFO L225 Difference]: With dead ends: 451 [2024-11-09 01:43:45,137 INFO L226 Difference]: Without dead ends: 232 [2024-11-09 01:43:45,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:43:45,138 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 154 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:45,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 737 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:43:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-09 01:43:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 130. [2024-11-09 01:43:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 111 states have (on average 1.2792792792792793) internal successors, (142), 111 states have internal predecessors, (142), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:43:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 172 transitions. [2024-11-09 01:43:45,165 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 172 transitions. Word has length 117 [2024-11-09 01:43:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:45,166 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 172 transitions. [2024-11-09 01:43:45,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:43:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 172 transitions. [2024-11-09 01:43:45,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:43:45,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:45,167 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:45,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:43:45,168 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:45,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:45,168 INFO L85 PathProgramCache]: Analyzing trace with hash -851396679, now seen corresponding path program 1 times [2024-11-09 01:43:45,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:45,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537703735] [2024-11-09 01:43:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:45,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:45,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:45,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:45,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:45,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:45,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:45,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:45,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:43:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:45,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:43:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:45,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:45,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:45,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:45,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:45,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:45,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:45,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:43:45,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:45,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537703735] [2024-11-09 01:43:45,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537703735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:45,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:45,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:43:45,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911539927] [2024-11-09 01:43:45,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:45,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:43:45,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:45,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:43:45,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:43:45,752 INFO L87 Difference]: Start difference. First operand 130 states and 172 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:43:46,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:46,164 INFO L93 Difference]: Finished difference Result 297 states and 392 transitions. [2024-11-09 01:43:46,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:43:46,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-11-09 01:43:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:46,166 INFO L225 Difference]: With dead ends: 297 [2024-11-09 01:43:46,166 INFO L226 Difference]: Without dead ends: 170 [2024-11-09 01:43:46,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:43:46,167 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 198 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:46,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 332 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:43:46,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-09 01:43:46,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 127. [2024-11-09 01:43:46,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.2685185185185186) internal successors, (137), 108 states have internal predecessors, (137), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:43:46,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 167 transitions. [2024-11-09 01:43:46,192 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 167 transitions. Word has length 117 [2024-11-09 01:43:46,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:46,193 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 167 transitions. [2024-11-09 01:43:46,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:43:46,193 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 167 transitions. [2024-11-09 01:43:46,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:43:46,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:46,194 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:46,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:43:46,194 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:46,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:46,194 INFO L85 PathProgramCache]: Analyzing trace with hash -837181581, now seen corresponding path program 1 times [2024-11-09 01:43:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:46,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933851631] [2024-11-09 01:43:46,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:46,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:46,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:46,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:46,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:46,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:46,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:46,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:46,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:43:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:46,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:43:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:46,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:46,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:46,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:46,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:46,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:46,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:46,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:43:46,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:46,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933851631] [2024-11-09 01:43:46,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933851631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:46,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:46,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:43:46,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143347898] [2024-11-09 01:43:46,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:46,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:43:46,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:46,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:43:46,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:43:46,523 INFO L87 Difference]: Start difference. First operand 127 states and 167 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:43:46,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:46,727 INFO L93 Difference]: Finished difference Result 310 states and 403 transitions. [2024-11-09 01:43:46,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:43:46,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 118 [2024-11-09 01:43:46,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:46,730 INFO L225 Difference]: With dead ends: 310 [2024-11-09 01:43:46,730 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 01:43:46,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:43:46,731 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 57 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:46,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 555 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:43:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 01:43:46,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 147. [2024-11-09 01:43:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 128 states have (on average 1.234375) internal successors, (158), 128 states have internal predecessors, (158), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:43:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 188 transitions. [2024-11-09 01:43:46,758 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 188 transitions. Word has length 118 [2024-11-09 01:43:46,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:46,759 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 188 transitions. [2024-11-09 01:43:46,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:43:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 188 transitions. [2024-11-09 01:43:46,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:43:46,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:46,761 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:46,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:43:46,761 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:46,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:46,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1358672584, now seen corresponding path program 1 times [2024-11-09 01:43:46,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:46,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306757520] [2024-11-09 01:43:46,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:46,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:56,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:56,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:56,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:56,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:56,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:56,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:56,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:43:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:56,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:43:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:56,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:56,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:56,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:56,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:56,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:56,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:56,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 78 proven. 54 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-09 01:43:57,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:57,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306757520] [2024-11-09 01:43:57,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306757520] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:43:57,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199002823] [2024-11-09 01:43:57,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:57,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:43:57,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:43:57,030 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:43:57,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:43:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:57,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-09 01:43:57,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:43:58,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:43:59,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:44:00,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 01:44:02,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2024-11-09 01:44:03,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:44:04,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:44:04,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:44:04,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:44:04,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2024-11-09 01:44:04,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:44:04,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:44:04,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:44:04,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 58 [2024-11-09 01:44:09,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2024-11-09 01:44:09,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2024-11-09 01:44:09,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:44:09,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:44:09,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:44:09,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 47 [2024-11-09 01:44:09,733 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 83 proven. 302 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 01:44:09,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:44:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:44:18,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199002823] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:44:18,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:44:18,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [32, 34] total 70 [2024-11-09 01:44:18,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101508408] [2024-11-09 01:44:18,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:44:18,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:44:18,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:44:18,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:44:18,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=4553, Unknown=0, NotChecked=0, Total=4830 [2024-11-09 01:44:18,374 INFO L87 Difference]: Start difference. First operand 147 states and 188 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:44:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:44:24,997 INFO L93 Difference]: Finished difference Result 360 states and 459 transitions. [2024-11-09 01:44:24,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:44:24,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-11-09 01:44:24,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:44:24,999 INFO L225 Difference]: With dead ends: 360 [2024-11-09 01:44:25,000 INFO L226 Difference]: Without dead ends: 216 [2024-11-09 01:44:25,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=298, Invalid=4814, Unknown=0, NotChecked=0, Total=5112 [2024-11-09 01:44:25,002 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 149 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:44:25,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 453 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:44:25,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-09 01:44:25,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 180. [2024-11-09 01:44:25,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 158 states have (on average 1.240506329113924) internal successors, (196), 159 states have internal predecessors, (196), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:44:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 230 transitions. [2024-11-09 01:44:25,032 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 230 transitions. Word has length 119 [2024-11-09 01:44:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:44:25,032 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 230 transitions. [2024-11-09 01:44:25,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:44:25,033 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 230 transitions. [2024-11-09 01:44:25,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 01:44:25,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:44:25,034 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:25,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:44:25,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 01:44:25,235 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:44:25,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:44:25,236 INFO L85 PathProgramCache]: Analyzing trace with hash 54726989, now seen corresponding path program 1 times [2024-11-09 01:44:25,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:44:25,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829669799] [2024-11-09 01:44:25,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:25,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:44:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:44:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:44:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:44:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:44:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:44:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:44:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:44:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:44:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:44:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:44:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:44:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:44:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:44:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:44:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:44:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:44:26,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:44:26,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829669799] [2024-11-09 01:44:26,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829669799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:44:26,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:44:26,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:44:26,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278376434] [2024-11-09 01:44:26,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:44:26,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:44:26,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:44:26,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:44:26,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:44:26,663 INFO L87 Difference]: Start difference. First operand 180 states and 230 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:44:29,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:44:29,507 INFO L93 Difference]: Finished difference Result 458 states and 584 transitions. [2024-11-09 01:44:29,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:44:29,508 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 120 [2024-11-09 01:44:29,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:44:29,509 INFO L225 Difference]: With dead ends: 458 [2024-11-09 01:44:29,509 INFO L226 Difference]: Without dead ends: 281 [2024-11-09 01:44:29,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2024-11-09 01:44:29,510 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 312 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:44:29,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 769 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 01:44:29,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-09 01:44:29,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 177. [2024-11-09 01:44:29,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 155 states have (on average 1.238709677419355) internal successors, (192), 156 states have internal predecessors, (192), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:44:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 226 transitions. [2024-11-09 01:44:29,545 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 226 transitions. Word has length 120 [2024-11-09 01:44:29,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:44:29,545 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 226 transitions. [2024-11-09 01:44:29,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:44:29,545 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 226 transitions. [2024-11-09 01:44:29,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 01:44:29,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:44:29,547 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:29,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 01:44:29,547 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:44:29,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:44:29,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1348302124, now seen corresponding path program 1 times [2024-11-09 01:44:29,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:44:29,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707734512] [2024-11-09 01:44:29,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:29,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:44:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:30,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:44:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:30,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:44:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:30,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:44:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:30,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:44:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:30,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:44:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:30,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:44:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:30,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:44:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:30,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:44:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:30,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:44:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:30,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:44:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:30,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:44:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:30,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:44:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:30,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:44:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:30,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:44:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:30,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:44:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:30,684 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:44:30,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:44:30,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707734512] [2024-11-09 01:44:30,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707734512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:44:30,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:44:30,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:44:30,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670801305] [2024-11-09 01:44:30,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:44:30,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:44:30,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:44:30,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:44:30,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:44:30,687 INFO L87 Difference]: Start difference. First operand 177 states and 226 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 01:44:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:44:31,204 INFO L93 Difference]: Finished difference Result 205 states and 258 transitions. [2024-11-09 01:44:31,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:44:31,204 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 120 [2024-11-09 01:44:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:44:31,206 INFO L225 Difference]: With dead ends: 205 [2024-11-09 01:44:31,206 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 01:44:31,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:44:31,206 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 161 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:44:31,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 474 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:44:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 01:44:31,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2024-11-09 01:44:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 173 states have (on average 1.2138728323699421) internal successors, (210), 175 states have internal predecessors, (210), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:44:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 254 transitions. [2024-11-09 01:44:31,248 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 254 transitions. Word has length 120 [2024-11-09 01:44:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:44:31,248 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 254 transitions. [2024-11-09 01:44:31,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 01:44:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 254 transitions. [2024-11-09 01:44:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 01:44:31,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:44:31,250 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:31,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 01:44:31,250 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:44:31,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:44:31,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1350149166, now seen corresponding path program 1 times [2024-11-09 01:44:31,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:44:31,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265270580] [2024-11-09 01:44:31,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:31,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:44:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat