./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-53.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-53.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 62cd8631d3c7dbcc2748663d6a0cde2e3de4d2e71baf8db333c770b90174d49b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:42:47,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:42:47,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:42:47,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:42:47,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:42:47,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:42:47,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:42:47,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:42:47,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:42:47,206 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:42:47,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:42:47,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:42:47,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:42:47,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:42:47,207 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:42:47,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:42:47,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:42:47,208 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:42:47,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:42:47,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:42:47,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:42:47,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:42:47,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:42:47,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:42:47,213 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:42:47,213 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:42:47,213 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:42:47,213 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:42:47,213 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:42:47,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:42:47,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:42:47,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:42:47,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:42:47,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:42:47,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:42:47,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:42:47,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:42:47,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:42:47,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:42:47,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:42:47,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:42:47,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:42:47,219 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 -> 62cd8631d3c7dbcc2748663d6a0cde2e3de4d2e71baf8db333c770b90174d49b [2024-11-09 01:42:47,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:42:47,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:42:47,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:42:47,450 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:42:47,450 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:42:47,451 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-53.i [2024-11-09 01:42:48,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:42:48,865 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:42:48,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-53.i [2024-11-09 01:42:48,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c52ba79c/0fe14c62164743b589427d52cd0f1e79/FLAG3483dcf8d [2024-11-09 01:42:49,258 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c52ba79c/0fe14c62164743b589427d52cd0f1e79 [2024-11-09 01:42:49,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:42:49,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:42:49,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:42:49,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:42:49,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:42:49,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:42:49" (1/1) ... [2024-11-09 01:42:49,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75755c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:49, skipping insertion in model container [2024-11-09 01:42:49,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:42:49" (1/1) ... [2024-11-09 01:42:49,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:42:49,417 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-53.i[917,930] [2024-11-09 01:42:49,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:42:49,471 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:42:49,479 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-53.i[917,930] [2024-11-09 01:42:49,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:42:49,526 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:42:49,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:49 WrapperNode [2024-11-09 01:42:49,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:42:49,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:42:49,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:42:49,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:42:49,533 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:42:49" (1/1) ... [2024-11-09 01:42:49,550 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:42:49" (1/1) ... [2024-11-09 01:42:49,590 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 506 [2024-11-09 01:42:49,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:42:49,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:42:49,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:42:49,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:42:49,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:49" (1/1) ... [2024-11-09 01:42:49,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:49" (1/1) ... [2024-11-09 01:42:49,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:49" (1/1) ... [2024-11-09 01:42:49,637 INFO L175 MemorySlicer]: Split 133 memory accesses to 5 slices as follows [2, 45, 20, 39, 27]. 34 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 2, 5, 2]. The 18 writes are split as follows [0, 9, 2, 5, 2]. [2024-11-09 01:42:49,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:49" (1/1) ... [2024-11-09 01:42:49,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:49" (1/1) ... [2024-11-09 01:42:49,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:49" (1/1) ... [2024-11-09 01:42:49,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:49" (1/1) ... [2024-11-09 01:42:49,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:49" (1/1) ... [2024-11-09 01:42:49,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:49" (1/1) ... [2024-11-09 01:42:49,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:42:49,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:42:49,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:42:49,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:42:49,669 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:49" (1/1) ... [2024-11-09 01:42:49,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:42:49,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:42:49,703 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:42:49,706 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:42:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:42:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:42:49,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:42:49,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:42:49,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:42:49,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:42:49,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:42:49,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:42:49,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:42:49,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:42:49,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:42:49,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:42:49,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:42:49,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:42:49,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:42:49,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:42:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:42:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:42:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:42:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:42:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:42:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:42:49,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:42:49,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:42:49,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:42:49,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:42:49,749 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:42:49,749 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:42:49,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:42:49,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:42:49,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:42:49,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:42:49,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:42:49,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:42:49,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:42:49,880 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:42:49,882 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:42:50,282 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-09 01:42:50,282 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:42:50,296 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:42:50,296 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:42:50,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:42:50 BoogieIcfgContainer [2024-11-09 01:42:50,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:42:50,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:42:50,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:42:50,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:42:50,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:42:49" (1/3) ... [2024-11-09 01:42:50,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c006803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:42:50, skipping insertion in model container [2024-11-09 01:42:50,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:49" (2/3) ... [2024-11-09 01:42:50,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c006803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:42:50, skipping insertion in model container [2024-11-09 01:42:50,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:42:50" (3/3) ... [2024-11-09 01:42:50,303 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-53.i [2024-11-09 01:42:50,314 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:42:50,314 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:42:50,358 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:42:50,362 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;@41506763, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:42:50,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:42:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:42:50,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:42:50,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:42:50,374 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:50,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:42:50,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:42:50,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1255670194, now seen corresponding path program 1 times [2024-11-09 01:42:50,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:42:50,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146709498] [2024-11-09 01:42:50,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:42:50,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:42:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:42:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:42:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:42:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:42:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:42:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:42:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:42:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:42:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:42:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:42:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:42:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:42:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:42:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:42:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:42:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:42:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:42:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:42:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:42:50,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:42:50,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146709498] [2024-11-09 01:42:50,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146709498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:42:50,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:42:50,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:42:50,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661156382] [2024-11-09 01:42:50,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:42:50,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:42:50,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:42:50,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:42:50,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:42:50,818 INFO L87 Difference]: Start difference. First operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:42:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:42:50,884 INFO L93 Difference]: Finished difference Result 217 states and 340 transitions. [2024-11-09 01:42:50,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:42:50,886 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2024-11-09 01:42:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:42:50,894 INFO L225 Difference]: With dead ends: 217 [2024-11-09 01:42:50,894 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 01:42:50,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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:42:50,901 INFO L432 NwaCegarLoop]: 155 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, 155 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:42:50,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:42:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 01:42:50,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 01:42:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:42:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2024-11-09 01:42:50,941 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2024-11-09 01:42:50,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:42:50,942 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2024-11-09 01:42:50,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:42:50,942 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2024-11-09 01:42:50,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:42:50,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:42:50,947 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:50,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:42:50,948 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:42:50,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:42:50,948 INFO L85 PathProgramCache]: Analyzing trace with hash -674029138, now seen corresponding path program 1 times [2024-11-09 01:42:50,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:42:50,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272306804] [2024-11-09 01:42:50,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:42:50,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:42:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:42:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:42:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:42:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:42:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:42:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:42:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:42:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:42:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:42:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:42:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:42:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:42:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:42:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:42:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:42:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:42:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:42:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:42:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:42:51,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:42:51,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272306804] [2024-11-09 01:42:51,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272306804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:42:51,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:42:51,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:42:51,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495352026] [2024-11-09 01:42:51,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:42:51,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:42:51,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:42:51,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:42:51,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:42:51,464 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:42:51,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:42:51,513 INFO L93 Difference]: Finished difference Result 213 states and 307 transitions. [2024-11-09 01:42:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:42:51,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-11-09 01:42:51,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:42:51,515 INFO L225 Difference]: With dead ends: 213 [2024-11-09 01:42:51,515 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 01:42:51,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:42:51,517 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:42:51,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:42:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 01:42:51,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 01:42:51,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:42:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2024-11-09 01:42:51,530 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 140 [2024-11-09 01:42:51,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:42:51,532 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2024-11-09 01:42:51,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:42:51,533 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2024-11-09 01:42:51,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:42:51,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:42:51,536 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:51,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:42:51,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:42:51,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:42:51,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1695097492, now seen corresponding path program 1 times [2024-11-09 01:42:51,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:42:51,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943232997] [2024-11-09 01:42:51,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:42:51,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:42:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:42:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:42:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:42:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:42:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:42:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:42:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:42:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:42:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:42:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:42:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:42:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:42:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:42:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:42:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:42:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:42:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:42:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:42:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:42:53,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:42:53,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943232997] [2024-11-09 01:42:53,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943232997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:42:53,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:42:53,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:42:53,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991416104] [2024-11-09 01:42:53,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:42:53,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:42:53,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:42:53,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:42:53,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:42:53,497 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-09 01:42:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:42:53,849 INFO L93 Difference]: Finished difference Result 215 states and 308 transitions. [2024-11-09 01:42:53,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:42:53,850 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 140 [2024-11-09 01:42:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:42:53,852 INFO L225 Difference]: With dead ends: 215 [2024-11-09 01:42:53,852 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 01:42:53,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:42:53,855 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 304 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:42:53,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 550 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:42:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 01:42:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-09 01:42:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:42:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2024-11-09 01:42:53,872 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 140 [2024-11-09 01:42:53,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:42:53,872 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2024-11-09 01:42:53,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-09 01:42:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2024-11-09 01:42:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:42:53,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:42:53,876 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:53,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:42:53,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:42:53,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:42:53,877 INFO L85 PathProgramCache]: Analyzing trace with hash -994032914, now seen corresponding path program 1 times [2024-11-09 01:42:53,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:42:53,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881314470] [2024-11-09 01:42:53,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:42:53,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:42:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:42:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:42:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:42:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:42:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:42:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:42:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:42:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:42:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:42:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:42:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:42:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:42:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:42:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:42:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:42:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:42:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:42:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:42:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:42:55,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:42:55,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881314470] [2024-11-09 01:42:55,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881314470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:42:55,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:42:55,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:42:55,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436505210] [2024-11-09 01:42:55,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:42:55,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:42:55,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:42:55,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:42:55,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:42:55,111 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-09 01:42:55,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:42:55,543 INFO L93 Difference]: Finished difference Result 248 states and 353 transitions. [2024-11-09 01:42:55,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:42:55,543 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 140 [2024-11-09 01:42:55,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:42:55,544 INFO L225 Difference]: With dead ends: 248 [2024-11-09 01:42:55,545 INFO L226 Difference]: Without dead ends: 141 [2024-11-09 01:42:55,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:42:55,546 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 203 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:42:55,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 726 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:42:55,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-09 01:42:55,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2024-11-09 01:42:55,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 110 states have (on average 1.309090909090909) internal successors, (144), 111 states have internal predecessors, (144), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 01:42:55,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 196 transitions. [2024-11-09 01:42:55,567 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 196 transitions. Word has length 140 [2024-11-09 01:42:55,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:42:55,567 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 196 transitions. [2024-11-09 01:42:55,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-09 01:42:55,567 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 196 transitions. [2024-11-09 01:42:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 01:42:55,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:42:55,568 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:55,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:42:55,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:42:55,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:42:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash 59473210, now seen corresponding path program 1 times [2024-11-09 01:42:55,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:42:55,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874892407] [2024-11-09 01:42:55,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:42:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:42:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:42:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:42:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:42:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:42:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:42:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:42:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:42:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:42:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:42:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:42:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:42:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:42:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:42:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:42:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:42:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:42:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:42:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:42:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:42:55,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:42:55,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874892407] [2024-11-09 01:42:55,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874892407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:42:55,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:42:55,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:42:55,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272549456] [2024-11-09 01:42:55,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:42:55,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:42:55,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:42:55,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:42:55,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:42:55,744 INFO L87 Difference]: Start difference. First operand 139 states and 196 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:42:55,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:42:55,787 INFO L93 Difference]: Finished difference Result 248 states and 348 transitions. [2024-11-09 01:42:55,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:42:55,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-09 01:42:55,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:42:55,789 INFO L225 Difference]: With dead ends: 248 [2024-11-09 01:42:55,789 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 01:42:55,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:42:55,790 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:42:55,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:42:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 01:42:55,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-09 01:42:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 110 states have (on average 1.3) internal successors, (143), 111 states have internal predecessors, (143), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 01:42:55,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 195 transitions. [2024-11-09 01:42:55,818 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 195 transitions. Word has length 145 [2024-11-09 01:42:55,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:42:55,819 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 195 transitions. [2024-11-09 01:42:55,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:42:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 195 transitions. [2024-11-09 01:42:55,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 01:42:55,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:42:55,821 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:55,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:42:55,822 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:42:55,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:42:55,823 INFO L85 PathProgramCache]: Analyzing trace with hash -527332804, now seen corresponding path program 1 times [2024-11-09 01:42:55,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:42:55,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504711273] [2024-11-09 01:42:55,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:42:55,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:42:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:56,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:42:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:42:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:42:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:42:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:42:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:42:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:42:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:42:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:42:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:42:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:42:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:42:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:42:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:42:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:42:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:42:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:42:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:42:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:42:57,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:42:57,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504711273] [2024-11-09 01:42:57,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504711273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:42:57,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:42:57,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 01:42:57,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939844443] [2024-11-09 01:42:57,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:42:57,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:42:57,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:42:57,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:42:57,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:42:57,064 INFO L87 Difference]: Start difference. First operand 139 states and 195 transitions. Second operand has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-09 01:42:57,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:42:57,415 INFO L93 Difference]: Finished difference Result 288 states and 398 transitions. [2024-11-09 01:42:57,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:42:57,415 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) Word has length 145 [2024-11-09 01:42:57,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:42:57,416 INFO L225 Difference]: With dead ends: 288 [2024-11-09 01:42:57,416 INFO L226 Difference]: Without dead ends: 179 [2024-11-09 01:42:57,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:42:57,417 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 210 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:42:57,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 811 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:42:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-09 01:42:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150. [2024-11-09 01:42:57,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 122 states have internal predecessors, (156), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 01:42:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 208 transitions. [2024-11-09 01:42:57,448 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 208 transitions. Word has length 145 [2024-11-09 01:42:57,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:42:57,449 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 208 transitions. [2024-11-09 01:42:57,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-09 01:42:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 208 transitions. [2024-11-09 01:42:57,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 01:42:57,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:42:57,451 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:57,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:42:57,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:42:57,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:42:57,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1554842476, now seen corresponding path program 1 times [2024-11-09 01:42:57,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:42:57,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130907412] [2024-11-09 01:42:57,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:42:57,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:42:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:42:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:42:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:42:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:42:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:42:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:42:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:42:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:42:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:42:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:42:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:42:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:42:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:42:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:42:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:42:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:42:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:42:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:42:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:42:58,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:42:58,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130907412] [2024-11-09 01:42:58,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130907412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:42:58,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:42:58,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:42:58,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529997396] [2024-11-09 01:42:58,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:42:58,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:42:58,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:42:58,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:42:58,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:42:58,688 INFO L87 Difference]: Start difference. First operand 150 states and 208 transitions. Second operand has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-09 01:42:59,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:42:59,436 INFO L93 Difference]: Finished difference Result 356 states and 491 transitions. [2024-11-09 01:42:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:42:59,437 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 146 [2024-11-09 01:42:59,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:42:59,438 INFO L225 Difference]: With dead ends: 356 [2024-11-09 01:42:59,438 INFO L226 Difference]: Without dead ends: 236 [2024-11-09 01:42:59,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:42:59,439 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 358 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:42:59,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1003 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:42:59,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-09 01:42:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 233. [2024-11-09 01:42:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 190 states have (on average 1.305263157894737) internal successors, (248), 192 states have internal predecessors, (248), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 01:42:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 324 transitions. [2024-11-09 01:42:59,475 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 324 transitions. Word has length 146 [2024-11-09 01:42:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:42:59,476 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 324 transitions. [2024-11-09 01:42:59,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-09 01:42:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 324 transitions. [2024-11-09 01:42:59,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 01:42:59,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:42:59,477 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:59,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:42:59,477 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:42:59,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:42:59,477 INFO L85 PathProgramCache]: Analyzing trace with hash -2039060242, now seen corresponding path program 1 times [2024-11-09 01:42:59,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:42:59,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351622485] [2024-11-09 01:42:59,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:42:59,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:42:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:43:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:43:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:43:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:43:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:43:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:43:00,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:00,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351622485] [2024-11-09 01:43:00,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351622485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:00,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:00,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:43:00,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713120890] [2024-11-09 01:43:00,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:00,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:43:00,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:00,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:43:00,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:43:00,218 INFO L87 Difference]: Start difference. First operand 233 states and 324 transitions. Second operand has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-09 01:43:00,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:00,609 INFO L93 Difference]: Finished difference Result 509 states and 699 transitions. [2024-11-09 01:43:00,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:43:00,609 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 146 [2024-11-09 01:43:00,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:00,611 INFO L225 Difference]: With dead ends: 509 [2024-11-09 01:43:00,611 INFO L226 Difference]: Without dead ends: 306 [2024-11-09 01:43:00,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:43:00,612 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 243 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:00,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 782 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:43:00,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-09 01:43:00,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 212. [2024-11-09 01:43:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 177 states have (on average 1.2824858757062148) internal successors, (227), 178 states have internal predecessors, (227), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:43:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 287 transitions. [2024-11-09 01:43:00,653 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 287 transitions. Word has length 146 [2024-11-09 01:43:00,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:00,653 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 287 transitions. [2024-11-09 01:43:00,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-09 01:43:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 287 transitions. [2024-11-09 01:43:00,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 01:43:00,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:00,654 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:43:00,654 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:00,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:00,655 INFO L85 PathProgramCache]: Analyzing trace with hash 737194026, now seen corresponding path program 1 times [2024-11-09 01:43:00,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:00,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852513974] [2024-11-09 01:43:00,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:00,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:43:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:43:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:43:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:43:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:43:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:43:00,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:00,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852513974] [2024-11-09 01:43:00,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852513974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:00,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:00,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:43:00,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638944441] [2024-11-09 01:43:00,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:00,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:43:00,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:00,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:43:00,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:43:00,900 INFO L87 Difference]: Start difference. First operand 212 states and 287 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:43:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:01,039 INFO L93 Difference]: Finished difference Result 484 states and 657 transitions. [2024-11-09 01:43:01,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:43:01,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2024-11-09 01:43:01,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:01,041 INFO L225 Difference]: With dead ends: 484 [2024-11-09 01:43:01,041 INFO L226 Difference]: Without dead ends: 275 [2024-11-09 01:43:01,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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:01,042 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 93 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:01,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 770 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:43:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-09 01:43:01,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 212. [2024-11-09 01:43:01,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 177 states have (on average 1.271186440677966) internal successors, (225), 178 states have internal predecessors, (225), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:43:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 285 transitions. [2024-11-09 01:43:01,075 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 285 transitions. Word has length 146 [2024-11-09 01:43:01,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:01,076 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 285 transitions. [2024-11-09 01:43:01,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:43:01,076 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 285 transitions. [2024-11-09 01:43:01,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 01:43:01,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:01,077 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:43:01,077 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:01,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:01,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1438258604, now seen corresponding path program 1 times [2024-11-09 01:43:01,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:01,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909494963] [2024-11-09 01:43:01,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:01,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:43:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:43:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:43:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:43:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:43:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:43:01,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:01,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909494963] [2024-11-09 01:43:01,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909494963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:01,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:01,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:43:01,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899301086] [2024-11-09 01:43:01,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:01,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:43:01,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:01,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:43:01,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:43:01,657 INFO L87 Difference]: Start difference. First operand 212 states and 285 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:43:02,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:02,007 INFO L93 Difference]: Finished difference Result 512 states and 693 transitions. [2024-11-09 01:43:02,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:43:02,008 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2024-11-09 01:43:02,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:02,009 INFO L225 Difference]: With dead ends: 512 [2024-11-09 01:43:02,010 INFO L226 Difference]: Without dead ends: 303 [2024-11-09 01:43:02,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:43:02,010 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 95 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:02,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1235 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:43:02,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-09 01:43:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 212. [2024-11-09 01:43:02,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 177 states have (on average 1.265536723163842) internal successors, (224), 178 states have internal predecessors, (224), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:43:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 284 transitions. [2024-11-09 01:43:02,055 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 284 transitions. Word has length 146 [2024-11-09 01:43:02,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:02,056 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 284 transitions. [2024-11-09 01:43:02,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:43:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 284 transitions. [2024-11-09 01:43:02,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 01:43:02,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:02,057 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:43:02,057 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:02,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:02,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1779057358, now seen corresponding path program 1 times [2024-11-09 01:43:02,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:02,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246898907] [2024-11-09 01:43:02,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:02,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:43:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:43:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:43:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:43:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:43:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:43:02,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:02,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246898907] [2024-11-09 01:43:02,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246898907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:02,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:02,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:43:02,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739888555] [2024-11-09 01:43:02,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:02,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:43:02,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:02,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:43:02,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:43:02,222 INFO L87 Difference]: Start difference. First operand 212 states and 284 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:43:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:02,272 INFO L93 Difference]: Finished difference Result 427 states and 573 transitions. [2024-11-09 01:43:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:43:02,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-09 01:43:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:02,274 INFO L225 Difference]: With dead ends: 427 [2024-11-09 01:43:02,274 INFO L226 Difference]: Without dead ends: 218 [2024-11-09 01:43:02,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:43:02,274 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:02,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 576 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:43:02,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-09 01:43:02,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-09 01:43:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 183 states have (on average 1.2568306010928962) internal successors, (230), 184 states have internal predecessors, (230), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:43:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 290 transitions. [2024-11-09 01:43:02,312 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 290 transitions. Word has length 147 [2024-11-09 01:43:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:02,312 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 290 transitions. [2024-11-09 01:43:02,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:43:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 290 transitions. [2024-11-09 01:43:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 01:43:02,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:02,313 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:43:02,314 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:02,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:02,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1454574440, now seen corresponding path program 1 times [2024-11-09 01:43:02,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:02,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534079657] [2024-11-09 01:43:02,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:02,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:43:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:43:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:43:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:43:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:43:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:02,467 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:43:02,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:02,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534079657] [2024-11-09 01:43:02,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534079657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:02,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:02,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:43:02,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788491390] [2024-11-09 01:43:02,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:02,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:43:02,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:02,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:43:02,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:43:02,469 INFO L87 Difference]: Start difference. First operand 218 states and 290 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:43:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:02,527 INFO L93 Difference]: Finished difference Result 441 states and 587 transitions. [2024-11-09 01:43:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:43:02,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-09 01:43:02,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:02,529 INFO L225 Difference]: With dead ends: 441 [2024-11-09 01:43:02,529 INFO L226 Difference]: Without dead ends: 226 [2024-11-09 01:43:02,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:43:02,530 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:02,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 725 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:43:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-09 01:43:02,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 223. [2024-11-09 01:43:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 188 states have (on average 1.25) internal successors, (235), 189 states have internal predecessors, (235), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:43:02,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 295 transitions. [2024-11-09 01:43:02,565 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 295 transitions. Word has length 147 [2024-11-09 01:43:02,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:02,565 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 295 transitions. [2024-11-09 01:43:02,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:43:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 295 transitions. [2024-11-09 01:43:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 01:43:02,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:02,567 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:43:02,567 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:02,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:02,567 INFO L85 PathProgramCache]: Analyzing trace with hash -594796267, now seen corresponding path program 1 times [2024-11-09 01:43:02,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:02,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719934195] [2024-11-09 01:43:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:02,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:43:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:43:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:43:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:43:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:43:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:04,525 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:43:04,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:04,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719934195] [2024-11-09 01:43:04,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719934195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:04,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:04,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 01:43:04,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214832671] [2024-11-09 01:43:04,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:04,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 01:43:04,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:04,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 01:43:04,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:43:04,528 INFO L87 Difference]: Start difference. First operand 223 states and 295 transitions. Second operand has 14 states, 11 states have (on average 5.636363636363637) internal successors, (62), 14 states have internal predecessors, (62), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-09 01:43:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:05,915 INFO L93 Difference]: Finished difference Result 618 states and 821 transitions. [2024-11-09 01:43:05,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:43:05,918 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.636363636363637) internal successors, (62), 14 states have internal predecessors, (62), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) Word has length 149 [2024-11-09 01:43:05,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:05,921 INFO L225 Difference]: With dead ends: 618 [2024-11-09 01:43:05,921 INFO L226 Difference]: Without dead ends: 398 [2024-11-09 01:43:05,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:43:05,922 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 494 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:05,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 1138 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 01:43:05,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-09 01:43:05,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 306. [2024-11-09 01:43:05,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 271 states have (on average 1.2619926199261993) internal successors, (342), 272 states have internal predecessors, (342), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:43:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 402 transitions. [2024-11-09 01:43:05,961 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 402 transitions. Word has length 149 [2024-11-09 01:43:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:05,962 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 402 transitions. [2024-11-09 01:43:05,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.636363636363637) internal successors, (62), 14 states have internal predecessors, (62), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-09 01:43:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 402 transitions. [2024-11-09 01:43:05,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 01:43:05,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:05,963 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:43:05,963 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:05,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:05,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1473142871, now seen corresponding path program 1 times [2024-11-09 01:43:05,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:05,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43201833] [2024-11-09 01:43:05,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:05,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:43:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:43:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:43:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:43:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:43:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:07,649 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:43:07,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:07,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43201833] [2024-11-09 01:43:07,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43201833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:07,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:07,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 01:43:07,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7159998] [2024-11-09 01:43:07,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:07,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 01:43:07,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:07,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 01:43:07,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:43:07,651 INFO L87 Difference]: Start difference. First operand 306 states and 402 transitions. Second operand has 15 states, 13 states have (on average 4.769230769230769) internal successors, (62), 15 states have internal predecessors, (62), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-09 01:43:08,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:08,561 INFO L93 Difference]: Finished difference Result 568 states and 733 transitions. [2024-11-09 01:43:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 01:43:08,562 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.769230769230769) internal successors, (62), 15 states have internal predecessors, (62), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) Word has length 149 [2024-11-09 01:43:08,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:08,564 INFO L225 Difference]: With dead ends: 568 [2024-11-09 01:43:08,564 INFO L226 Difference]: Without dead ends: 566 [2024-11-09 01:43:08,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:43:08,565 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 757 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:08,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1043 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:43:08,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-09 01:43:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 490. [2024-11-09 01:43:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 455 states have (on average 1.2659340659340659) internal successors, (576), 456 states have internal predecessors, (576), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:43:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 636 transitions. [2024-11-09 01:43:08,604 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 636 transitions. Word has length 149 [2024-11-09 01:43:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:08,604 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 636 transitions. [2024-11-09 01:43:08,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.769230769230769) internal successors, (62), 15 states have internal predecessors, (62), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-09 01:43:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 636 transitions. [2024-11-09 01:43:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 01:43:08,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:08,606 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:43:08,606 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:08,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:08,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1374666179, now seen corresponding path program 1 times [2024-11-09 01:43:08,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:08,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390981099] [2024-11-09 01:43:08,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:08,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:43:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:43:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:43:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:43:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:43:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:43:08,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:08,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390981099] [2024-11-09 01:43:08,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390981099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:08,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:08,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:43:08,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454502810] [2024-11-09 01:43:08,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:08,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:43:08,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:08,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:43:08,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:43:08,771 INFO L87 Difference]: Start difference. First operand 490 states and 636 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:43:08,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:08,832 INFO L93 Difference]: Finished difference Result 1029 states and 1329 transitions. [2024-11-09 01:43:08,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:43:08,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-09 01:43:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:08,834 INFO L225 Difference]: With dead ends: 1029 [2024-11-09 01:43:08,834 INFO L226 Difference]: Without dead ends: 542 [2024-11-09 01:43:08,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:43:08,835 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:08,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 865 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:43:08,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-09 01:43:08,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 498. [2024-11-09 01:43:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 463 states have (on average 1.2613390928725703) internal successors, (584), 464 states have internal predecessors, (584), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:43:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 644 transitions. [2024-11-09 01:43:08,872 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 644 transitions. Word has length 149 [2024-11-09 01:43:08,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:08,872 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 644 transitions. [2024-11-09 01:43:08,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:43:08,872 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 644 transitions. [2024-11-09 01:43:08,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 01:43:08,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:08,874 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 01:43:08,874 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:08,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:08,874 INFO L85 PathProgramCache]: Analyzing trace with hash -367953501, now seen corresponding path program 1 times [2024-11-09 01:43:08,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:08,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066776312] [2024-11-09 01:43:08,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:08,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:43:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:43:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:43:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:43:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:43:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,571 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 15 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-09 01:43:09,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:09,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066776312] [2024-11-09 01:43:09,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066776312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:43:09,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752268779] [2024-11-09 01:43:09,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:09,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:43:09,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:43:09,574 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:09,575 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:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:09,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 01:43:09,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:43:09,902 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 7 treesize of output 3 [2024-11-09 01:43:10,623 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:10,954 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 34 treesize of output 18 [2024-11-09 01:43:11,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:43:11,264 INFO L349 Elim1Store]: treesize reduction 41, result has 26.8 percent of original size [2024-11-09 01:43:11,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 52 [2024-11-09 01:43:11,272 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 35 treesize of output 31 [2024-11-09 01:43:11,401 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 26 treesize of output 14 [2024-11-09 01:43:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 88 proven. 224 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-09 01:43:11,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:43:11,516 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 38 treesize of output 34 [2024-11-09 01:43:11,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752268779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:43:11,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:43:11,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2024-11-09 01:43:11,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342984453] [2024-11-09 01:43:11,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:43:11,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 01:43:11,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:11,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 01:43:11,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2024-11-09 01:43:11,678 INFO L87 Difference]: Start difference. First operand 498 states and 644 transitions. Second operand has 26 states, 23 states have (on average 5.434782608695652) internal successors, (125), 24 states have internal predecessors, (125), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 8 states have call predecessors, (36), 9 states have call successors, (36) [2024-11-09 01:43:12,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:12,518 INFO L93 Difference]: Finished difference Result 1013 states and 1307 transitions. [2024-11-09 01:43:12,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 01:43:12,520 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 5.434782608695652) internal successors, (125), 24 states have internal predecessors, (125), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 8 states have call predecessors, (36), 9 states have call successors, (36) Word has length 151 [2024-11-09 01:43:12,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:12,522 INFO L225 Difference]: With dead ends: 1013 [2024-11-09 01:43:12,522 INFO L226 Difference]: Without dead ends: 518 [2024-11-09 01:43:12,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=417, Invalid=1745, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 01:43:12,524 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 514 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:12,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 944 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:43:12,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-09 01:43:12,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 506. [2024-11-09 01:43:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 469 states have (on average 1.2579957356076759) internal successors, (590), 470 states have internal predecessors, (590), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:43:12,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 650 transitions. [2024-11-09 01:43:12,566 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 650 transitions. Word has length 151 [2024-11-09 01:43:12,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:12,566 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 650 transitions. [2024-11-09 01:43:12,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 5.434782608695652) internal successors, (125), 24 states have internal predecessors, (125), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 8 states have call predecessors, (36), 9 states have call successors, (36) [2024-11-09 01:43:12,567 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 650 transitions. [2024-11-09 01:43:12,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 01:43:12,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:12,568 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,583 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:43:12,768 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,SelfDestructingSolverStorable15 [2024-11-09 01:43:12,769 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:12,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:12,770 INFO L85 PathProgramCache]: Analyzing trace with hash 108556817, now seen corresponding path program 1 times [2024-11-09 01:43:12,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:12,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807007803] [2024-11-09 01:43:12,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:12,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:43:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:43:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:43:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:43:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:43:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:43:13,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:13,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807007803] [2024-11-09 01:43:13,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807007803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:43:13,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:43:13,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:43:13,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364025660] [2024-11-09 01:43:13,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:43:13,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:43:13,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:13,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:43:13,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:43:13,498 INFO L87 Difference]: Start difference. First operand 506 states and 650 transitions. Second operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-09 01:43:13,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:43:13,952 INFO L93 Difference]: Finished difference Result 1176 states and 1517 transitions. [2024-11-09 01:43:13,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:43:13,953 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 151 [2024-11-09 01:43:13,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:43:13,955 INFO L225 Difference]: With dead ends: 1176 [2024-11-09 01:43:13,955 INFO L226 Difference]: Without dead ends: 673 [2024-11-09 01:43:13,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:43:13,956 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 209 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 966 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:43:13,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 966 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:43:13,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-11-09 01:43:13,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 522. [2024-11-09 01:43:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 485 states have (on average 1.265979381443299) internal successors, (614), 486 states have internal predecessors, (614), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:43:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 674 transitions. [2024-11-09 01:43:13,999 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 674 transitions. Word has length 151 [2024-11-09 01:43:13,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:43:13,999 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 674 transitions. [2024-11-09 01:43:14,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-09 01:43:14,000 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 674 transitions. [2024-11-09 01:43:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 01:43:14,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:43:14,001 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 01:43:14,001 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:43:14,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:43:14,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1815752793, now seen corresponding path program 1 times [2024-11-09 01:43:14,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:43:14,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424209803] [2024-11-09 01:43:14,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:14,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:43:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:43:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:43:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:43:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:43:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:43:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:43:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:43:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:43:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:43:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:43:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:43:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:43:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:43:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:43:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:43:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:43:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:43:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:43:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 78 proven. 18 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-09 01:43:16,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:43:16,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424209803] [2024-11-09 01:43:16,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424209803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:43:16,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859896578] [2024-11-09 01:43:16,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:43:16,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:43:16,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:43:16,501 INFO L229 MonitoredProcess]: Starting monitored process 3 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:16,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:43:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:43:16,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 01:43:16,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:43:16,867 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 7 treesize of output 3 [2024-11-09 01:43:17,575 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:18,022 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 32 treesize of output 28 [2024-11-09 01:43:18,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:43:18,039 INFO L349 Elim1Store]: treesize reduction 35, result has 30.0 percent of original size [2024-11-09 01:43:18,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 41 [2024-11-09 01:43:18,192 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 17 treesize of output 9 [2024-11-09 01:43:18,237 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 236 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-09 01:43:18,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:43:18,383 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 38 treesize of output 34 [2024-11-09 01:43:26,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859896578] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:43:26,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:43:26,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 31 [2024-11-09 01:43:26,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542575677] [2024-11-09 01:43:26,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:43:26,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 01:43:26,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:43:26,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 01:43:26,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1134, Unknown=2, NotChecked=0, Total=1260 [2024-11-09 01:43:26,574 INFO L87 Difference]: Start difference. First operand 522 states and 674 transitions. Second operand has 31 states, 26 states have (on average 4.576923076923077) internal successors, (119), 28 states have internal predecessors, (119), 10 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 10 states have call successors, (36) [2024-11-09 01:43:28,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:43:40,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:43:42,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:43:46,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:43:49,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:43:50,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:43:55,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:44:03,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []