./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/duplets.c --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/verifythis/duplets.c -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 ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:11:13,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:11:13,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:11:13,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:11:13,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:11:13,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:11:13,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:11:13,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:11:13,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:11:13,460 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:11:13,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:11:13,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:11:13,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:11:13,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:11:13,460 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:11:13,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:11:13,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:11:13,461 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:11:13,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:11:13,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:11:13,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:11:13,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:11:13,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:11:13,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:11:13,462 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:11:13,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:11:13,462 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:11:13,462 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:11:13,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:11:13,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:11:13,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:11:13,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:11:13,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:11:13,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:11:13,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:11:13,463 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:11:13,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:11:13,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:11:13,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:11:13,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:11:13,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:11:13,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:11:13,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:11:13,464 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 -> ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 [2025-03-03 14:11:13,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:11:13,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:11:13,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:11:13,674 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:11:13,675 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:11:13,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2025-03-03 14:11:14,785 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263f84d25/aab4b151fd064ae7b8c45116d316c6e8/FLAGa4f25f025 [2025-03-03 14:11:14,970 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:11:14,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2025-03-03 14:11:14,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263f84d25/aab4b151fd064ae7b8c45116d316c6e8/FLAGa4f25f025 [2025-03-03 14:11:15,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263f84d25/aab4b151fd064ae7b8c45116d316c6e8 [2025-03-03 14:11:15,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:11:15,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:11:15,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:11:15,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:11:15,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:11:15,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:11:15" (1/1) ... [2025-03-03 14:11:15,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3562d3e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:15, skipping insertion in model container [2025-03-03 14:11:15,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:11:15" (1/1) ... [2025-03-03 14:11:15,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:11:15,451 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/verifythis/duplets.c[485,498] [2025-03-03 14:11:15,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:11:15,480 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:11:15,486 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/verifythis/duplets.c[485,498] [2025-03-03 14:11:15,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:11:15,512 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:11:15,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:15 WrapperNode [2025-03-03 14:11:15,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:11:15,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:11:15,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:11:15,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:11:15,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:15" (1/1) ... [2025-03-03 14:11:15,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:15" (1/1) ... [2025-03-03 14:11:15,541 INFO L138 Inliner]: procedures = 21, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 118 [2025-03-03 14:11:15,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:11:15,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:11:15,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:11:15,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:11:15,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:15" (1/1) ... [2025-03-03 14:11:15,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:15" (1/1) ... [2025-03-03 14:11:15,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:15" (1/1) ... [2025-03-03 14:11:15,562 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 5, 5, 7]. 37 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 5 writes are split as follows [0, 1, 1, 3]. [2025-03-03 14:11:15,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:15" (1/1) ... [2025-03-03 14:11:15,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:15" (1/1) ... [2025-03-03 14:11:15,571 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:15" (1/1) ... [2025-03-03 14:11:15,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:15" (1/1) ... [2025-03-03 14:11:15,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:15" (1/1) ... [2025-03-03 14:11:15,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:15" (1/1) ... [2025-03-03 14:11:15,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:11:15,578 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:11:15,579 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:11:15,579 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:11:15,580 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:15" (1/1) ... [2025-03-03 14:11:15,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:11:15,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:15,601 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-03 14:11:15,603 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-03 14:11:15,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:11:15,618 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 14:11:15,618 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 14:11:15,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:11:15,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:11:15,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:11:15,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:11:15,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 14:11:15,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 14:11:15,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 14:11:15,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 14:11:15,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 14:11:15,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 14:11:15,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:11:15,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:11:15,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 14:11:15,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 14:11:15,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 14:11:15,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 14:11:15,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 14:11:15,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 14:11:15,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 14:11:15,680 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:11:15,681 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:11:15,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: call ULTIMATE.dealloc(main_~#i~2#1.base, main_~#i~2#1.offset);havoc main_~#i~2#1.base, main_~#i~2#1.offset;call ULTIMATE.dealloc(main_~#j~2#1.base, main_~#j~2#1.offset);havoc main_~#j~2#1.base, main_~#j~2#1.offset; [2025-03-03 14:11:15,841 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-03-03 14:11:15,842 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:11:15,849 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:11:15,850 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:11:15,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:11:15 BoogieIcfgContainer [2025-03-03 14:11:15,850 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:11:15,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:11:15,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:11:15,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:11:15,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:11:15" (1/3) ... [2025-03-03 14:11:15,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eaedbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:11:15, skipping insertion in model container [2025-03-03 14:11:15,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:15" (2/3) ... [2025-03-03 14:11:15,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eaedbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:11:15, skipping insertion in model container [2025-03-03 14:11:15,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:11:15" (3/3) ... [2025-03-03 14:11:15,856 INFO L128 eAbstractionObserver]: Analyzing ICFG duplets.c [2025-03-03 14:11:15,865 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:11:15,867 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG duplets.c that has 3 procedures, 39 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 14:11:15,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:11:15,907 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;@49cb6662, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:11:15,908 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:11:15,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 14:11:15,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 14:11:15,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:15,914 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:11:15,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:15,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:15,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1179486165, now seen corresponding path program 1 times [2025-03-03 14:11:15,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:15,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705313960] [2025-03-03 14:11:15,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:15,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:15,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 14:11:15,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 14:11:15,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:15,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:11:16,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:16,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705313960] [2025-03-03 14:11:16,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705313960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:16,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044396280] [2025-03-03 14:11:16,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:16,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:16,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:16,048 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-03 14:11:16,049 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-03 14:11:16,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 14:11:16,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 14:11:16,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:16,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:16,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:11:16,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:11:16,163 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:16,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044396280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:16,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:16,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 14:11:16,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991624324] [2025-03-03 14:11:16,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:16,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:11:16,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:16,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:11:16,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:11:16,181 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 14:11:16,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:16,193 INFO L93 Difference]: Finished difference Result 75 states and 109 transitions. [2025-03-03 14:11:16,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:11:16,195 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2025-03-03 14:11:16,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:16,198 INFO L225 Difference]: With dead ends: 75 [2025-03-03 14:11:16,198 INFO L226 Difference]: Without dead ends: 35 [2025-03-03 14:11:16,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 33 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-03 14:11:16,202 INFO L435 NwaCegarLoop]: 50 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, 50 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-03 14:11:16,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-03 14:11:16,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-03 14:11:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:11:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-03-03 14:11:16,223 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 32 [2025-03-03 14:11:16,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:16,223 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-03-03 14:11:16,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 14:11:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-03-03 14:11:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 14:11:16,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:16,224 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:11:16,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:11:16,425 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-03 14:11:16,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:16,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:16,426 INFO L85 PathProgramCache]: Analyzing trace with hash 764609963, now seen corresponding path program 1 times [2025-03-03 14:11:16,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:16,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607681466] [2025-03-03 14:11:16,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:16,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:16,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 14:11:16,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 14:11:16,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:16,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:16,753 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:11:16,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:16,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607681466] [2025-03-03 14:11:16,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607681466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:16,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910267519] [2025-03-03 14:11:16,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:16,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:16,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:16,756 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-03 14:11:16,757 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-03 14:11:16,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 14:11:16,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 14:11:16,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:16,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:16,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:11:16,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:11:16,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:11:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:11:16,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910267519] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:11:16,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:11:16,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-03 14:11:16,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415722360] [2025-03-03 14:11:16,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:11:16,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:11:16,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:16,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:11:16,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:11:16,995 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 12 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-03 14:11:17,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:17,089 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2025-03-03 14:11:17,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:11:17,090 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 12 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2025-03-03 14:11:17,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:17,091 INFO L225 Difference]: With dead ends: 61 [2025-03-03 14:11:17,091 INFO L226 Difference]: Without dead ends: 43 [2025-03-03 14:11:17,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:11:17,091 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 27 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:17,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 230 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:17,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-03 14:11:17,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2025-03-03 14:11:17,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:11:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2025-03-03 14:11:17,097 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 32 [2025-03-03 14:11:17,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:17,097 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2025-03-03 14:11:17,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 12 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-03 14:11:17,097 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2025-03-03 14:11:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 14:11:17,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:17,097 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:11:17,103 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-03 14:11:17,302 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-03 14:11:17,302 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:17,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:17,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1221149500, now seen corresponding path program 1 times [2025-03-03 14:11:17,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:17,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15811182] [2025-03-03 14:11:17,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:17,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:17,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 14:11:17,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 14:11:17,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:17,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:17,647 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:11:17,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:17,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15811182] [2025-03-03 14:11:17,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15811182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:17,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:17,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 14:11:17,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448224671] [2025-03-03 14:11:17,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:17,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:11:17,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:17,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:11:17,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:11:17,649 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 11 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 14:11:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:17,868 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2025-03-03 14:11:17,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:11:17,869 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2025-03-03 14:11:17,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:17,869 INFO L225 Difference]: With dead ends: 65 [2025-03-03 14:11:17,869 INFO L226 Difference]: Without dead ends: 44 [2025-03-03 14:11:17,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:11:17,870 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 26 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:17,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 309 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-03 14:11:17,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2025-03-03 14:11:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:11:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2025-03-03 14:11:17,877 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2025-03-03 14:11:17,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:17,878 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2025-03-03 14:11:17,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 14:11:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2025-03-03 14:11:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 14:11:17,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:17,878 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:11:17,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:11:17,879 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:17,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:17,880 INFO L85 PathProgramCache]: Analyzing trace with hash -76578106, now seen corresponding path program 1 times [2025-03-03 14:11:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:17,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842980843] [2025-03-03 14:11:17,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:17,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:17,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 14:11:17,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 14:11:17,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:17,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:11:17,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:17,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842980843] [2025-03-03 14:11:17,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842980843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:17,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:17,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:11:17,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565678366] [2025-03-03 14:11:17,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:17,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:11:17,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:17,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:11:17,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:11:17,954 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:11:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:17,987 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2025-03-03 14:11:17,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:11:17,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2025-03-03 14:11:17,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:17,989 INFO L225 Difference]: With dead ends: 55 [2025-03-03 14:11:17,990 INFO L226 Difference]: Without dead ends: 53 [2025-03-03 14:11:17,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:11:17,990 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 11 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:17,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 214 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-03 14:11:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2025-03-03 14:11:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 14:11:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2025-03-03 14:11:18,002 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 34 [2025-03-03 14:11:18,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:18,002 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2025-03-03 14:11:18,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:11:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2025-03-03 14:11:18,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:11:18,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:18,003 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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-03 14:11:18,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:11:18,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:18,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:18,003 INFO L85 PathProgramCache]: Analyzing trace with hash 279007717, now seen corresponding path program 1 times [2025-03-03 14:11:18,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:18,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33519720] [2025-03-03 14:11:18,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:18,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:18,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:11:18,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:11:18,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:18,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:11:18,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:18,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33519720] [2025-03-03 14:11:18,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33519720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:18,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576089792] [2025-03-03 14:11:18,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:18,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:18,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:18,053 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-03 14:11:18,055 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-03 14:11:18,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:11:18,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:11:18,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:18,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:18,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:11:18,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:11:18,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:11:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:11:18,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576089792] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:11:18,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:11:18,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-03 14:11:18,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166135542] [2025-03-03 14:11:18,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:11:18,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:11:18,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:18,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:11:18,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:11:18,168 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:11:18,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:18,199 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2025-03-03 14:11:18,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:11:18,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2025-03-03 14:11:18,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:18,204 INFO L225 Difference]: With dead ends: 63 [2025-03-03 14:11:18,204 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 14:11:18,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:11:18,205 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:18,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 118 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 14:11:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-03 14:11:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 14:11:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2025-03-03 14:11:18,216 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 36 [2025-03-03 14:11:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:18,216 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2025-03-03 14:11:18,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:11:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2025-03-03 14:11:18,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 14:11:18,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:18,217 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:11:18,223 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-03 14:11:18,417 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-03 14:11:18,417 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:18,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:18,418 INFO L85 PathProgramCache]: Analyzing trace with hash 266527358, now seen corresponding path program 2 times [2025-03-03 14:11:18,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:18,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481576614] [2025-03-03 14:11:18,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:11:18,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:18,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 14:11:18,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 14:11:18,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:11:18,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:11:19,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:19,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481576614] [2025-03-03 14:11:19,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481576614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:19,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064460599] [2025-03-03 14:11:19,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:11:19,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:19,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:19,102 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-03 14:11:19,104 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-03 14:11:19,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 14:11:19,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 14:11:19,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:11:19,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:19,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-03 14:11:19,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:19,359 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2025-03-03 14:11:19,360 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 1 case distinctions, treesize of input 38 treesize of output 19 [2025-03-03 14:11:19,642 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-03-03 14:11:19,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 46 [2025-03-03 14:11:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:11:19,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:11:20,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 14:11:20,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 515 treesize of output 447 [2025-03-03 14:11:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:11:21,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064460599] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:11:21,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:11:21,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 37 [2025-03-03 14:11:21,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167874710] [2025-03-03 14:11:21,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:11:21,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 14:11:21,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:21,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 14:11:21,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1202, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 14:11:21,653 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 37 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 14:11:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:22,606 INFO L93 Difference]: Finished difference Result 91 states and 125 transitions. [2025-03-03 14:11:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 14:11:22,607 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 38 [2025-03-03 14:11:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:22,608 INFO L225 Difference]: With dead ends: 91 [2025-03-03 14:11:22,608 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 14:11:22,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=315, Invalid=2135, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 14:11:22,609 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 128 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:22,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 611 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:11:22,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 14:11:22,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2025-03-03 14:11:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 14:11:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2025-03-03 14:11:22,620 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 38 [2025-03-03 14:11:22,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:22,620 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2025-03-03 14:11:22,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 14:11:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2025-03-03 14:11:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 14:11:22,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:22,622 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 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-03 14:11:22,628 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-03 14:11:22,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:22,826 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:22,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:22,826 INFO L85 PathProgramCache]: Analyzing trace with hash 470473606, now seen corresponding path program 1 times [2025-03-03 14:11:22,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:22,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808755196] [2025-03-03 14:11:22,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:22,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:22,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 14:11:22,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 14:11:22,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:22,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:11:23,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:23,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808755196] [2025-03-03 14:11:23,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808755196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:23,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:23,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 14:11:23,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108551851] [2025-03-03 14:11:23,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:23,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:11:23,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:23,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:11:23,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:11:23,087 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 14:11:23,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:23,250 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2025-03-03 14:11:23,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:11:23,250 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2025-03-03 14:11:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:23,251 INFO L225 Difference]: With dead ends: 79 [2025-03-03 14:11:23,251 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 14:11:23,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:11:23,252 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 18 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:23,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 274 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 14:11:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2025-03-03 14:11:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 45 states have internal predecessors, (52), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 14:11:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2025-03-03 14:11:23,261 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 41 [2025-03-03 14:11:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:23,261 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2025-03-03 14:11:23,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 14:11:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2025-03-03 14:11:23,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 14:11:23,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:23,262 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:11:23,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:11:23,262 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:23,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:23,263 INFO L85 PathProgramCache]: Analyzing trace with hash 957819192, now seen corresponding path program 3 times [2025-03-03 14:11:23,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:23,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652940581] [2025-03-03 14:11:23,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:11:23,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:23,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-03-03 14:11:23,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 14:11:23,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 14:11:23,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 14:11:23,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:23,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652940581] [2025-03-03 14:11:23,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652940581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:23,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:23,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:11:23,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732221157] [2025-03-03 14:11:23,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:23,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:23,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:23,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:23,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:23,310 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:11:23,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:23,330 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2025-03-03 14:11:23,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:11:23,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2025-03-03 14:11:23,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:23,332 INFO L225 Difference]: With dead ends: 91 [2025-03-03 14:11:23,332 INFO L226 Difference]: Without dead ends: 61 [2025-03-03 14:11:23,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:23,332 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:23,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 118 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:23,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-03 14:11:23,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-03-03 14:11:23,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 46 states have internal predecessors, (52), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 14:11:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2025-03-03 14:11:23,344 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 42 [2025-03-03 14:11:23,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:23,344 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2025-03-03 14:11:23,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:11:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2025-03-03 14:11:23,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 14:11:23,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:23,347 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:11:23,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:11:23,347 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:23,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:23,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2029420711, now seen corresponding path program 4 times [2025-03-03 14:11:23,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:23,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144995927] [2025-03-03 14:11:23,348 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:11:23,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:23,354 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-03 14:11:23,369 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 14:11:23,369 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 14:11:23,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:11:24,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:24,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144995927] [2025-03-03 14:11:24,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144995927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:24,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386615290] [2025-03-03 14:11:24,532 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:11:24,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:24,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:24,534 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:24,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:11:24,578 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-03 14:11:24,610 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 14:11:24,610 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 14:11:24,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:24,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-03 14:11:24,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:24,620 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 7 treesize of output 6 [2025-03-03 14:11:24,745 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 45 treesize of output 40 [2025-03-03 14:11:30,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2025-03-03 14:11:30,881 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 14:11:30,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:11:31,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386615290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:31,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:11:31,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2025-03-03 14:11:31,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314705416] [2025-03-03 14:11:31,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:11:31,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 14:11:31,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:31,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 14:11:31,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1183, Unknown=2, NotChecked=0, Total=1332 [2025-03-03 14:11:31,416 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:11:33,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:33,021 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2025-03-03 14:11:33,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:11:33,022 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2025-03-03 14:11:33,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:33,023 INFO L225 Difference]: With dead ends: 88 [2025-03-03 14:11:33,023 INFO L226 Difference]: Without dead ends: 59 [2025-03-03 14:11:33,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=309, Invalid=1851, Unknown=2, NotChecked=0, Total=2162 [2025-03-03 14:11:33,024 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 60 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:33,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 380 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 14:11:33,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-03 14:11:33,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-03-03 14:11:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.146341463414634) internal successors, (47), 43 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 14:11:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2025-03-03 14:11:33,031 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 44 [2025-03-03 14:11:33,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:33,031 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-03-03 14:11:33,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:11:33,031 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2025-03-03 14:11:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 14:11:33,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:33,032 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 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-03 14:11:33,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:11:33,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:33,232 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:33,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:33,233 INFO L85 PathProgramCache]: Analyzing trace with hash 109382406, now seen corresponding path program 1 times [2025-03-03 14:11:33,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:33,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090708067] [2025-03-03 14:11:33,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:33,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:33,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 14:11:33,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 14:11:33,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:33,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:33,429 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:11:33,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:33,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090708067] [2025-03-03 14:11:33,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090708067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:33,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:33,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:11:33,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508050521] [2025-03-03 14:11:33,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:33,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:11:33,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:33,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:11:33,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:11:33,430 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:11:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:33,587 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2025-03-03 14:11:33,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:11:33,588 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2025-03-03 14:11:33,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:33,589 INFO L225 Difference]: With dead ends: 68 [2025-03-03 14:11:33,589 INFO L226 Difference]: Without dead ends: 66 [2025-03-03 14:11:33,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:11:33,589 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 10 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:33,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 248 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:33,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-03 14:11:33,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2025-03-03 14:11:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 47 states have internal predecessors, (50), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 14:11:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2025-03-03 14:11:33,600 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 48 [2025-03-03 14:11:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:33,601 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2025-03-03 14:11:33,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:11:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2025-03-03 14:11:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 14:11:33,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:33,602 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 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-03 14:11:33,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:11:33,602 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:33,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:33,602 INFO L85 PathProgramCache]: Analyzing trace with hash 110305927, now seen corresponding path program 1 times [2025-03-03 14:11:33,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:33,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52626170] [2025-03-03 14:11:33,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:33,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:33,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 14:11:33,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 14:11:33,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:33,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:33,734 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:11:33,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:33,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52626170] [2025-03-03 14:11:33,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52626170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:33,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:33,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:11:33,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723162663] [2025-03-03 14:11:33,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:33,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:11:33,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:33,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:11:33,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:11:33,737 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:11:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:33,805 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2025-03-03 14:11:33,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:11:33,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2025-03-03 14:11:33,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:33,806 INFO L225 Difference]: With dead ends: 80 [2025-03-03 14:11:33,807 INFO L226 Difference]: Without dead ends: 69 [2025-03-03 14:11:33,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:11:33,807 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:33,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 129 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:33,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-03 14:11:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2025-03-03 14:11:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 48 states have internal predecessors, (52), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 14:11:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2025-03-03 14:11:33,817 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 48 [2025-03-03 14:11:33,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:33,817 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2025-03-03 14:11:33,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:11:33,818 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2025-03-03 14:11:33,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 14:11:33,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:33,818 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 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-03 14:11:33,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:11:33,818 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:33,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:33,818 INFO L85 PathProgramCache]: Analyzing trace with hash -764261173, now seen corresponding path program 1 times [2025-03-03 14:11:33,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:33,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160559815] [2025-03-03 14:11:33,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:33,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:33,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 14:11:33,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 14:11:33,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:33,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 14:11:34,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:34,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160559815] [2025-03-03 14:11:34,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160559815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:34,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530659000] [2025-03-03 14:11:34,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:34,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:34,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:34,032 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:34,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:11:34,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 14:11:34,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 14:11:34,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:34,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:34,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 14:11:34,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:34,220 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-03 14:11:34,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-03 14:11:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:11:34,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:11:34,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-03-03 14:11:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:11:34,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530659000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:11:34,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:11:34,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 20 [2025-03-03 14:11:34,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061331925] [2025-03-03 14:11:34,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:11:34,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 14:11:34,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:34,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 14:11:34,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:11:34,494 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 20 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 14:11:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:34,795 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2025-03-03 14:11:34,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:11:34,795 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 47 [2025-03-03 14:11:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:34,797 INFO L225 Difference]: With dead ends: 76 [2025-03-03 14:11:34,797 INFO L226 Difference]: Without dead ends: 74 [2025-03-03 14:11:34,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:11:34,797 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:34,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 302 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:11:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-03 14:11:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2025-03-03 14:11:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 14:11:34,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2025-03-03 14:11:34,810 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 47 [2025-03-03 14:11:34,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:34,810 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2025-03-03 14:11:34,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 14:11:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2025-03-03 14:11:34,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 14:11:34,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:34,813 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 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-03 14:11:34,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:35,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:35,019 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:35,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:35,019 INFO L85 PathProgramCache]: Analyzing trace with hash -763337652, now seen corresponding path program 1 times [2025-03-03 14:11:35,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:35,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384809294] [2025-03-03 14:11:35,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:35,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:35,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 14:11:35,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 14:11:35,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:35,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:11:35,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:35,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384809294] [2025-03-03 14:11:35,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384809294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:35,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209576197] [2025-03-03 14:11:35,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:35,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:35,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:35,141 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:35,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:11:35,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 14:11:35,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 14:11:35,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:35,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:35,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:11:35,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:35,286 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-03 14:11:35,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 14:11:35,327 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:11:35,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:35,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209576197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:35,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:35,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 8 [2025-03-03 14:11:35,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923429476] [2025-03-03 14:11:35,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:35,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:11:35,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:35,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:11:35,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:11:35,328 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:11:39,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 14:11:39,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:39,424 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2025-03-03 14:11:39,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:11:39,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2025-03-03 14:11:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:39,425 INFO L225 Difference]: With dead ends: 107 [2025-03-03 14:11:39,425 INFO L226 Difference]: Without dead ends: 88 [2025-03-03 14:11:39,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:11:39,426 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 19 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:39,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 186 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-03 14:11:39,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-03 14:11:39,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2025-03-03 14:11:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.1) internal successors, (66), 63 states have internal predecessors, (66), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 14:11:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2025-03-03 14:11:39,435 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 47 [2025-03-03 14:11:39,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:39,435 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2025-03-03 14:11:39,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:11:39,435 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2025-03-03 14:11:39,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 14:11:39,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:39,436 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:11:39,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:39,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:39,637 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:39,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:39,637 INFO L85 PathProgramCache]: Analyzing trace with hash 151576953, now seen corresponding path program 1 times [2025-03-03 14:11:39,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:39,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765338380] [2025-03-03 14:11:39,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:39,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:39,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 14:11:39,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 14:11:39,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:39,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:11:39,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:39,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765338380] [2025-03-03 14:11:39,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765338380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:39,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:39,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:11:39,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000024179] [2025-03-03 14:11:39,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:39,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:11:39,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:39,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:11:39,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:11:39,806 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:11:39,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:39,911 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2025-03-03 14:11:39,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:11:39,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2025-03-03 14:11:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:39,912 INFO L225 Difference]: With dead ends: 103 [2025-03-03 14:11:39,912 INFO L226 Difference]: Without dead ends: 101 [2025-03-03 14:11:39,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:11:39,912 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:39,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 204 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-03 14:11:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-03 14:11:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 14:11:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2025-03-03 14:11:39,926 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 54 [2025-03-03 14:11:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:39,926 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2025-03-03 14:11:39,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:11:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2025-03-03 14:11:39,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 14:11:39,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:39,927 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 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-03 14:11:39,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:11:39,927 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:39,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:39,927 INFO L85 PathProgramCache]: Analyzing trace with hash 46901666, now seen corresponding path program 1 times [2025-03-03 14:11:39,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:39,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058160593] [2025-03-03 14:11:39,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:39,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:39,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 14:11:39,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 14:11:39,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:39,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:11:40,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:40,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058160593] [2025-03-03 14:11:40,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058160593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:40,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008776133] [2025-03-03 14:11:40,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:40,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:40,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:40,056 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:40,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:11:40,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 14:11:40,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 14:11:40,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:40,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:40,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:11:40,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:40,211 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-03 14:11:40,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 14:11:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:11:40,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:11:40,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-03-03 14:11:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:11:40,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008776133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:11:40,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:11:40,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2025-03-03 14:11:40,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93602181] [2025-03-03 14:11:40,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:11:40,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 14:11:40,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:40,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 14:11:40,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:11:40,436 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:11:44,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 14:11:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:44,630 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2025-03-03 14:11:44,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:11:44,630 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 54 [2025-03-03 14:11:44,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:44,631 INFO L225 Difference]: With dead ends: 112 [2025-03-03 14:11:44,631 INFO L226 Difference]: Without dead ends: 101 [2025-03-03 14:11:44,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:11:44,632 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 12 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:44,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 330 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-03 14:11:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-03 14:11:44,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2025-03-03 14:11:44,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.0625) internal successors, (68), 67 states have internal predecessors, (68), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 14:11:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2025-03-03 14:11:44,641 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 54 [2025-03-03 14:11:44,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:44,641 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2025-03-03 14:11:44,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:11:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2025-03-03 14:11:44,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 14:11:44,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:44,642 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:11:44,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:44,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 14:11:44,843 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:44,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash 806263834, now seen corresponding path program 1 times [2025-03-03 14:11:44,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:44,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495807748] [2025-03-03 14:11:44,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:44,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:44,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 14:11:44,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 14:11:44,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:44,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:11:45,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:45,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495807748] [2025-03-03 14:11:45,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495807748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:45,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:45,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:11:45,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229123875] [2025-03-03 14:11:45,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:45,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:11:45,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:45,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:11:45,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:11:45,069 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:11:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:45,252 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2025-03-03 14:11:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:11:45,252 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2025-03-03 14:11:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:45,253 INFO L225 Difference]: With dead ends: 101 [2025-03-03 14:11:45,253 INFO L226 Difference]: Without dead ends: 99 [2025-03-03 14:11:45,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:11:45,254 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:45,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 204 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:45,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-03 14:11:45,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83. [2025-03-03 14:11:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 61 states have internal predecessors, (63), 13 states have call successors, (13), 10 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 14:11:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2025-03-03 14:11:45,262 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 56 [2025-03-03 14:11:45,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:45,262 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2025-03-03 14:11:45,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:11:45,262 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2025-03-03 14:11:45,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 14:11:45,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:45,262 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:11:45,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:11:45,263 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:45,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:45,263 INFO L85 PathProgramCache]: Analyzing trace with hash 314182830, now seen corresponding path program 1 times [2025-03-03 14:11:45,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:45,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956956664] [2025-03-03 14:11:45,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:45,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:45,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 14:11:45,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 14:11:45,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:45,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:11:45,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:45,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956956664] [2025-03-03 14:11:45,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956956664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:45,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:45,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 14:11:45,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135810078] [2025-03-03 14:11:45,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:45,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:11:45,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:45,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:11:45,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:11:45,933 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:11:46,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:46,266 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2025-03-03 14:11:46,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:11:46,266 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 60 [2025-03-03 14:11:46,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:46,267 INFO L225 Difference]: With dead ends: 91 [2025-03-03 14:11:46,267 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 14:11:46,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:11:46,267 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:46,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 198 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:11:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 14:11:46,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-03 14:11:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.048780487804878) internal successors, (43), 42 states have internal predecessors, (43), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:11:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2025-03-03 14:11:46,275 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 60 [2025-03-03 14:11:46,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:46,275 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2025-03-03 14:11:46,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:11:46,275 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2025-03-03 14:11:46,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 14:11:46,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:46,276 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-03 14:11:46,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:11:46,276 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:46,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash -121083820, now seen corresponding path program 1 times [2025-03-03 14:11:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:46,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248185834] [2025-03-03 14:11:46,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:46,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:46,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 14:11:46,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 14:11:46,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:46,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:46,441 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 14:11:46,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:46,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248185834] [2025-03-03 14:11:46,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248185834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:46,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:46,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:11:46,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015577348] [2025-03-03 14:11:46,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:46,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:11:46,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:46,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:11:46,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:11:46,442 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:11:46,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:46,533 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2025-03-03 14:11:46,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:11:46,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2025-03-03 14:11:46,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:46,533 INFO L225 Difference]: With dead ends: 63 [2025-03-03 14:11:46,533 INFO L226 Difference]: Without dead ends: 59 [2025-03-03 14:11:46,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:11:46,534 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:46,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 175 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-03 14:11:46,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-03 14:11:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:11:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2025-03-03 14:11:46,542 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 60 [2025-03-03 14:11:46,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:46,542 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2025-03-03 14:11:46,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:11:46,543 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2025-03-03 14:11:46,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:11:46,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:46,543 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:11:46,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:11:46,543 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:46,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:46,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1154366647, now seen corresponding path program 1 times [2025-03-03 14:11:46,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:46,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267324153] [2025-03-03 14:11:46,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:46,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:46,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:11:46,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:11:46,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:46,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:11:49,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:49,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267324153] [2025-03-03 14:11:49,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267324153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:49,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511833220] [2025-03-03 14:11:49,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:49,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:49,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:49,632 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:49,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:11:49,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:11:49,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:11:49,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:49,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:49,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-03 14:11:49,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:49,732 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 7 treesize of output 6 [2025-03-03 14:11:50,285 INFO L349 Elim1Store]: treesize reduction 49, result has 15.5 percent of original size [2025-03-03 14:11:50,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 53 [2025-03-03 14:11:50,304 INFO L349 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2025-03-03 14:11:50,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2025-03-03 14:11:51,804 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 11 treesize of output 7 [2025-03-03 14:11:51,809 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 11 treesize of output 7 [2025-03-03 14:12:03,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 92 [2025-03-03 14:12:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:12:03,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:12:03,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2025-03-03 14:12:03,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 130 [2025-03-03 14:12:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:12:06,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511833220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:12:06,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:12:06,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 14] total 46 [2025-03-03 14:12:06,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302320898] [2025-03-03 14:12:06,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:12:06,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-03 14:12:06,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:12:06,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-03 14:12:06,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1828, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 14:12:06,557 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 46 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 43 states have internal predecessors, (82), 8 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22)