./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product28.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec3_product28.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 cb2818f0d8bce3a3c55c338823c603b0097898f29d2ecfaf46bb61225da928d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:47:20,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:47:20,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:47:20,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:47:20,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:47:20,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:47:20,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:47:20,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:47:20,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:47:20,791 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:47:20,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:47:20,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:47:20,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:47:20,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:47:20,792 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:47:20,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:47:20,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:47:20,792 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:47:20,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:47:20,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:47:20,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:47:20,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:47:20,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:47:20,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:47:20,793 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:47:20,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:47:20,793 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:47:20,793 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:47:20,793 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:47:20,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:47:20,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:47:20,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:47:20,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:47:20,794 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:47:20,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:47:20,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:47:20,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:47:20,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:47:20,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:47:20,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:47:20,794 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:47:20,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:47:20,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:47:20,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:47:20,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:47:20,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:47:20,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:47:20,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:47:20,795 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-jdk21/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 -> cb2818f0d8bce3a3c55c338823c603b0097898f29d2ecfaf46bb61225da928d8 [2025-01-09 03:47:21,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:47:21,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:47:21,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:47:21,040 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:47:21,040 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:47:21,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product28.cil.c [2025-01-09 03:47:22,293 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ffc656e8d/57325076878a41328b425d81efd1af9f/FLAG43babb887 [2025-01-09 03:47:22,709 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:47:22,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product28.cil.c [2025-01-09 03:47:22,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ffc656e8d/57325076878a41328b425d81efd1af9f/FLAG43babb887 [2025-01-09 03:47:22,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ffc656e8d/57325076878a41328b425d81efd1af9f [2025-01-09 03:47:22,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:47:22,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:47:22,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:47:22,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:47:22,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:47:22,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:47:22" (1/1) ... [2025-01-09 03:47:22,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12bdde71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:22, skipping insertion in model container [2025-01-09 03:47:22,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:47:22" (1/1) ... [2025-01-09 03:47:22,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:47:23,308 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product28.cil.c[73221,73234] [2025-01-09 03:47:23,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:47:23,332 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:47:23,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [48] [2025-01-09 03:47:23,340 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [242] [2025-01-09 03:47:23,340 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1847] [2025-01-09 03:47:23,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2213] [2025-01-09 03:47:23,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2231] [2025-01-09 03:47:23,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2350] [2025-01-09 03:47:23,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2703] [2025-01-09 03:47:23,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3364] [2025-01-09 03:47:23,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3455] [2025-01-09 03:47:23,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3464] [2025-01-09 03:47:23,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product28.cil.c[73221,73234] [2025-01-09 03:47:23,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:47:23,474 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:47:23,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:23 WrapperNode [2025-01-09 03:47:23,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:47:23,477 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:47:23,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:47:23,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:47:23,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:23" (1/1) ... [2025-01-09 03:47:23,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:23" (1/1) ... [2025-01-09 03:47:23,553 INFO L138 Inliner]: procedures = 95, calls = 354, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 1152 [2025-01-09 03:47:23,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:47:23,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:47:23,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:47:23,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:47:23,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:23" (1/1) ... [2025-01-09 03:47:23,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:23" (1/1) ... [2025-01-09 03:47:23,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:23" (1/1) ... [2025-01-09 03:47:23,582 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-01-09 03:47:23,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:23" (1/1) ... [2025-01-09 03:47:23,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:23" (1/1) ... [2025-01-09 03:47:23,607 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:23" (1/1) ... [2025-01-09 03:47:23,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:23" (1/1) ... [2025-01-09 03:47:23,622 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:23" (1/1) ... [2025-01-09 03:47:23,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:23" (1/1) ... [2025-01-09 03:47:23,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:23" (1/1) ... [2025-01-09 03:47:23,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:47:23,644 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:47:23,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:47:23,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:47:23,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:23" (1/1) ... [2025-01-09 03:47:23,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:47:23,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:47:23,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:47:23,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:47:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:47:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-01-09 03:47:23,707 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-01-09 03:47:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-01-09 03:47:23,707 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-01-09 03:47:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:47:23,707 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:47:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-01-09 03:47:23,708 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-01-09 03:47:23,708 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:47:23,708 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:47:23,708 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-01-09 03:47:23,708 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-01-09 03:47:23,709 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:47:23,709 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:47:23,709 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:47:23,709 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:47:23,709 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:47:23,710 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:47:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:47:23,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:47:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:47:23,711 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:47:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:47:23,711 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:47:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:47:23,711 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:47:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-01-09 03:47:23,711 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-01-09 03:47:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-01-09 03:47:23,711 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-01-09 03:47:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:47:23,711 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:47:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-01-09 03:47:23,711 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-01-09 03:47:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:47:23,711 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:47:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-01-09 03:47:23,711 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-01-09 03:47:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:47:23,711 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:47:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:47:23,711 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:47:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:47:23,711 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:47:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:47:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-01-09 03:47:23,712 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:47:23,712 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:47:23,712 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:47:23,712 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:47:23,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:47:23,712 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:47:23,712 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2025-01-09 03:47:23,712 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2025-01-09 03:47:23,895 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:47:23,896 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:47:25,002 INFO L? ?]: Removed 473 outVars from TransFormulas that were not future-live. [2025-01-09 03:47:25,002 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:47:25,018 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:47:25,018 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:47:25,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:47:25 BoogieIcfgContainer [2025-01-09 03:47:25,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:47:25,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:47:25,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:47:25,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:47:25,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:47:22" (1/3) ... [2025-01-09 03:47:25,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf42199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:47:25, skipping insertion in model container [2025-01-09 03:47:25,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:23" (2/3) ... [2025-01-09 03:47:25,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf42199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:47:25, skipping insertion in model container [2025-01-09 03:47:25,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:47:25" (3/3) ... [2025-01-09 03:47:25,025 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product28.cil.c [2025-01-09 03:47:25,035 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:47:25,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product28.cil.c that has 29 procedures, 605 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:47:25,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:47:25,090 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;@42848fa7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:47:25,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:47:25,094 INFO L276 IsEmpty]: Start isEmpty. Operand has 605 states, 465 states have (on average 1.6666666666666667) internal successors, (775), 485 states have internal predecessors, (775), 110 states have call successors, (110), 28 states have call predecessors, (110), 28 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2025-01-09 03:47:25,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 03:47:25,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:25,101 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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-01-09 03:47:25,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:25,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:25,104 INFO L85 PathProgramCache]: Analyzing trace with hash -290032334, now seen corresponding path program 1 times [2025-01-09 03:47:25,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:25,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238364885] [2025-01-09 03:47:25,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:25,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:25,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 03:47:25,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 03:47:25,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:25,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:25,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:25,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238364885] [2025-01-09 03:47:25,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238364885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:25,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:25,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:25,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309103965] [2025-01-09 03:47:25,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:25,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:25,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:25,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:25,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:25,767 INFO L87 Difference]: Start difference. First operand has 605 states, 465 states have (on average 1.6666666666666667) internal successors, (775), 485 states have internal predecessors, (775), 110 states have call successors, (110), 28 states have call predecessors, (110), 28 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:25,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:25,970 INFO L93 Difference]: Finished difference Result 1207 states and 2002 transitions. [2025-01-09 03:47:25,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:47:25,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 67 [2025-01-09 03:47:25,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:25,994 INFO L225 Difference]: With dead ends: 1207 [2025-01-09 03:47:25,994 INFO L226 Difference]: Without dead ends: 610 [2025-01-09 03:47:26,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:47:26,011 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 91 mSDsluCounter, 4805 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5783 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:26,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5783 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:47:26,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-01-09 03:47:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 608. [2025-01-09 03:47:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 468 states have (on average 1.6602564102564104) internal successors, (777), 488 states have internal predecessors, (777), 111 states have call successors, (111), 28 states have call predecessors, (111), 28 states have return successors, (110), 105 states have call predecessors, (110), 108 states have call successors, (110) [2025-01-09 03:47:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 998 transitions. [2025-01-09 03:47:26,120 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 998 transitions. Word has length 67 [2025-01-09 03:47:26,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:26,120 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 998 transitions. [2025-01-09 03:47:26,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:26,121 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 998 transitions. [2025-01-09 03:47:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 03:47:26,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:26,128 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:26,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:47:26,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:26,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:26,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1645578796, now seen corresponding path program 1 times [2025-01-09 03:47:26,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:26,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585727817] [2025-01-09 03:47:26,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:26,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:26,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:47:26,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:47:26,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:26,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:26,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:26,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585727817] [2025-01-09 03:47:26,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585727817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:26,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:26,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:26,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765040051] [2025-01-09 03:47:26,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:26,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:26,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:26,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:26,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:26,414 INFO L87 Difference]: Start difference. First operand 608 states and 998 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:26,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:26,541 INFO L93 Difference]: Finished difference Result 1211 states and 1999 transitions. [2025-01-09 03:47:26,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:47:26,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2025-01-09 03:47:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:26,548 INFO L225 Difference]: With dead ends: 1211 [2025-01-09 03:47:26,548 INFO L226 Difference]: Without dead ends: 619 [2025-01-09 03:47:26,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:47:26,552 INFO L435 NwaCegarLoop]: 979 mSDtfsCounter, 90 mSDsluCounter, 4799 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 5778 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:26,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 5778 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:47:26,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-01-09 03:47:26,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 608. [2025-01-09 03:47:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 468 states have (on average 1.6602564102564104) internal successors, (777), 488 states have internal predecessors, (777), 111 states have call successors, (111), 28 states have call predecessors, (111), 28 states have return successors, (110), 105 states have call predecessors, (110), 108 states have call successors, (110) [2025-01-09 03:47:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 998 transitions. [2025-01-09 03:47:26,617 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 998 transitions. Word has length 68 [2025-01-09 03:47:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:26,617 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 998 transitions. [2025-01-09 03:47:26,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:26,617 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 998 transitions. [2025-01-09 03:47:26,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 03:47:26,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:26,619 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:26,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:47:26,620 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:26,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:26,620 INFO L85 PathProgramCache]: Analyzing trace with hash -546250912, now seen corresponding path program 1 times [2025-01-09 03:47:26,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:26,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390051167] [2025-01-09 03:47:26,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:26,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:26,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:47:26,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:47:26,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:26,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:26,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:26,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390051167] [2025-01-09 03:47:26,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390051167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:26,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:26,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:26,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417198755] [2025-01-09 03:47:26,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:26,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:26,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:26,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:26,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:26,811 INFO L87 Difference]: Start difference. First operand 608 states and 998 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:26,872 INFO L93 Difference]: Finished difference Result 1198 states and 1977 transitions. [2025-01-09 03:47:26,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:47:26,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2025-01-09 03:47:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:26,877 INFO L225 Difference]: With dead ends: 1198 [2025-01-09 03:47:26,877 INFO L226 Difference]: Without dead ends: 578 [2025-01-09 03:47:26,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:47:26,881 INFO L435 NwaCegarLoop]: 968 mSDtfsCounter, 14 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2899 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:26,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2899 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-01-09 03:47:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2025-01-09 03:47:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 441 states have (on average 1.6439909297052153) internal successors, (725), 459 states have internal predecessors, (725), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 03:47:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 942 transitions. [2025-01-09 03:47:26,906 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 942 transitions. Word has length 68 [2025-01-09 03:47:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:26,908 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 942 transitions. [2025-01-09 03:47:26,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 942 transitions. [2025-01-09 03:47:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 03:47:26,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:26,910 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:26,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:47:26,911 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:26,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:26,911 INFO L85 PathProgramCache]: Analyzing trace with hash 555688086, now seen corresponding path program 1 times [2025-01-09 03:47:26,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:26,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473133399] [2025-01-09 03:47:26,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:26,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:26,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 03:47:26,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 03:47:26,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:26,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:27,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:27,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473133399] [2025-01-09 03:47:27,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473133399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:27,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:27,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:27,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701373419] [2025-01-09 03:47:27,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:27,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:27,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:27,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:27,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:27,137 INFO L87 Difference]: Start difference. First operand 578 states and 942 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:27,215 INFO L93 Difference]: Finished difference Result 1149 states and 1883 transitions. [2025-01-09 03:47:27,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:47:27,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2025-01-09 03:47:27,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:27,222 INFO L225 Difference]: With dead ends: 1149 [2025-01-09 03:47:27,222 INFO L226 Difference]: Without dead ends: 572 [2025-01-09 03:47:27,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:47:27,227 INFO L435 NwaCegarLoop]: 932 mSDtfsCounter, 63 mSDsluCounter, 4602 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5534 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:27,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5534 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:27,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-01-09 03:47:27,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-01-09 03:47:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 435 states have (on average 1.6367816091954024) internal successors, (712), 453 states have internal predecessors, (712), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 03:47:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 929 transitions. [2025-01-09 03:47:27,258 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 929 transitions. Word has length 69 [2025-01-09 03:47:27,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:27,259 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 929 transitions. [2025-01-09 03:47:27,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 929 transitions. [2025-01-09 03:47:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 03:47:27,260 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:27,260 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:27,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:47:27,260 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:27,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:27,262 INFO L85 PathProgramCache]: Analyzing trace with hash 164520848, now seen corresponding path program 1 times [2025-01-09 03:47:27,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:27,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802866717] [2025-01-09 03:47:27,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:27,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:27,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 03:47:27,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 03:47:27,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:27,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:27,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:27,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802866717] [2025-01-09 03:47:27,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802866717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:27,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:27,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:27,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848713504] [2025-01-09 03:47:27,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:27,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:27,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:27,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:27,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:27,457 INFO L87 Difference]: Start difference. First operand 572 states and 929 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:27,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:27,530 INFO L93 Difference]: Finished difference Result 1137 states and 1857 transitions. [2025-01-09 03:47:27,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:47:27,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-01-09 03:47:27,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:27,536 INFO L225 Difference]: With dead ends: 1137 [2025-01-09 03:47:27,536 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 03:47:27,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:47:27,540 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 49 mSDsluCounter, 4554 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5474 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:27,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5474 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 03:47:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-01-09 03:47:27,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 429 states have (on average 1.6293706293706294) internal successors, (699), 447 states have internal predecessors, (699), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 03:47:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 916 transitions. [2025-01-09 03:47:27,559 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 916 transitions. Word has length 70 [2025-01-09 03:47:27,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:27,559 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 916 transitions. [2025-01-09 03:47:27,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:27,559 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 916 transitions. [2025-01-09 03:47:27,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 03:47:27,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:27,560 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:27,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:47:27,561 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:27,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:27,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1059410641, now seen corresponding path program 1 times [2025-01-09 03:47:27,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:27,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104753220] [2025-01-09 03:47:27,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:27,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:27,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 03:47:27,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 03:47:27,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:27,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:27,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:27,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:27,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104753220] [2025-01-09 03:47:27,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104753220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:27,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:27,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:27,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788864758] [2025-01-09 03:47:27,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:27,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:27,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:27,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:27,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:27,699 INFO L87 Difference]: Start difference. First operand 566 states and 916 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:27,756 INFO L93 Difference]: Finished difference Result 1125 states and 1831 transitions. [2025-01-09 03:47:27,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:47:27,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-01-09 03:47:27,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:27,761 INFO L225 Difference]: With dead ends: 1125 [2025-01-09 03:47:27,761 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 03:47:27,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:47:27,764 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 24 mSDsluCounter, 4518 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5426 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:27,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5426 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 03:47:27,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-01-09 03:47:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 429 states have (on average 1.627039627039627) internal successors, (698), 447 states have internal predecessors, (698), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 03:47:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 915 transitions. [2025-01-09 03:47:27,814 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 915 transitions. Word has length 70 [2025-01-09 03:47:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:27,815 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 915 transitions. [2025-01-09 03:47:27,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 915 transitions. [2025-01-09 03:47:27,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 03:47:27,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:27,816 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:27,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:47:27,816 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:27,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:27,817 INFO L85 PathProgramCache]: Analyzing trace with hash -41055238, now seen corresponding path program 1 times [2025-01-09 03:47:27,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:27,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326606578] [2025-01-09 03:47:27,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:27,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:27,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 03:47:27,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 03:47:27,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:27,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:27,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:27,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:27,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326606578] [2025-01-09 03:47:27,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326606578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:27,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:27,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:27,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664494034] [2025-01-09 03:47:27,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:27,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:27,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:27,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:27,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:27,906 INFO L87 Difference]: Start difference. First operand 566 states and 915 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:27,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:27,946 INFO L93 Difference]: Finished difference Result 1116 states and 1816 transitions. [2025-01-09 03:47:27,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:27,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-01-09 03:47:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:27,950 INFO L225 Difference]: With dead ends: 1116 [2025-01-09 03:47:27,950 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 03:47:27,953 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-01-09 03:47:27,953 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 15 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2685 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:27,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2685 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:27,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 03:47:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-01-09 03:47:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 429 states have (on average 1.6247086247086246) internal successors, (697), 447 states have internal predecessors, (697), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 03:47:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 914 transitions. [2025-01-09 03:47:27,969 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 914 transitions. Word has length 71 [2025-01-09 03:47:27,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:27,970 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 914 transitions. [2025-01-09 03:47:27,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 914 transitions. [2025-01-09 03:47:27,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 03:47:27,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:27,970 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:27,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:47:27,971 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:27,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:27,971 INFO L85 PathProgramCache]: Analyzing trace with hash 886585776, now seen corresponding path program 1 times [2025-01-09 03:47:27,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:27,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677561377] [2025-01-09 03:47:27,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:27,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:27,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 03:47:27,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 03:47:27,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:27,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:28,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:28,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677561377] [2025-01-09 03:47:28,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677561377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:28,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:28,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:28,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998167465] [2025-01-09 03:47:28,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:28,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:28,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:28,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:28,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:28,049 INFO L87 Difference]: Start difference. First operand 566 states and 914 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:28,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:28,089 INFO L93 Difference]: Finished difference Result 1116 states and 1814 transitions. [2025-01-09 03:47:28,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:28,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2025-01-09 03:47:28,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:28,095 INFO L225 Difference]: With dead ends: 1116 [2025-01-09 03:47:28,095 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 03:47:28,097 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-01-09 03:47:28,098 INFO L435 NwaCegarLoop]: 901 mSDtfsCounter, 14 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:28,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2687 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:28,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 03:47:28,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-01-09 03:47:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 429 states have (on average 1.6223776223776223) internal successors, (696), 447 states have internal predecessors, (696), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 03:47:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 913 transitions. [2025-01-09 03:47:28,117 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 913 transitions. Word has length 72 [2025-01-09 03:47:28,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:28,117 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 913 transitions. [2025-01-09 03:47:28,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:28,117 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 913 transitions. [2025-01-09 03:47:28,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 03:47:28,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:28,118 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:28,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:47:28,118 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:28,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:28,118 INFO L85 PathProgramCache]: Analyzing trace with hash -739764481, now seen corresponding path program 1 times [2025-01-09 03:47:28,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:28,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844153844] [2025-01-09 03:47:28,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:28,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:28,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 03:47:28,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 03:47:28,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:28,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:28,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:28,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844153844] [2025-01-09 03:47:28,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844153844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:28,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:28,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:28,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809575192] [2025-01-09 03:47:28,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:28,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:28,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:28,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:28,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:28,227 INFO L87 Difference]: Start difference. First operand 566 states and 913 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:28,268 INFO L93 Difference]: Finished difference Result 1116 states and 1812 transitions. [2025-01-09 03:47:28,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:28,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-01-09 03:47:28,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:28,275 INFO L225 Difference]: With dead ends: 1116 [2025-01-09 03:47:28,275 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 03:47:28,278 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-01-09 03:47:28,279 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 13 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2689 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:28,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2689 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:28,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 03:47:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-01-09 03:47:28,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 429 states have (on average 1.6200466200466201) internal successors, (695), 447 states have internal predecessors, (695), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 03:47:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 912 transitions. [2025-01-09 03:47:28,301 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 912 transitions. Word has length 73 [2025-01-09 03:47:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:28,301 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 912 transitions. [2025-01-09 03:47:28,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:28,302 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 912 transitions. [2025-01-09 03:47:28,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 03:47:28,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:28,303 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:28,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:47:28,303 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:28,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:28,304 INFO L85 PathProgramCache]: Analyzing trace with hash 64534485, now seen corresponding path program 1 times [2025-01-09 03:47:28,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:28,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221422406] [2025-01-09 03:47:28,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:28,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:28,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 03:47:28,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 03:47:28,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:28,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:28,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:28,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221422406] [2025-01-09 03:47:28,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221422406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:28,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:28,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:28,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150230808] [2025-01-09 03:47:28,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:28,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:28,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:28,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:28,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:28,409 INFO L87 Difference]: Start difference. First operand 566 states and 912 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:28,451 INFO L93 Difference]: Finished difference Result 1116 states and 1810 transitions. [2025-01-09 03:47:28,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:28,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-01-09 03:47:28,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:28,457 INFO L225 Difference]: With dead ends: 1116 [2025-01-09 03:47:28,457 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 03:47:28,460 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-01-09 03:47:28,460 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 12 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2691 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:28,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2691 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 03:47:28,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-01-09 03:47:28,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 429 states have (on average 1.6177156177156178) internal successors, (694), 447 states have internal predecessors, (694), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 03:47:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 911 transitions. [2025-01-09 03:47:28,481 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 911 transitions. Word has length 74 [2025-01-09 03:47:28,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:28,481 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 911 transitions. [2025-01-09 03:47:28,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:47:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 911 transitions. [2025-01-09 03:47:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 03:47:28,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:28,482 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:28,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:47:28,483 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:28,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:28,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1090451964, now seen corresponding path program 1 times [2025-01-09 03:47:28,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:28,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474132094] [2025-01-09 03:47:28,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:28,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:28,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 03:47:28,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 03:47:28,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:28,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 03:47:28,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:28,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474132094] [2025-01-09 03:47:28,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474132094] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:47:28,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481048835] [2025-01-09 03:47:28,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:28,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:47:28,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:47:28,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:47:28,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:47:28,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 03:47:28,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 03:47:28,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:28,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:28,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:47:28,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:47:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:47:28,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:47:28,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481048835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:28,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:47:29,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-01-09 03:47:29,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229779491] [2025-01-09 03:47:29,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:29,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:47:29,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:29,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:47:29,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:47:29,001 INFO L87 Difference]: Start difference. First operand 566 states and 911 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:29,052 INFO L93 Difference]: Finished difference Result 1609 states and 2621 transitions. [2025-01-09 03:47:29,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:47:29,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2025-01-09 03:47:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:29,059 INFO L225 Difference]: With dead ends: 1609 [2025-01-09 03:47:29,060 INFO L226 Difference]: Without dead ends: 1061 [2025-01-09 03:47:29,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:47:29,063 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 873 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:29,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 2351 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:29,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-01-09 03:47:29,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1046. [2025-01-09 03:47:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 800 states have (on average 1.63) internal successors, (1304), 835 states have internal predecessors, (1304), 195 states have call successors, (195), 51 states have call predecessors, (195), 50 states have return successors, (197), 187 states have call predecessors, (197), 192 states have call successors, (197) [2025-01-09 03:47:29,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1696 transitions. [2025-01-09 03:47:29,097 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1696 transitions. Word has length 75 [2025-01-09 03:47:29,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:29,097 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1696 transitions. [2025-01-09 03:47:29,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1696 transitions. [2025-01-09 03:47:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 03:47:29,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:29,098 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:29,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:47:29,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 03:47:29,303 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:29,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:29,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1087297839, now seen corresponding path program 1 times [2025-01-09 03:47:29,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:29,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923369431] [2025-01-09 03:47:29,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:29,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:29,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 03:47:29,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 03:47:29,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:29,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 03:47:29,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:29,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923369431] [2025-01-09 03:47:29,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923369431] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:47:29,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493160221] [2025-01-09 03:47:29,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:29,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:47:29,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:47:29,469 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:47:29,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:47:29,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 03:47:29,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 03:47:29,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:29,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:29,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:47:29,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:47:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:47:29,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:47:29,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493160221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:29,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:47:29,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-01-09 03:47:29,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697543131] [2025-01-09 03:47:29,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:29,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:47:29,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:29,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:47:29,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:47:29,770 INFO L87 Difference]: Start difference. First operand 1046 states and 1696 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:29,865 INFO L93 Difference]: Finished difference Result 2569 states and 4193 transitions. [2025-01-09 03:47:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:47:29,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2025-01-09 03:47:29,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:29,875 INFO L225 Difference]: With dead ends: 2569 [2025-01-09 03:47:29,876 INFO L226 Difference]: Without dead ends: 1541 [2025-01-09 03:47:29,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:47:29,881 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 871 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 2412 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:29,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 2412 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:29,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2025-01-09 03:47:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1493. [2025-01-09 03:47:29,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1144 states have (on average 1.6416083916083917) internal successors, (1878), 1196 states have internal predecessors, (1878), 277 states have call successors, (277), 71 states have call predecessors, (277), 71 states have return successors, (284), 267 states have call predecessors, (284), 274 states have call successors, (284) [2025-01-09 03:47:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2439 transitions. [2025-01-09 03:47:29,940 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2439 transitions. Word has length 76 [2025-01-09 03:47:29,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:29,941 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 2439 transitions. [2025-01-09 03:47:29,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:47:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2439 transitions. [2025-01-09 03:47:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 03:47:29,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:29,942 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:29,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:47:30,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:47:30,147 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:30,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:30,148 INFO L85 PathProgramCache]: Analyzing trace with hash 760482369, now seen corresponding path program 1 times [2025-01-09 03:47:30,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:30,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900104453] [2025-01-09 03:47:30,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:30,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:30,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 03:47:30,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 03:47:30,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:30,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:30,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:30,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900104453] [2025-01-09 03:47:30,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900104453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:30,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:30,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:30,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811970268] [2025-01-09 03:47:30,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:30,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:30,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:30,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:30,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:30,259 INFO L87 Difference]: Start difference. First operand 1493 states and 2439 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:47:30,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:30,776 INFO L93 Difference]: Finished difference Result 4415 states and 7360 transitions. [2025-01-09 03:47:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:47:30,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2025-01-09 03:47:30,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:30,797 INFO L225 Difference]: With dead ends: 4415 [2025-01-09 03:47:30,798 INFO L226 Difference]: Without dead ends: 2940 [2025-01-09 03:47:30,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:47:30,806 INFO L435 NwaCegarLoop]: 1048 mSDtfsCounter, 904 mSDsluCounter, 3757 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 4805 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:30,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 4805 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:47:30,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2025-01-09 03:47:30,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2893. [2025-01-09 03:47:30,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2893 states, 2221 states have (on average 1.644754615038271) internal successors, (3653), 2321 states have internal predecessors, (3653), 533 states have call successors, (533), 136 states have call predecessors, (533), 138 states have return successors, (639), 519 states have call predecessors, (639), 529 states have call successors, (639) [2025-01-09 03:47:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 4825 transitions. [2025-01-09 03:47:30,955 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 4825 transitions. Word has length 78 [2025-01-09 03:47:30,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:30,955 INFO L471 AbstractCegarLoop]: Abstraction has 2893 states and 4825 transitions. [2025-01-09 03:47:30,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:47:30,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 4825 transitions. [2025-01-09 03:47:30,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 03:47:30,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:30,956 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:30,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:47:30,957 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:30,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:30,957 INFO L85 PathProgramCache]: Analyzing trace with hash -826270426, now seen corresponding path program 1 times [2025-01-09 03:47:30,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:30,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882560248] [2025-01-09 03:47:30,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:30,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:30,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 03:47:30,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 03:47:30,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:30,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:31,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 03:47:31,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:31,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882560248] [2025-01-09 03:47:31,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882560248] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:47:31,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466050219] [2025-01-09 03:47:31,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:31,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:47:31,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:47:31,110 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:47:31,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:47:31,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 03:47:31,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 03:47:31,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:31,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:31,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 03:47:31,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:47:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:47:31,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:47:31,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466050219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:31,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:47:31,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-01-09 03:47:31,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538419983] [2025-01-09 03:47:31,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:31,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:31,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:31,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:31,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:47:31,471 INFO L87 Difference]: Start difference. First operand 2893 states and 4825 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:47:32,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:32,244 INFO L93 Difference]: Finished difference Result 7826 states and 13240 transitions. [2025-01-09 03:47:32,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:47:32,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 79 [2025-01-09 03:47:32,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:32,279 INFO L225 Difference]: With dead ends: 7826 [2025-01-09 03:47:32,280 INFO L226 Difference]: Without dead ends: 4951 [2025-01-09 03:47:32,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-01-09 03:47:32,299 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 769 mSDsluCounter, 3353 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 4279 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:32,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 4279 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 03:47:32,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2025-01-09 03:47:32,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 4908. [2025-01-09 03:47:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4908 states, 3762 states have (on average 1.5980861244019138) internal successors, (6012), 3928 states have internal predecessors, (6012), 894 states have call successors, (894), 244 states have call predecessors, (894), 251 states have return successors, (1180), 875 states have call predecessors, (1180), 888 states have call successors, (1180) [2025-01-09 03:47:32,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4908 states to 4908 states and 8086 transitions. [2025-01-09 03:47:32,502 INFO L78 Accepts]: Start accepts. Automaton has 4908 states and 8086 transitions. Word has length 79 [2025-01-09 03:47:32,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:32,503 INFO L471 AbstractCegarLoop]: Abstraction has 4908 states and 8086 transitions. [2025-01-09 03:47:32,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:47:32,507 INFO L276 IsEmpty]: Start isEmpty. Operand 4908 states and 8086 transitions. [2025-01-09 03:47:32,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 03:47:32,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:32,507 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:32,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:47:32,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:47:32,708 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:32,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:32,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1825120048, now seen corresponding path program 1 times [2025-01-09 03:47:32,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:32,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433534651] [2025-01-09 03:47:32,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:32,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:32,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 03:47:32,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 03:47:32,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:32,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:32,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:32,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433534651] [2025-01-09 03:47:32,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433534651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:32,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:32,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:32,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79701338] [2025-01-09 03:47:32,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:32,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:32,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:32,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:32,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:32,812 INFO L87 Difference]: Start difference. First operand 4908 states and 8086 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:33,026 INFO L93 Difference]: Finished difference Result 9822 states and 16337 transitions. [2025-01-09 03:47:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:47:33,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2025-01-09 03:47:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:33,069 INFO L225 Difference]: With dead ends: 9822 [2025-01-09 03:47:33,069 INFO L226 Difference]: Without dead ends: 4932 [2025-01-09 03:47:33,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:47:33,101 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 12 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2657 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:33,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2657 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4932 states. [2025-01-09 03:47:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4932 to 4916. [2025-01-09 03:47:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4916 states, 3768 states have (on average 1.5966029723991508) internal successors, (6016), 3934 states have internal predecessors, (6016), 894 states have call successors, (894), 248 states have call predecessors, (894), 253 states have return successors, (1167), 873 states have call predecessors, (1167), 888 states have call successors, (1167) [2025-01-09 03:47:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4916 states to 4916 states and 8077 transitions. [2025-01-09 03:47:33,287 INFO L78 Accepts]: Start accepts. Automaton has 4916 states and 8077 transitions. Word has length 79 [2025-01-09 03:47:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:33,287 INFO L471 AbstractCegarLoop]: Abstraction has 4916 states and 8077 transitions. [2025-01-09 03:47:33,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 4916 states and 8077 transitions. [2025-01-09 03:47:33,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 03:47:33,324 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:33,324 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:33,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:47:33,324 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:33,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:33,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1267036665, now seen corresponding path program 1 times [2025-01-09 03:47:33,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:33,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527287123] [2025-01-09 03:47:33,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:33,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:33,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 03:47:33,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 03:47:33,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:33,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 03:47:33,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:33,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527287123] [2025-01-09 03:47:33,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527287123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:33,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:33,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:33,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35890724] [2025-01-09 03:47:33,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:33,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:33,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:33,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:33,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:33,445 INFO L87 Difference]: Start difference. First operand 4916 states and 8077 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:47:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:34,132 INFO L93 Difference]: Finished difference Result 14699 states and 24989 transitions. [2025-01-09 03:47:34,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:47:34,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-01-09 03:47:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:34,205 INFO L225 Difference]: With dead ends: 14699 [2025-01-09 03:47:34,206 INFO L226 Difference]: Without dead ends: 9801 [2025-01-09 03:47:34,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:47:34,227 INFO L435 NwaCegarLoop]: 979 mSDtfsCounter, 902 mSDsluCounter, 3560 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:34,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 4539 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:47:34,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9801 states. [2025-01-09 03:47:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9801 to 9732. [2025-01-09 03:47:34,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9732 states, 7466 states have (on average 1.5942941334047682) internal successors, (11903), 7792 states have internal predecessors, (11903), 1760 states have call successors, (1760), 490 states have call predecessors, (1760), 505 states have return successors, (2771), 1729 states have call predecessors, (2771), 1750 states have call successors, (2771) [2025-01-09 03:47:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9732 states to 9732 states and 16434 transitions. [2025-01-09 03:47:34,715 INFO L78 Accepts]: Start accepts. Automaton has 9732 states and 16434 transitions. Word has length 87 [2025-01-09 03:47:34,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:34,715 INFO L471 AbstractCegarLoop]: Abstraction has 9732 states and 16434 transitions. [2025-01-09 03:47:34,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:47:34,715 INFO L276 IsEmpty]: Start isEmpty. Operand 9732 states and 16434 transitions. [2025-01-09 03:47:34,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 03:47:34,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:34,716 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:34,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:47:34,717 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:34,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:34,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1066401774, now seen corresponding path program 1 times [2025-01-09 03:47:34,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:34,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759127023] [2025-01-09 03:47:34,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:34,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:34,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 03:47:34,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 03:47:34,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:34,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:47:34,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:34,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759127023] [2025-01-09 03:47:34,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759127023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:34,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:34,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:34,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345504379] [2025-01-09 03:47:34,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:34,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:34,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:34,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:34,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:34,795 INFO L87 Difference]: Start difference. First operand 9732 states and 16434 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:47:35,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:35,187 INFO L93 Difference]: Finished difference Result 19518 states and 33421 transitions. [2025-01-09 03:47:35,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:47:35,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2025-01-09 03:47:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:35,253 INFO L225 Difference]: With dead ends: 19518 [2025-01-09 03:47:35,254 INFO L226 Difference]: Without dead ends: 9804 [2025-01-09 03:47:35,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:47:35,403 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 12 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:35,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2651 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:35,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9804 states. [2025-01-09 03:47:35,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9804 to 9772. [2025-01-09 03:47:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9772 states, 7502 states have (on average 1.5919754732071447) internal successors, (11943), 7820 states have internal predecessors, (11943), 1760 states have call successors, (1760), 506 states have call predecessors, (1760), 509 states have return successors, (2751), 1725 states have call predecessors, (2751), 1750 states have call successors, (2751) [2025-01-09 03:47:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9772 states to 9772 states and 16454 transitions. [2025-01-09 03:47:35,727 INFO L78 Accepts]: Start accepts. Automaton has 9772 states and 16454 transitions. Word has length 88 [2025-01-09 03:47:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:35,729 INFO L471 AbstractCegarLoop]: Abstraction has 9772 states and 16454 transitions. [2025-01-09 03:47:35,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:47:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 9772 states and 16454 transitions. [2025-01-09 03:47:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 03:47:35,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:35,730 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:35,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:47:35,730 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:35,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:35,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2117579982, now seen corresponding path program 1 times [2025-01-09 03:47:35,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:35,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279470571] [2025-01-09 03:47:35,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:35,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:35,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 03:47:35,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 03:47:35,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:35,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:35,864 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:47:35,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:35,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279470571] [2025-01-09 03:47:35,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279470571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:35,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:35,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:35,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839536553] [2025-01-09 03:47:35,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:35,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:35,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:35,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:35,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:35,865 INFO L87 Difference]: Start difference. First operand 9772 states and 16454 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:47:36,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:36,969 INFO L93 Difference]: Finished difference Result 29339 states and 51966 transitions. [2025-01-09 03:47:36,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:47:36,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2025-01-09 03:47:36,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:37,094 INFO L225 Difference]: With dead ends: 29339 [2025-01-09 03:47:37,095 INFO L226 Difference]: Without dead ends: 19585 [2025-01-09 03:47:37,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:47:37,145 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 896 mSDsluCounter, 3669 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 4682 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:37,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 4682 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 03:47:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19585 states. [2025-01-09 03:47:37,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19585 to 19484. [2025-01-09 03:47:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19484 states, 14964 states have (on average 1.5892141138732958) internal successors, (23781), 15594 states have internal predecessors, (23781), 3498 states have call successors, (3498), 1006 states have call predecessors, (3498), 1021 states have return successors, (6933), 3443 states have call predecessors, (6933), 3480 states have call successors, (6933) [2025-01-09 03:47:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19484 states to 19484 states and 34212 transitions. [2025-01-09 03:47:38,176 INFO L78 Accepts]: Start accepts. Automaton has 19484 states and 34212 transitions. Word has length 97 [2025-01-09 03:47:38,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:38,177 INFO L471 AbstractCegarLoop]: Abstraction has 19484 states and 34212 transitions. [2025-01-09 03:47:38,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:47:38,177 INFO L276 IsEmpty]: Start isEmpty. Operand 19484 states and 34212 transitions. [2025-01-09 03:47:38,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:47:38,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:38,179 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:38,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:47:38,180 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:38,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:38,181 INFO L85 PathProgramCache]: Analyzing trace with hash -35201933, now seen corresponding path program 1 times [2025-01-09 03:47:38,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:38,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909450267] [2025-01-09 03:47:38,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:38,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:38,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:47:38,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:47:38,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:38,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 03:47:38,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:38,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909450267] [2025-01-09 03:47:38,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909450267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:38,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:38,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:38,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386591408] [2025-01-09 03:47:38,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:38,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:38,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:38,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:38,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:38,263 INFO L87 Difference]: Start difference. First operand 19484 states and 34212 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:47:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:39,367 INFO L93 Difference]: Finished difference Result 39094 states and 70219 transitions. [2025-01-09 03:47:39,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:47:39,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-01-09 03:47:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:39,479 INFO L225 Difference]: With dead ends: 39094 [2025-01-09 03:47:39,479 INFO L226 Difference]: Without dead ends: 19628 [2025-01-09 03:47:39,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:47:39,569 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 11 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:39,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2651 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19628 states. [2025-01-09 03:47:40,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19628 to 19564. [2025-01-09 03:47:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19564 states, 15036 states have (on average 1.586924714019686) internal successors, (23861), 15666 states have internal predecessors, (23861), 3498 states have call successors, (3498), 1022 states have call predecessors, (3498), 1029 states have return successors, (6905), 3435 states have call predecessors, (6905), 3480 states have call successors, (6905) [2025-01-09 03:47:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19564 states to 19564 states and 34264 transitions. [2025-01-09 03:47:40,361 INFO L78 Accepts]: Start accepts. Automaton has 19564 states and 34264 transitions. Word has length 98 [2025-01-09 03:47:40,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:40,361 INFO L471 AbstractCegarLoop]: Abstraction has 19564 states and 34264 transitions. [2025-01-09 03:47:40,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:47:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 19564 states and 34264 transitions. [2025-01-09 03:47:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:47:40,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:40,364 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:40,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:47:40,364 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:40,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash 430081242, now seen corresponding path program 1 times [2025-01-09 03:47:40,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:40,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106921039] [2025-01-09 03:47:40,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:40,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:40,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:47:40,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:47:40,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:40,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 03:47:40,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:40,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106921039] [2025-01-09 03:47:40,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106921039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:40,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:40,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:40,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579497586] [2025-01-09 03:47:40,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:40,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:40,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:40,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:40,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:40,488 INFO L87 Difference]: Start difference. First operand 19564 states and 34264 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:47:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:42,521 INFO L93 Difference]: Finished difference Result 58835 states and 111584 transitions. [2025-01-09 03:47:42,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:47:42,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-01-09 03:47:42,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:43,094 INFO L225 Difference]: With dead ends: 58835 [2025-01-09 03:47:43,095 INFO L226 Difference]: Without dead ends: 39289 [2025-01-09 03:47:43,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:47:43,310 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 893 mSDsluCounter, 3552 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 4523 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:43,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 4523 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:47:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39289 states. [2025-01-09 03:47:44,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39289 to 39124. [2025-01-09 03:47:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39124 states, 30074 states have (on average 1.5847243466116911) internal successors, (47659), 31328 states have internal predecessors, (47659), 6980 states have call successors, (6980), 2038 states have call predecessors, (6980), 2069 states have return successors, (18771), 6877 states have call predecessors, (18771), 6946 states have call successors, (18771) [2025-01-09 03:47:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39124 states to 39124 states and 73410 transitions. [2025-01-09 03:47:45,708 INFO L78 Accepts]: Start accepts. Automaton has 39124 states and 73410 transitions. Word has length 108 [2025-01-09 03:47:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:45,709 INFO L471 AbstractCegarLoop]: Abstraction has 39124 states and 73410 transitions. [2025-01-09 03:47:45,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:47:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 39124 states and 73410 transitions. [2025-01-09 03:47:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:47:45,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:45,711 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:45,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:47:45,712 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:45,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:45,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1620756433, now seen corresponding path program 1 times [2025-01-09 03:47:45,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:45,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732495317] [2025-01-09 03:47:45,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:45,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:45,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:47:45,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:47:45,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:45,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:47:45,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:45,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732495317] [2025-01-09 03:47:45,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732495317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:45,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:45,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:45,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944245916] [2025-01-09 03:47:45,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:45,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:45,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:45,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:45,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:45,930 INFO L87 Difference]: Start difference. First operand 39124 states and 73410 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:47:48,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:48,016 INFO L93 Difference]: Finished difference Result 78550 states and 153045 transitions. [2025-01-09 03:47:48,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:47:48,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-01-09 03:47:48,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:48,378 INFO L225 Difference]: With dead ends: 78550 [2025-01-09 03:47:48,378 INFO L226 Difference]: Without dead ends: 39444 [2025-01-09 03:47:48,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:47:48,847 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 10 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:48,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2651 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39444 states. [2025-01-09 03:47:50,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39444 to 39316. [2025-01-09 03:47:50,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39316 states, 30250 states have (on average 1.5818512396694215) internal successors, (47851), 31504 states have internal predecessors, (47851), 6980 states have call successors, (6980), 2070 states have call predecessors, (6980), 2085 states have return successors, (18739), 6861 states have call predecessors, (18739), 6946 states have call successors, (18739) [2025-01-09 03:47:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39316 states to 39316 states and 73570 transitions. [2025-01-09 03:47:50,986 INFO L78 Accepts]: Start accepts. Automaton has 39316 states and 73570 transitions. Word has length 109 [2025-01-09 03:47:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:50,987 INFO L471 AbstractCegarLoop]: Abstraction has 39316 states and 73570 transitions. [2025-01-09 03:47:50,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:47:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 39316 states and 73570 transitions. [2025-01-09 03:47:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:47:50,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:50,989 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:50,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:47:50,990 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:50,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:50,990 INFO L85 PathProgramCache]: Analyzing trace with hash 315435441, now seen corresponding path program 1 times [2025-01-09 03:47:50,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:50,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374969997] [2025-01-09 03:47:50,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:50,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:51,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:47:51,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:47:51,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:51,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 03:47:51,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:51,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374969997] [2025-01-09 03:47:51,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374969997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:51,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:51,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:51,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632208897] [2025-01-09 03:47:51,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:51,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:51,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:51,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:51,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:51,131 INFO L87 Difference]: Start difference. First operand 39316 states and 73570 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:47:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:54,123 INFO L93 Difference]: Finished difference Result 92933 states and 178013 transitions. [2025-01-09 03:47:54,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:47:54,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 120 [2025-01-09 03:47:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:54,841 INFO L225 Difference]: With dead ends: 92933 [2025-01-09 03:47:54,841 INFO L226 Difference]: Without dead ends: 53587 [2025-01-09 03:47:55,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:47:55,271 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 755 mSDsluCounter, 3368 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 4287 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:55,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 4287 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 03:47:55,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53587 states. [2025-01-09 03:47:57,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53587 to 53423. [2025-01-09 03:47:57,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53423 states, 41059 states have (on average 1.5700577218149492) internal successors, (64465), 42821 states have internal predecessors, (64465), 9528 states have call successors, (9528), 2851 states have call predecessors, (9528), 2835 states have return successors, (26396), 9284 states have call predecessors, (26396), 9478 states have call successors, (26396) [2025-01-09 03:47:57,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53423 states to 53423 states and 100389 transitions. [2025-01-09 03:47:57,737 INFO L78 Accepts]: Start accepts. Automaton has 53423 states and 100389 transitions. Word has length 120 [2025-01-09 03:47:57,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:57,738 INFO L471 AbstractCegarLoop]: Abstraction has 53423 states and 100389 transitions. [2025-01-09 03:47:58,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:47:58,094 INFO L276 IsEmpty]: Start isEmpty. Operand 53423 states and 100389 transitions. [2025-01-09 03:47:58,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 03:47:58,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:58,102 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:47:58,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:47:58,103 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:58,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:58,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1979429718, now seen corresponding path program 1 times [2025-01-09 03:47:58,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:58,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272852735] [2025-01-09 03:47:58,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:58,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:58,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 03:47:58,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 03:47:58,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:58,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:47:58,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:58,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272852735] [2025-01-09 03:47:58,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272852735] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:47:58,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174534324] [2025-01-09 03:47:58,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:58,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:47:58,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:47:58,431 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:47:58,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:47:58,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 03:47:58,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 03:47:58,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:58,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:58,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 2141 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:47:58,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:47:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:47:58,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:47:58,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174534324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:58,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:47:58,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-01-09 03:47:58,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916535411] [2025-01-09 03:47:58,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:58,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:47:58,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:58,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:47:58,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-01-09 03:47:58,946 INFO L87 Difference]: Start difference. First operand 53423 states and 100389 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 5 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (20), 6 states have call predecessors, (20), 5 states have call successors, (20) [2025-01-09 03:48:06,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:06,681 INFO L93 Difference]: Finished difference Result 141342 states and 303195 transitions. [2025-01-09 03:48:06,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 03:48:06,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 5 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (20), 6 states have call predecessors, (20), 5 states have call successors, (20) Word has length 162 [2025-01-09 03:48:06,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:07,986 INFO L225 Difference]: With dead ends: 141342 [2025-01-09 03:48:07,987 INFO L226 Difference]: Without dead ends: 87569 [2025-01-09 03:48:08,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2025-01-09 03:48:08,697 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 2090 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 4869 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 2124 SdHoareTripleChecker+Invalid, 5392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 4869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:08,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2191 Valid, 2124 Invalid, 5392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 4869 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 03:48:08,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87569 states. [2025-01-09 03:48:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87569 to 81445. [2025-01-09 03:48:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81445 states, 62813 states have (on average 1.5677327941668127) internal successors, (98474), 65345 states have internal predecessors, (98474), 14069 states have call successors, (14069), 4243 states have call predecessors, (14069), 4562 states have return successors, (47541), 13934 states have call predecessors, (47541), 14003 states have call successors, (47541) [2025-01-09 03:48:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81445 states to 81445 states and 160084 transitions. [2025-01-09 03:48:13,687 INFO L78 Accepts]: Start accepts. Automaton has 81445 states and 160084 transitions. Word has length 162 [2025-01-09 03:48:13,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:13,687 INFO L471 AbstractCegarLoop]: Abstraction has 81445 states and 160084 transitions. [2025-01-09 03:48:13,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 5 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (20), 6 states have call predecessors, (20), 5 states have call successors, (20) [2025-01-09 03:48:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 81445 states and 160084 transitions. [2025-01-09 03:48:13,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 03:48:13,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:13,699 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:48:13,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:48:13,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 03:48:13,900 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:13,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:13,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1252149370, now seen corresponding path program 1 times [2025-01-09 03:48:13,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:13,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787111823] [2025-01-09 03:48:13,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:13,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:14,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 03:48:14,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 03:48:14,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:14,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 03:48:14,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:14,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787111823] [2025-01-09 03:48:14,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787111823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:14,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:14,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:14,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739445939] [2025-01-09 03:48:14,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:14,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:14,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:14,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:14,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:14,742 INFO L87 Difference]: Start difference. First operand 81445 states and 160084 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 5 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24)