./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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-90.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 d7249a4084734468a9df38189de6441ee3548af581a8047a10bfcd263bdf18bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:23:07,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:23:07,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:23:07,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:23:07,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:23:07,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:23:07,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:23:07,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:23:07,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:23:07,673 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:23:07,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:23:07,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:23:07,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:23:07,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:23:07,674 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:23:07,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:23:07,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:23:07,674 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:23:07,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:23:07,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:23:07,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:23:07,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:23:07,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:23:07,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:23:07,674 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:23:07,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:23:07,674 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:23:07,674 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:23:07,674 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:23:07,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:23:07,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:23:07,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:23:07,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:23:07,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:23:07,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:23:07,675 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:23:07,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:23:07,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:23:07,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:23:07,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:23:07,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:23:07,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:23:07,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:23:07,675 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> d7249a4084734468a9df38189de6441ee3548af581a8047a10bfcd263bdf18bd [2025-03-04 01:23:07,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:23:07,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:23:07,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:23:07,913 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:23:07,913 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:23:07,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i [2025-03-04 01:23:09,094 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07be3a413/82ea5e1ede5a4ccc81cff42093c10aaf/FLAG7921ee803 [2025-03-04 01:23:09,318 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:23:09,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i [2025-03-04 01:23:09,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07be3a413/82ea5e1ede5a4ccc81cff42093c10aaf/FLAG7921ee803 [2025-03-04 01:23:09,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07be3a413/82ea5e1ede5a4ccc81cff42093c10aaf [2025-03-04 01:23:09,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:23:09,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:23:09,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:23:09,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:23:09,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:23:09,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:23:09" (1/1) ... [2025-03-04 01:23:09,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3564759a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:23:09, skipping insertion in model container [2025-03-04 01:23:09,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:23:09" (1/1) ... [2025-03-04 01:23:09,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:23:09,469 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-90.i[917,930] [2025-03-04 01:23:09,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:23:09,526 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:23:09,534 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-90.i[917,930] [2025-03-04 01:23:09,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:23:09,575 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:23:09,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:23:09 WrapperNode [2025-03-04 01:23:09,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:23:09,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:23:09,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:23:09,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:23:09,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:23:09" (1/1) ... [2025-03-04 01:23:09,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:23:09" (1/1) ... [2025-03-04 01:23:09,614 INFO L138 Inliner]: procedures = 26, calls = 165, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2025-03-04 01:23:09,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:23:09,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:23:09,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:23:09,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:23:09,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:23:09" (1/1) ... [2025-03-04 01:23:09,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:23:09" (1/1) ... [2025-03-04 01:23:09,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:23:09" (1/1) ... [2025-03-04 01:23:09,644 INFO L175 MemorySlicer]: Split 130 memory accesses to 5 slices as follows [2, 34, 4, 55, 35]. 42 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 1, 6, 3]. The 19 writes are split as follows [0, 6, 1, 6, 6]. [2025-03-04 01:23:09,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:23:09" (1/1) ... [2025-03-04 01:23:09,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:23:09" (1/1) ... [2025-03-04 01:23:09,653 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:23:09" (1/1) ... [2025-03-04 01:23:09,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:23:09" (1/1) ... [2025-03-04 01:23:09,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:23:09" (1/1) ... [2025-03-04 01:23:09,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:23:09" (1/1) ... [2025-03-04 01:23:09,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:23:09,659 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:23:09,659 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:23:09,659 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:23:09,660 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:23:09" (1/1) ... [2025-03-04 01:23:09,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:23:09,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:23:09,684 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) [2025-03-04 01:23:09,687 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 [2025-03-04 01:23:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:23:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:23:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:23:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:23:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:23:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:23:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:23:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:23:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:23:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:23:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:23:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:23:09,707 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:23:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:23:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:23:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:23:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:23:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:23:09,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:23:09,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:23:09,814 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:23:09,815 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:23:10,124 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc property_#t~mem73#1;havoc property_#t~ite82#1;havoc property_#t~mem81#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~ite80#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite100#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite97#1;havoc property_#t~ite94#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~ite111#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~mem110#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~short109#1;havoc property_#t~short112#1;havoc property_#t~mem118#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite127#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short128#1; [2025-03-04 01:23:10,163 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2025-03-04 01:23:10,164 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:23:10,174 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:23:10,174 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:23:10,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:23:10 BoogieIcfgContainer [2025-03-04 01:23:10,174 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:23:10,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:23:10,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:23:10,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:23:10,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:23:09" (1/3) ... [2025-03-04 01:23:10,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a35e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:23:10, skipping insertion in model container [2025-03-04 01:23:10,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:23:09" (2/3) ... [2025-03-04 01:23:10,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a35e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:23:10, skipping insertion in model container [2025-03-04 01:23:10,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:23:10" (3/3) ... [2025-03-04 01:23:10,180 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-90.i [2025-03-04 01:23:10,190 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:23:10,191 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-90.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:23:10,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:23:10,245 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;@6f0e5f19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:23:10,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:23:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 87 states have (on average 1.367816091954023) internal successors, (119), 88 states have internal predecessors, (119), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:23:10,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:23:10,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:23:10,260 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:23:10,261 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:23:10,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:23:10,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1065850823, now seen corresponding path program 1 times [2025-03-04 01:23:10,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:23:10,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208417131] [2025-03-04 01:23:10,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:10,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:23:10,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:23:10,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:23:10,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:10,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:23:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-04 01:23:10,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:23:10,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208417131] [2025-03-04 01:23:10,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208417131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:23:10,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977122420] [2025-03-04 01:23:10,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:10,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:23:10,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:23:10,550 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) [2025-03-04 01:23:10,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:23:10,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:23:10,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:23:10,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:10,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:23:10,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:23:10,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:23:10,785 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-04 01:23:10,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:23:10,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977122420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:23:10,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:23:10,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:23:10,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295360499] [2025-03-04 01:23:10,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:23:10,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:23:10,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:23:10,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:23:10,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:23:10,808 INFO L87 Difference]: Start difference. First operand has 110 states, 87 states have (on average 1.367816091954023) internal successors, (119), 88 states have internal predecessors, (119), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:23:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:23:10,828 INFO L93 Difference]: Finished difference Result 214 states and 333 transitions. [2025-03-04 01:23:10,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:23:10,830 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 153 [2025-03-04 01:23:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:23:10,836 INFO L225 Difference]: With dead ends: 214 [2025-03-04 01:23:10,836 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 01:23:10,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:23:10,841 INFO L435 NwaCegarLoop]: 154 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, 154 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 [2025-03-04 01:23:10,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:23:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 01:23:10,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-04 01:23:10,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:23:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2025-03-04 01:23:10,877 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 153 [2025-03-04 01:23:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:23:10,877 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2025-03-04 01:23:10,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:23:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2025-03-04 01:23:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:23:10,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:23:10,879 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:23:10,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:23:11,080 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,SelfDestructingSolverStorable0 [2025-03-04 01:23:11,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:23:11,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:23:11,081 INFO L85 PathProgramCache]: Analyzing trace with hash -639095885, now seen corresponding path program 1 times [2025-03-04 01:23:11,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:23:11,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137181293] [2025-03-04 01:23:11,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:11,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:23:11,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:23:11,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:23:11,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:11,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:23:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-04 01:23:11,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:23:11,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137181293] [2025-03-04 01:23:11,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137181293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:23:11,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397074490] [2025-03-04 01:23:11,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:11,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:23:11,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:23:11,470 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) [2025-03-04 01:23:11,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:23:11,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:23:11,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:23:11,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:11,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:23:11,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:23:11,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:23:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:23:11,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:23:11,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397074490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:23:11,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:23:11,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:23:11,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354580063] [2025-03-04 01:23:11,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:23:11,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:23:11,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:23:11,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:23:11,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:23:11,726 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:23:11,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:23:11,760 INFO L93 Difference]: Finished difference Result 213 states and 308 transitions. [2025-03-04 01:23:11,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:23:11,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2025-03-04 01:23:11,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:23:11,762 INFO L225 Difference]: With dead ends: 213 [2025-03-04 01:23:11,762 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 01:23:11,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:23:11,763 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:23:11,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:23:11,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 01:23:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-04 01:23:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:23:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-03-04 01:23:11,772 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 153 [2025-03-04 01:23:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:23:11,773 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-03-04 01:23:11,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:23:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-03-04 01:23:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:23:11,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:23:11,777 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:23:11,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:23:11,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 01:23:11,977 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:23:11,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:23:11,978 INFO L85 PathProgramCache]: Analyzing trace with hash -84478063, now seen corresponding path program 1 times [2025-03-04 01:23:11,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:23:11,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194760218] [2025-03-04 01:23:11,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:11,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:23:11,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:23:12,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:23:12,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:12,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:23:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:23:12,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:23:12,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194760218] [2025-03-04 01:23:12,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194760218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:23:12,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:23:12,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:23:12,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780713123] [2025-03-04 01:23:12,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:23:12,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:23:12,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:23:12,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:23:12,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:23:12,598 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:23:12,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:23:12,760 INFO L93 Difference]: Finished difference Result 252 states and 360 transitions. [2025-03-04 01:23:12,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:23:12,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2025-03-04 01:23:12,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:23:12,764 INFO L225 Difference]: With dead ends: 252 [2025-03-04 01:23:12,764 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 01:23:12,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:23:12,765 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 111 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:23:12,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 606 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:23:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 01:23:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 111. [2025-03-04 01:23:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:23:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2025-03-04 01:23:12,777 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 155 [2025-03-04 01:23:12,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:23:12,777 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2025-03-04 01:23:12,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:23:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2025-03-04 01:23:12,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:23:12,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:23:12,779 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:23:12,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:23:12,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:23:12,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:23:12,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1845309197, now seen corresponding path program 1 times [2025-03-04 01:23:12,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:23:12,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516942077] [2025-03-04 01:23:12,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:12,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:23:12,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:23:12,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:23:12,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:12,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:23:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:23:13,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:23:13,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516942077] [2025-03-04 01:23:13,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516942077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:23:13,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:23:13,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:23:13,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152215699] [2025-03-04 01:23:13,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:23:13,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:23:13,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:23:13,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:23:13,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:23:13,709 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:23:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:23:13,933 INFO L93 Difference]: Finished difference Result 226 states and 320 transitions. [2025-03-04 01:23:13,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:23:13,934 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-03-04 01:23:13,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:23:13,935 INFO L225 Difference]: With dead ends: 226 [2025-03-04 01:23:13,937 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 01:23:13,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:23:13,938 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 182 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:23:13,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 617 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:23:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 01:23:13,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-04 01:23:13,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:23:13,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2025-03-04 01:23:13,947 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 156 [2025-03-04 01:23:13,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:23:13,947 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2025-03-04 01:23:13,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:23:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2025-03-04 01:23:13,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:23:13,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:23:13,949 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:23:13,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:23:13,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:23:13,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:23:13,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1364303633, now seen corresponding path program 1 times [2025-03-04 01:23:13,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:23:13,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939277256] [2025-03-04 01:23:13,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:13,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:23:13,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:23:14,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:23:14,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:14,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:23:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-04 01:23:14,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:23:14,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939277256] [2025-03-04 01:23:14,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939277256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:23:14,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104642603] [2025-03-04 01:23:14,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:14,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:23:14,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:23:14,952 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:23:14,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:23:15,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:23:15,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:23:15,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:15,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:23:15,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-04 01:23:15,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:23:17,398 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 [2025-03-04 01:23:18,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2025-03-04 01:23:18,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:23:18,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2025-03-04 01:23:18,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:23:18,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:23:18,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-03-04 01:23:18,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 99 [2025-03-04 01:23:18,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:23:18,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:23:18,647 INFO L349 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2025-03-04 01:23:18,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 129 [2025-03-04 01:23:18,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:23:18,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:23:18,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:23:18,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:23:18,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:23:18,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2025-03-04 01:23:19,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:23:19,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 209 treesize of output 345 [2025-03-04 01:23:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 375 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-03-04 01:23:38,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:23:43,141 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#3| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base))) (and (forall ((v_ArrVal_215 (Array Int Int))) (let ((.cse0 (select v_ArrVal_215 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))) (or (< 32767 .cse0) (not (= v_ArrVal_215 (store .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset .cse0))) (< .cse0 0) (let ((.cse4 (store |c_#memory_int#3| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base v_ArrVal_215))) (let ((.cse2 (mod (+ (select (select .cse4 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset) (select (select .cse4 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer~0.offset)) 65536))) (= .cse2 (mod (let ((.cse3 (store .cse4 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base (store (select .cse4 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset (+ .cse2 (- 65536)))))) (+ (select (select .cse3 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer~0.offset) (select (select .cse3 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset))) 65536))))))) (forall ((v_ArrVal_215 (Array Int Int))) (let ((.cse5 (select v_ArrVal_215 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))) (or (not (= v_ArrVal_215 (store .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset .cse5))) (let ((.cse8 (store |c_#memory_int#3| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base v_ArrVal_215))) (let ((.cse6 (mod (+ (select (select .cse8 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset) (select (select .cse8 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer~0.offset)) 65536))) (= .cse6 (mod (let ((.cse7 (store .cse8 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base (store (select .cse8 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset (+ .cse6 (- 65536)))))) (+ (select (select .cse7 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer~0.offset) (select (select .cse7 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset))) 65536)))) (< (+ .cse5 32768) 0) (< 0 (+ .cse5 1))))))) is different from false [2025-03-04 01:23:44,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104642603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:23:44,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:23:44,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 27 [2025-03-04 01:23:44,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35294975] [2025-03-04 01:23:44,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:23:44,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 01:23:44,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:23:44,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 01:23:44,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1059, Unknown=1, NotChecked=66, Total=1260 [2025-03-04 01:23:44,250 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 27 states, 26 states have (on average 4.576923076923077) internal successors, (119), 27 states have internal predecessors, (119), 7 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 6 states have call predecessors, (40), 7 states have call successors, (40) [2025-03-04 01:23:52,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:23:52,604 INFO L93 Difference]: Finished difference Result 682 states and 923 transitions. [2025-03-04 01:23:52,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-03-04 01:23:52,605 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.576923076923077) internal successors, (119), 27 states have internal predecessors, (119), 7 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 6 states have call predecessors, (40), 7 states have call successors, (40) Word has length 157 [2025-03-04 01:23:52,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:23:52,607 INFO L225 Difference]: With dead ends: 682 [2025-03-04 01:23:52,607 INFO L226 Difference]: Without dead ends: 567 [2025-03-04 01:23:52,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 175 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3137 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1344, Invalid=10215, Unknown=1, NotChecked=212, Total=11772 [2025-03-04 01:23:52,610 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1450 mSDsluCounter, 2035 mSDsCounter, 0 mSdLazyCounter, 3240 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 3516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 3240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:23:52,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 2159 Invalid, 3516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 3240 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-04 01:23:52,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-04 01:23:52,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 351. [2025-03-04 01:23:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 278 states have (on average 1.2697841726618706) internal successors, (353), 280 states have internal predecessors, (353), 62 states have call successors, (62), 10 states have call predecessors, (62), 10 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:23:52,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 477 transitions. [2025-03-04 01:23:52,651 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 477 transitions. Word has length 157 [2025-03-04 01:23:52,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:23:52,651 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 477 transitions. [2025-03-04 01:23:52,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.576923076923077) internal successors, (119), 27 states have internal predecessors, (119), 7 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 6 states have call predecessors, (40), 7 states have call successors, (40) [2025-03-04 01:23:52,651 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 477 transitions. [2025-03-04 01:23:52,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:23:52,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:23:52,652 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:23:52,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:23:52,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:23:52,853 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:23:52,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:23:52,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1936869011, now seen corresponding path program 1 times [2025-03-04 01:23:52,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:23:52,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822797206] [2025-03-04 01:23:52,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:52,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:23:52,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:23:52,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:23:52,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:52,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:23:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:23:53,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:23:53,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822797206] [2025-03-04 01:23:53,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822797206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:23:53,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:23:53,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:23:53,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955349569] [2025-03-04 01:23:53,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:23:53,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:23:53,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:23:53,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:23:53,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:23:53,496 INFO L87 Difference]: Start difference. First operand 351 states and 477 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:23:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:23:53,977 INFO L93 Difference]: Finished difference Result 622 states and 840 transitions. [2025-03-04 01:23:53,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:23:53,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2025-03-04 01:23:53,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:23:53,981 INFO L225 Difference]: With dead ends: 622 [2025-03-04 01:23:53,982 INFO L226 Difference]: Without dead ends: 422 [2025-03-04 01:23:53,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:23:53,983 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 176 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:23:53,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 621 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:23:53,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-04 01:23:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 418. [2025-03-04 01:23:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 334 states have (on average 1.2664670658682635) internal successors, (423), 337 states have internal predecessors, (423), 70 states have call successors, (70), 13 states have call predecessors, (70), 13 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-04 01:23:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 563 transitions. [2025-03-04 01:23:54,027 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 563 transitions. Word has length 157 [2025-03-04 01:23:54,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:23:54,027 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 563 transitions. [2025-03-04 01:23:54,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:23:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 563 transitions. [2025-03-04 01:23:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:23:54,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:23:54,030 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:23:54,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:23:54,030 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:23:54,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:23:54,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1866584557, now seen corresponding path program 1 times [2025-03-04 01:23:54,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:23:54,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403029633] [2025-03-04 01:23:54,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:54,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:23:54,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:23:54,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:23:54,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:54,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:23:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:23:55,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:23:55,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403029633] [2025-03-04 01:23:55,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403029633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:23:55,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:23:55,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:23:55,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256830989] [2025-03-04 01:23:55,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:23:55,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:23:55,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:23:55,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:23:55,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:23:55,279 INFO L87 Difference]: Start difference. First operand 418 states and 563 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-04 01:23:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:23:55,993 INFO L93 Difference]: Finished difference Result 802 states and 1081 transitions. [2025-03-04 01:23:55,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:23:55,993 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 157 [2025-03-04 01:23:55,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:23:55,997 INFO L225 Difference]: With dead ends: 802 [2025-03-04 01:23:55,997 INFO L226 Difference]: Without dead ends: 540 [2025-03-04 01:23:55,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:23:55,998 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 372 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:23:55,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 650 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:23:56,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-04 01:23:56,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 415. [2025-03-04 01:23:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 331 states have (on average 1.2598187311178248) internal successors, (417), 334 states have internal predecessors, (417), 70 states have call successors, (70), 13 states have call predecessors, (70), 13 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-04 01:23:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 557 transitions. [2025-03-04 01:23:56,049 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 557 transitions. Word has length 157 [2025-03-04 01:23:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:23:56,050 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 557 transitions. [2025-03-04 01:23:56,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-04 01:23:56,051 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 557 transitions. [2025-03-04 01:23:56,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:23:56,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:23:56,052 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:23:56,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:23:56,052 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:23:56,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:23:56,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1361025932, now seen corresponding path program 1 times [2025-03-04 01:23:56,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:23:56,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417316992] [2025-03-04 01:23:56,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:23:56,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:23:56,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:23:56,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:56,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:23:59,187 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-04 01:23:59,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:23:59,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417316992] [2025-03-04 01:23:59,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417316992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:23:59,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686308257] [2025-03-04 01:23:59,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:59,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:23:59,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:23:59,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:23:59,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:23:59,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:23:59,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:23:59,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:59,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:23:59,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 01:23:59,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:24:00,481 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 8 treesize of output 1 [2025-03-04 01:24:00,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 43 [2025-03-04 01:24:00,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:24:00,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2025-03-04 01:24:00,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:24:00,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 24 [2025-03-04 01:24:00,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:24:00,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 69 [2025-03-04 01:24:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-04 01:24:00,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:24:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:24:01,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686308257] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:24:01,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:24:01,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [26, 11] total 37 [2025-03-04 01:24:01,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702672216] [2025-03-04 01:24:01,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:24:01,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:24:01,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:24:01,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:24:01,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1233, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 01:24:01,327 INFO L87 Difference]: Start difference. First operand 415 states and 557 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:24:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:24:02,031 INFO L93 Difference]: Finished difference Result 792 states and 1061 transitions. [2025-03-04 01:24:02,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:24:02,032 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2025-03-04 01:24:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:24:02,034 INFO L225 Difference]: With dead ends: 792 [2025-03-04 01:24:02,034 INFO L226 Difference]: Without dead ends: 542 [2025-03-04 01:24:02,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 01:24:02,035 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 79 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:24:02,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1287 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:24:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-04 01:24:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 413. [2025-03-04 01:24:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 329 states have (on average 1.2583586626139818) internal successors, (414), 332 states have internal predecessors, (414), 70 states have call successors, (70), 13 states have call predecessors, (70), 13 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-04 01:24:02,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 554 transitions. [2025-03-04 01:24:02,081 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 554 transitions. Word has length 157 [2025-03-04 01:24:02,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:24:02,082 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 554 transitions. [2025-03-04 01:24:02,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:24:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 554 transitions. [2025-03-04 01:24:02,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:24:02,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:24:02,084 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:24:02,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:24:02,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:24:02,285 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:24:02,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:24:02,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1080510449, now seen corresponding path program 1 times [2025-03-04 01:24:02,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:24:02,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281851376] [2025-03-04 01:24:02,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:24:02,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:24:02,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:24:02,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:24:02,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:24:02,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat