./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product01.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_product01.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 2e63e44256bba8522bf99795cd1238c2e8ad8456659e8a545df838f8f88bd318 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:45:58,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:45:59,043 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:45:59,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:45:59,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:45:59,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:45:59,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:45:59,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:45:59,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:45:59,085 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:45:59,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:45:59,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:45:59,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:45:59,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:45:59,087 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:45:59,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:45:59,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:45:59,088 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:45:59,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:45:59,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:45:59,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:45:59,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:45:59,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:45:59,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:45:59,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:45:59,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:45:59,089 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:45:59,089 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:45:59,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:45:59,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:45:59,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:45:59,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:45:59,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:45:59,090 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:45:59,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:45:59,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:45:59,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:45:59,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:45:59,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:45:59,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:45:59,091 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:45:59,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:45:59,091 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:45:59,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:45:59,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:45:59,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:45:59,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:45:59,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:45:59,092 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 -> 2e63e44256bba8522bf99795cd1238c2e8ad8456659e8a545df838f8f88bd318 [2025-01-09 03:45:59,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:45:59,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:45:59,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:45:59,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:45:59,395 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:45:59,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product01.cil.c [2025-01-09 03:46:00,785 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd666c6d3/93a6f0a858334eb899f07a1a1d30002c/FLAGfd3b8886a [2025-01-09 03:46:01,226 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:46:01,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product01.cil.c [2025-01-09 03:46:01,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd666c6d3/93a6f0a858334eb899f07a1a1d30002c/FLAGfd3b8886a [2025-01-09 03:46:01,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd666c6d3/93a6f0a858334eb899f07a1a1d30002c [2025-01-09 03:46:01,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:46:01,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:46:01,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:46:01,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:46:01,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:46:01,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:46:01" (1/1) ... [2025-01-09 03:46:01,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46b80118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:01, skipping insertion in model container [2025-01-09 03:46:01,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:46:01" (1/1) ... [2025-01-09 03:46:01,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:46:01,853 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_product01.cil.c[40412,40425] [2025-01-09 03:46:01,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:46:01,949 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:46:01,957 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-01-09 03:46:01,958 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [408] [2025-01-09 03:46:01,959 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [528] [2025-01-09 03:46:01,959 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [620] [2025-01-09 03:46:01,959 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [1287] [2025-01-09 03:46:01,959 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1477] [2025-01-09 03:46:01,959 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1843] [2025-01-09 03:46:01,959 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1878] [2025-01-09 03:46:01,959 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1893] [2025-01-09 03:46:01,960 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1902] [2025-01-09 03:46:02,037 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_product01.cil.c[40412,40425] [2025-01-09 03:46:02,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:46:02,127 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:46:02,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:02 WrapperNode [2025-01-09 03:46:02,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:46:02,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:46:02,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:46:02,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:46:02,135 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:46:02" (1/1) ... [2025-01-09 03:46:02,156 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:46:02" (1/1) ... [2025-01-09 03:46:02,208 INFO L138 Inliner]: procedures = 86, calls = 334, calls flagged for inlining = 21, calls inlined = 18, statements flattened = 746 [2025-01-09 03:46:02,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:46:02,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:46:02,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:46:02,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:46:02,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:02" (1/1) ... [2025-01-09 03:46:02,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:02" (1/1) ... [2025-01-09 03:46:02,235 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:02" (1/1) ... [2025-01-09 03:46:02,262 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 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:46:02,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:02" (1/1) ... [2025-01-09 03:46:02,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:02" (1/1) ... [2025-01-09 03:46:02,290 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:02" (1/1) ... [2025-01-09 03:46:02,293 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:02" (1/1) ... [2025-01-09 03:46:02,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:02" (1/1) ... [2025-01-09 03:46:02,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:02" (1/1) ... [2025-01-09 03:46:02,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:02" (1/1) ... [2025-01-09 03:46:02,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:46:02,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:46:02,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:46:02,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:46:02,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:02" (1/1) ... [2025-01-09 03:46:02,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:46:02,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:46:02,373 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:46:02,377 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:46:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:46:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-01-09 03:46:02,402 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-01-09 03:46:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:46:02,402 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:46:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:46:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:46:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-01-09 03:46:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-01-09 03:46:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:46:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:46:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:46:02,404 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:46:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:46:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:46:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:46:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:46:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:46:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:46:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:46:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:46:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:46:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:46:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-01-09 03:46:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-01-09 03:46:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:46:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:46:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-01-09 03:46:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-01-09 03:46:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:46:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:46:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:46:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:46:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:46:02,406 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:46:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:46:02,406 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:46:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:46:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:46:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:46:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:46:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-01-09 03:46:02,409 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:46:02,409 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:46:02,409 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:46:02,409 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:46:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:46:02,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:46:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:46:02,410 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:46:02,574 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:46:02,576 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:46:03,649 INFO L? ?]: Removed 417 outVars from TransFormulas that were not future-live. [2025-01-09 03:46:03,650 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:46:03,676 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:46:03,677 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:46:03,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:46:03 BoogieIcfgContainer [2025-01-09 03:46:03,677 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:46:03,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:46:03,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:46:03,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:46:03,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:46:01" (1/3) ... [2025-01-09 03:46:03,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f86db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:46:03, skipping insertion in model container [2025-01-09 03:46:03,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:02" (2/3) ... [2025-01-09 03:46:03,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f86db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:46:03, skipping insertion in model container [2025-01-09 03:46:03,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:46:03" (3/3) ... [2025-01-09 03:46:03,690 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product01.cil.c [2025-01-09 03:46:03,706 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:46:03,709 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product01.cil.c that has 24 procedures, 545 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:46:03,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:46:03,796 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;@7b11fa8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:46:03,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:46:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 545 states, 422 states have (on average 1.6919431279620853) internal successors, (714), 440 states have internal predecessors, (714), 98 states have call successors, (98), 23 states have call predecessors, (98), 23 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 03:46:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 03:46:03,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:03,830 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, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:03,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:03,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:03,836 INFO L85 PathProgramCache]: Analyzing trace with hash -25546956, now seen corresponding path program 1 times [2025-01-09 03:46:03,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:03,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917332330] [2025-01-09 03:46:03,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:03,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:03,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 03:46:04,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 03:46:04,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:04,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:04,665 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:46:04,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:04,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917332330] [2025-01-09 03:46:04,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917332330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:04,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:04,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:46:04,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35431906] [2025-01-09 03:46:04,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:04,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:46:04,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:04,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:46:04,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:04,700 INFO L87 Difference]: Start difference. First operand has 545 states, 422 states have (on average 1.6919431279620853) internal successors, (714), 440 states have internal predecessors, (714), 98 states have call successors, (98), 23 states have call predecessors, (98), 23 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) Second operand has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:46:04,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:04,951 INFO L93 Difference]: Finished difference Result 1087 states and 1832 transitions. [2025-01-09 03:46:04,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:46:04,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 85 [2025-01-09 03:46:04,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:04,967 INFO L225 Difference]: With dead ends: 1087 [2025-01-09 03:46:04,967 INFO L226 Difference]: Without dead ends: 550 [2025-01-09 03:46:04,977 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:46:04,979 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 91 mSDsluCounter, 4385 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5279 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:46:04,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5279 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:46:04,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-01-09 03:46:05,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2025-01-09 03:46:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 425 states have (on average 1.6847058823529413) internal successors, (716), 443 states have internal predecessors, (716), 99 states have call successors, (99), 23 states have call predecessors, (99), 23 states have return successors, (98), 94 states have call predecessors, (98), 96 states have call successors, (98) [2025-01-09 03:46:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 913 transitions. [2025-01-09 03:46:05,093 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 913 transitions. Word has length 85 [2025-01-09 03:46:05,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:05,097 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 913 transitions. [2025-01-09 03:46:05,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:46:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 913 transitions. [2025-01-09 03:46:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 03:46:05,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:05,108 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:05,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:46:05,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:05,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:05,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1583875756, now seen corresponding path program 1 times [2025-01-09 03:46:05,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:05,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994145583] [2025-01-09 03:46:05,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:05,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:05,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 03:46:05,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 03:46:05,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:05,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:05,456 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:46:05,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:05,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994145583] [2025-01-09 03:46:05,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994145583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:05,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:05,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:46:05,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418191636] [2025-01-09 03:46:05,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:05,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:46:05,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:05,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:46:05,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:05,461 INFO L87 Difference]: Start difference. First operand 548 states and 913 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:46:05,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:05,613 INFO L93 Difference]: Finished difference Result 1091 states and 1829 transitions. [2025-01-09 03:46:05,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:46:05,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2025-01-09 03:46:05,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:05,622 INFO L225 Difference]: With dead ends: 1091 [2025-01-09 03:46:05,623 INFO L226 Difference]: Without dead ends: 559 [2025-01-09 03:46:05,626 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:46:05,627 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 90 mSDsluCounter, 4379 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 5274 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:46:05,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 5274 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:46:05,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-01-09 03:46:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 548. [2025-01-09 03:46:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 425 states have (on average 1.6847058823529413) internal successors, (716), 443 states have internal predecessors, (716), 99 states have call successors, (99), 23 states have call predecessors, (99), 23 states have return successors, (98), 94 states have call predecessors, (98), 96 states have call successors, (98) [2025-01-09 03:46:05,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 913 transitions. [2025-01-09 03:46:05,675 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 913 transitions. Word has length 86 [2025-01-09 03:46:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:05,676 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 913 transitions. [2025-01-09 03:46:05,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:46:05,676 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 913 transitions. [2025-01-09 03:46:05,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 03:46:05,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:05,683 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:05,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:46:05,684 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:05,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:05,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1134714719, now seen corresponding path program 1 times [2025-01-09 03:46:05,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:05,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148853984] [2025-01-09 03:46:05,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:05,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:05,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 03:46:05,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 03:46:05,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:05,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:05,875 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:46:05,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:05,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148853984] [2025-01-09 03:46:05,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148853984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:05,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:05,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:05,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6978933] [2025-01-09 03:46:05,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:05,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:05,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:05,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:05,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:05,880 INFO L87 Difference]: Start difference. First operand 548 states and 913 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:46:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:05,955 INFO L93 Difference]: Finished difference Result 1078 states and 1807 transitions. [2025-01-09 03:46:05,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:46:05,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2025-01-09 03:46:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:05,962 INFO L225 Difference]: With dead ends: 1078 [2025-01-09 03:46:05,962 INFO L226 Difference]: Without dead ends: 518 [2025-01-09 03:46:05,967 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:46:05,968 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 14 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2644 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:46:05,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2644 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:05,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-01-09 03:46:05,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2025-01-09 03:46:05,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 398 states have (on average 1.6683417085427135) internal successors, (664), 414 states have internal predecessors, (664), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 03:46:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 857 transitions. [2025-01-09 03:46:06,008 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 857 transitions. Word has length 86 [2025-01-09 03:46:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:06,009 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 857 transitions. [2025-01-09 03:46:06,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:46:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 857 transitions. [2025-01-09 03:46:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 03:46:06,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:06,014 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:06,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:46:06,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:06,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:06,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1144766888, now seen corresponding path program 1 times [2025-01-09 03:46:06,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:06,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803875601] [2025-01-09 03:46:06,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:06,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:06,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 03:46:06,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 03:46:06,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:06,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:06,301 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:46:06,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:06,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803875601] [2025-01-09 03:46:06,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803875601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:06,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:06,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:46:06,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88901876] [2025-01-09 03:46:06,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:06,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:46:06,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:06,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:46:06,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:06,303 INFO L87 Difference]: Start difference. First operand 518 states and 857 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:46:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:06,392 INFO L93 Difference]: Finished difference Result 1029 states and 1713 transitions. [2025-01-09 03:46:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:46:06,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-01-09 03:46:06,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:06,398 INFO L225 Difference]: With dead ends: 1029 [2025-01-09 03:46:06,398 INFO L226 Difference]: Without dead ends: 512 [2025-01-09 03:46:06,402 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:46:06,406 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 63 mSDsluCounter, 4177 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5024 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:46:06,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5024 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:06,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-01-09 03:46:06,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2025-01-09 03:46:06,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 392 states have (on average 1.6607142857142858) internal successors, (651), 408 states have internal predecessors, (651), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 03:46:06,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 844 transitions. [2025-01-09 03:46:06,439 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 844 transitions. Word has length 87 [2025-01-09 03:46:06,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:06,440 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 844 transitions. [2025-01-09 03:46:06,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:46:06,440 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 844 transitions. [2025-01-09 03:46:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 03:46:06,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:06,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:06,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:46:06,444 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:06,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:06,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1443718649, now seen corresponding path program 1 times [2025-01-09 03:46:06,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:06,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723110962] [2025-01-09 03:46:06,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:06,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:06,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 03:46:06,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 03:46:06,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:06,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:06,634 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:46:06,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:06,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723110962] [2025-01-09 03:46:06,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723110962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:06,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:06,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:46:06,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891513373] [2025-01-09 03:46:06,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:06,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:46:06,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:06,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:46:06,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:06,636 INFO L87 Difference]: Start difference. First operand 512 states and 844 transitions. Second operand has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:46:06,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:06,729 INFO L93 Difference]: Finished difference Result 1017 states and 1687 transitions. [2025-01-09 03:46:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:46:06,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 88 [2025-01-09 03:46:06,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:06,736 INFO L225 Difference]: With dead ends: 1017 [2025-01-09 03:46:06,736 INFO L226 Difference]: Without dead ends: 506 [2025-01-09 03:46:06,740 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:46:06,742 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 49 mSDsluCounter, 4129 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 4964 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:06,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 4964 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:06,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-01-09 03:46:06,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-01-09 03:46:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 386 states have (on average 1.650259067357513) internal successors, (637), 402 states have internal predecessors, (637), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 03:46:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 830 transitions. [2025-01-09 03:46:06,778 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 830 transitions. Word has length 88 [2025-01-09 03:46:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:06,778 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 830 transitions. [2025-01-09 03:46:06,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:46:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 830 transitions. [2025-01-09 03:46:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 03:46:06,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:06,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:06,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:46:06,781 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:06,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:06,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1292247684, now seen corresponding path program 1 times [2025-01-09 03:46:06,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:06,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313593578] [2025-01-09 03:46:06,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:06,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:06,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 03:46:06,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 03:46:06,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:06,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:06,905 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:46:06,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:06,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313593578] [2025-01-09 03:46:06,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313593578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:06,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:06,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:06,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004600362] [2025-01-09 03:46:06,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:06,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:06,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:06,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:06,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:06,908 INFO L87 Difference]: Start difference. First operand 506 states and 830 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:46:06,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:06,986 INFO L93 Difference]: Finished difference Result 996 states and 1646 transitions. [2025-01-09 03:46:06,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:46:06,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 89 [2025-01-09 03:46:06,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:06,991 INFO L225 Difference]: With dead ends: 996 [2025-01-09 03:46:06,992 INFO L226 Difference]: Without dead ends: 506 [2025-01-09 03:46:06,995 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:46:06,997 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 15 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2430 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:46:06,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2430 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-01-09 03:46:07,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-01-09 03:46:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 386 states have (on average 1.6476683937823835) internal successors, (636), 402 states have internal predecessors, (636), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 03:46:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 829 transitions. [2025-01-09 03:46:07,023 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 829 transitions. Word has length 89 [2025-01-09 03:46:07,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:07,023 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 829 transitions. [2025-01-09 03:46:07,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:46:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 829 transitions. [2025-01-09 03:46:07,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 03:46:07,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:07,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:07,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:46:07,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:07,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:07,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1297663576, now seen corresponding path program 1 times [2025-01-09 03:46:07,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:07,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25630046] [2025-01-09 03:46:07,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:07,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:07,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 03:46:07,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 03:46:07,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:07,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:07,146 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:46:07,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:07,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25630046] [2025-01-09 03:46:07,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25630046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:07,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:07,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:07,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304989019] [2025-01-09 03:46:07,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:07,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:07,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:07,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:07,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:07,151 INFO L87 Difference]: Start difference. First operand 506 states and 829 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:46:07,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:07,209 INFO L93 Difference]: Finished difference Result 996 states and 1644 transitions. [2025-01-09 03:46:07,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:46:07,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 90 [2025-01-09 03:46:07,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:07,217 INFO L225 Difference]: With dead ends: 996 [2025-01-09 03:46:07,217 INFO L226 Difference]: Without dead ends: 506 [2025-01-09 03:46:07,220 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:46:07,221 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 14 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2432 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:46:07,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2432 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:07,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-01-09 03:46:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-01-09 03:46:07,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 386 states have (on average 1.645077720207254) internal successors, (635), 402 states have internal predecessors, (635), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 03:46:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 828 transitions. [2025-01-09 03:46:07,249 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 828 transitions. Word has length 90 [2025-01-09 03:46:07,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:07,250 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 828 transitions. [2025-01-09 03:46:07,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:46:07,251 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 828 transitions. [2025-01-09 03:46:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 03:46:07,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:07,254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:07,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:46:07,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:07,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:07,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1162140159, now seen corresponding path program 1 times [2025-01-09 03:46:07,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:07,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462896749] [2025-01-09 03:46:07,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:07,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:07,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 03:46:07,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 03:46:07,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:07,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:07,392 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:46:07,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:07,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462896749] [2025-01-09 03:46:07,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462896749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:07,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:07,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:07,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897491727] [2025-01-09 03:46:07,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:07,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:07,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:07,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:07,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:07,394 INFO L87 Difference]: Start difference. First operand 506 states and 828 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:46:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:07,447 INFO L93 Difference]: Finished difference Result 996 states and 1642 transitions. [2025-01-09 03:46:07,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:46:07,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 91 [2025-01-09 03:46:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:07,453 INFO L225 Difference]: With dead ends: 996 [2025-01-09 03:46:07,453 INFO L226 Difference]: Without dead ends: 506 [2025-01-09 03:46:07,457 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:46:07,458 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 13 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2434 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:46:07,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2434 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-01-09 03:46:07,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-01-09 03:46:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 386 states have (on average 1.6424870466321244) internal successors, (634), 402 states have internal predecessors, (634), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 03:46:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 827 transitions. [2025-01-09 03:46:07,487 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 827 transitions. Word has length 91 [2025-01-09 03:46:07,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:07,488 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 827 transitions. [2025-01-09 03:46:07,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:46:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 827 transitions. [2025-01-09 03:46:07,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 03:46:07,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:07,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:07,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:46:07,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:07,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:07,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1249318787, now seen corresponding path program 1 times [2025-01-09 03:46:07,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:07,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438787059] [2025-01-09 03:46:07,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:07,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:07,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:46:07,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:46:07,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:07,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:07,641 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:46:07,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:07,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438787059] [2025-01-09 03:46:07,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438787059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:07,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:07,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:07,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959321230] [2025-01-09 03:46:07,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:07,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:07,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:07,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:07,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:07,644 INFO L87 Difference]: Start difference. First operand 506 states and 827 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:46:07,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:07,699 INFO L93 Difference]: Finished difference Result 996 states and 1640 transitions. [2025-01-09 03:46:07,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:46:07,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 92 [2025-01-09 03:46:07,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:07,704 INFO L225 Difference]: With dead ends: 996 [2025-01-09 03:46:07,705 INFO L226 Difference]: Without dead ends: 506 [2025-01-09 03:46:07,708 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:46:07,708 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 12 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2436 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:46:07,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2436 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:07,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-01-09 03:46:07,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-01-09 03:46:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 386 states have (on average 1.6398963730569949) internal successors, (633), 402 states have internal predecessors, (633), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 03:46:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 826 transitions. [2025-01-09 03:46:07,731 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 826 transitions. Word has length 92 [2025-01-09 03:46:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:07,731 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 826 transitions. [2025-01-09 03:46:07,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:46:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 826 transitions. [2025-01-09 03:46:07,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 03:46:07,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:07,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:07,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:46:07,735 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:07,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:07,735 INFO L85 PathProgramCache]: Analyzing trace with hash -799563130, now seen corresponding path program 1 times [2025-01-09 03:46:07,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:07,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028091932] [2025-01-09 03:46:07,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:07,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:07,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 03:46:07,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 03:46:07,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:07,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:07,943 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:46:07,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:07,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028091932] [2025-01-09 03:46:07,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028091932] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:46:07,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978225753] [2025-01-09 03:46:07,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:07,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:46:07,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:46:07,948 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:46:07,949 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:46:08,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 03:46:08,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 03:46:08,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:08,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:08,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:46:08,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:46:08,430 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:46:08,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:46:08,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978225753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:08,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:46:08,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:46:08,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583861669] [2025-01-09 03:46:08,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:08,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:46:08,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:08,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:46:08,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:08,432 INFO L87 Difference]: Start difference. First operand 506 states and 826 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:46:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:08,536 INFO L93 Difference]: Finished difference Result 1430 states and 2368 transitions. [2025-01-09 03:46:08,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:46:08,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 93 [2025-01-09 03:46:08,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:08,545 INFO L225 Difference]: With dead ends: 1430 [2025-01-09 03:46:08,545 INFO L226 Difference]: Without dead ends: 942 [2025-01-09 03:46:08,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:08,549 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 769 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1558 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:08,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1558 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:46:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-01-09 03:46:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 927. [2025-01-09 03:46:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 714 states have (on average 1.6554621848739495) internal successors, (1182), 745 states have internal predecessors, (1182), 172 states have call successors, (172), 41 states have call predecessors, (172), 40 states have return successors, (174), 166 states have call predecessors, (174), 169 states have call successors, (174) [2025-01-09 03:46:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1528 transitions. [2025-01-09 03:46:08,604 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1528 transitions. Word has length 93 [2025-01-09 03:46:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:08,605 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1528 transitions. [2025-01-09 03:46:08,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:46:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1528 transitions. [2025-01-09 03:46:08,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 03:46:08,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:08,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:08,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:46:08,810 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,SelfDestructingSolverStorable9 [2025-01-09 03:46:08,810 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:08,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:08,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1227487916, now seen corresponding path program 1 times [2025-01-09 03:46:08,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:08,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971704784] [2025-01-09 03:46:08,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:08,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:08,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 03:46:08,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 03:46:08,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:08,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:09,046 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:46:09,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:09,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971704784] [2025-01-09 03:46:09,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971704784] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:46:09,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764079341] [2025-01-09 03:46:09,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:09,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:46:09,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:46:09,049 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:46:09,052 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:46:09,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 03:46:09,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 03:46:09,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:09,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:09,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:46:09,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:46:09,478 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:46:09,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:46:09,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764079341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:09,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:46:09,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:46:09,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540271870] [2025-01-09 03:46:09,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:09,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:46:09,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:09,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:46:09,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:09,482 INFO L87 Difference]: Start difference. First operand 927 states and 1528 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:46:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:09,581 INFO L93 Difference]: Finished difference Result 2272 states and 3774 transitions. [2025-01-09 03:46:09,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:46:09,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2025-01-09 03:46:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:09,593 INFO L225 Difference]: With dead ends: 2272 [2025-01-09 03:46:09,594 INFO L226 Difference]: Without dead ends: 1363 [2025-01-09 03:46:09,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:09,602 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 769 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1614 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:46:09,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1614 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-01-09 03:46:09,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1315. [2025-01-09 03:46:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1015 states have (on average 1.6699507389162562) internal successors, (1695), 1061 states have internal predecessors, (1695), 243 states have call successors, (243), 56 states have call predecessors, (243), 56 states have return successors, (250), 236 states have call predecessors, (250), 240 states have call successors, (250) [2025-01-09 03:46:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 2188 transitions. [2025-01-09 03:46:09,676 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 2188 transitions. Word has length 94 [2025-01-09 03:46:09,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:09,676 INFO L471 AbstractCegarLoop]: Abstraction has 1315 states and 2188 transitions. [2025-01-09 03:46:09,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:46:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 2188 transitions. [2025-01-09 03:46:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 03:46:09,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:09,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:09,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:46:09,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:46:09,887 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:09,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:09,887 INFO L85 PathProgramCache]: Analyzing trace with hash 128227112, now seen corresponding path program 1 times [2025-01-09 03:46:09,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:09,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952362603] [2025-01-09 03:46:09,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:09,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:09,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 03:46:09,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 03:46:09,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:09,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:10,069 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:46:10,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:10,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952362603] [2025-01-09 03:46:10,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952362603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:10,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:10,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:46:10,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250735855] [2025-01-09 03:46:10,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:10,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:46:10,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:10,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:46:10,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:46:10,071 INFO L87 Difference]: Start difference. First operand 1315 states and 2188 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 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:46:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:10,614 INFO L93 Difference]: Finished difference Result 3881 states and 6565 transitions. [2025-01-09 03:46:10,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:46:10,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 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 96 [2025-01-09 03:46:10,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:10,635 INFO L225 Difference]: With dead ends: 3881 [2025-01-09 03:46:10,636 INFO L226 Difference]: Without dead ends: 2584 [2025-01-09 03:46:10,646 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:46:10,646 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 816 mSDsluCounter, 3332 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 4257 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:10,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 4257 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:46:10,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2584 states. [2025-01-09 03:46:10,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2584 to 2537. [2025-01-09 03:46:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 1963 states have (on average 1.6744778400407538) internal successors, (3287), 2051 states have internal predecessors, (3287), 465 states have call successors, (465), 106 states have call predecessors, (465), 108 states have return successors, (541), 457 states have call predecessors, (541), 461 states have call successors, (541) [2025-01-09 03:46:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 4293 transitions. [2025-01-09 03:46:10,806 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 4293 transitions. Word has length 96 [2025-01-09 03:46:10,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:10,807 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 4293 transitions. [2025-01-09 03:46:10,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 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:46:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 4293 transitions. [2025-01-09 03:46:10,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 03:46:10,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:10,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:10,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:46:10,813 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:10,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:10,813 INFO L85 PathProgramCache]: Analyzing trace with hash -697827706, now seen corresponding path program 1 times [2025-01-09 03:46:10,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:10,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364925815] [2025-01-09 03:46:10,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:10,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:10,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 03:46:10,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 03:46:10,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:10,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:11,041 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:46:11,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:11,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364925815] [2025-01-09 03:46:11,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364925815] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:46:11,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698321873] [2025-01-09 03:46:11,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:11,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:46:11,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:46:11,045 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:46:11,048 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:46:11,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 03:46:11,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 03:46:11,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:11,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:11,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 1565 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 03:46:11,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:46:11,498 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:46:11,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:46:11,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698321873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:11,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:46:11,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:46:11,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594582355] [2025-01-09 03:46:11,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:11,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:46:11,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:11,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:46:11,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:11,501 INFO L87 Difference]: Start difference. First operand 2537 states and 4293 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:46:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:11,835 INFO L93 Difference]: Finished difference Result 7321 states and 12584 transitions. [2025-01-09 03:46:11,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:46:11,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2025-01-09 03:46:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:11,876 INFO L225 Difference]: With dead ends: 7321 [2025-01-09 03:46:11,877 INFO L226 Difference]: Without dead ends: 4803 [2025-01-09 03:46:11,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:11,903 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 678 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:11,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1540 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:46:11,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4803 states. [2025-01-09 03:46:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4803 to 4766. [2025-01-09 03:46:12,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4766 states, 3676 states have (on average 1.6409140369967357) internal successors, (6032), 3850 states have internal predecessors, (6032), 878 states have call successors, (878), 206 states have call predecessors, (878), 211 states have return successors, (1127), 865 states have call predecessors, (1127), 872 states have call successors, (1127) [2025-01-09 03:46:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4766 states to 4766 states and 8037 transitions. [2025-01-09 03:46:12,224 INFO L78 Accepts]: Start accepts. Automaton has 4766 states and 8037 transitions. Word has length 97 [2025-01-09 03:46:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:12,225 INFO L471 AbstractCegarLoop]: Abstraction has 4766 states and 8037 transitions. [2025-01-09 03:46:12,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:46:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 4766 states and 8037 transitions. [2025-01-09 03:46:12,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:46:12,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:12,230 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, 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:46:12,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:46:12,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:46:12,435 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:12,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:12,436 INFO L85 PathProgramCache]: Analyzing trace with hash 378865235, now seen corresponding path program 1 times [2025-01-09 03:46:12,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:12,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815964317] [2025-01-09 03:46:12,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:12,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:12,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:46:12,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:46:12,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:12,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:12,651 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:46:12,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:12,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815964317] [2025-01-09 03:46:12,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815964317] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:46:12,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68700203] [2025-01-09 03:46:12,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:12,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:46:12,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:46:12,654 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:46:12,656 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:46:12,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:46:12,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:46:12,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:12,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:12,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 1579 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:46:12,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:46:13,001 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:46:13,002 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:46:13,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68700203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:13,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:46:13,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:46:13,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832756279] [2025-01-09 03:46:13,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:13,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:46:13,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:13,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:46:13,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:13,004 INFO L87 Difference]: Start difference. First operand 4766 states and 8037 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:46:13,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:13,486 INFO L93 Difference]: Finished difference Result 14184 states and 24244 transitions. [2025-01-09 03:46:13,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:46:13,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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 102 [2025-01-09 03:46:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:13,576 INFO L225 Difference]: With dead ends: 14184 [2025-01-09 03:46:13,576 INFO L226 Difference]: Without dead ends: 9439 [2025-01-09 03:46:13,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:13,617 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 809 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:13,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1690 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:13,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9439 states. [2025-01-09 03:46:14,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9439 to 9336. [2025-01-09 03:46:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9336 states, 7228 states have (on average 1.6451300498063088) internal successors, (11891), 7556 states have internal predecessors, (11891), 1696 states have call successors, (1696), 394 states have call predecessors, (1696), 411 states have return successors, (2248), 1691 states have call predecessors, (2248), 1686 states have call successors, (2248) [2025-01-09 03:46:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9336 states to 9336 states and 15835 transitions. [2025-01-09 03:46:14,180 INFO L78 Accepts]: Start accepts. Automaton has 9336 states and 15835 transitions. Word has length 102 [2025-01-09 03:46:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:14,181 INFO L471 AbstractCegarLoop]: Abstraction has 9336 states and 15835 transitions. [2025-01-09 03:46:14,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:46:14,184 INFO L276 IsEmpty]: Start isEmpty. Operand 9336 states and 15835 transitions. [2025-01-09 03:46:14,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:46:14,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:14,193 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, 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:46:14,204 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:46:14,399 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,SelfDestructingSolverStorable13 [2025-01-09 03:46:14,399 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:14,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:14,400 INFO L85 PathProgramCache]: Analyzing trace with hash -632252015, now seen corresponding path program 1 times [2025-01-09 03:46:14,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:14,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732902472] [2025-01-09 03:46:14,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:14,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:14,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:46:14,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:46:14,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:14,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:14,585 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:46:14,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:14,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732902472] [2025-01-09 03:46:14,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732902472] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:46:14,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288587888] [2025-01-09 03:46:14,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:14,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:46:14,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:46:14,588 INFO L229 MonitoredProcess]: Starting monitored process 6 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:46:14,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:46:14,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:46:14,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:46:14,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:14,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:14,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 1578 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:46:14,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:46:14,992 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:46:14,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:46:14,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288587888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:14,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:46:14,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-01-09 03:46:14,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018779411] [2025-01-09 03:46:14,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:14,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:46:14,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:14,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:46:14,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:46:14,995 INFO L87 Difference]: Start difference. First operand 9336 states and 15835 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:46:15,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:15,676 INFO L93 Difference]: Finished difference Result 17641 states and 30008 transitions. [2025-01-09 03:46:15,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:46:15,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 102 [2025-01-09 03:46:15,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:15,752 INFO L225 Difference]: With dead ends: 17641 [2025-01-09 03:46:15,753 INFO L226 Difference]: Without dead ends: 8323 [2025-01-09 03:46:15,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:46:15,804 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 688 mSDsluCounter, 2458 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 3336 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:15,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 3336 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:46:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8323 states. [2025-01-09 03:46:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8323 to 8301. [2025-01-09 03:46:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8301 states, 6449 states have (on average 1.6317258489688324) internal successors, (10523), 6724 states have internal predecessors, (10523), 1478 states have call successors, (1478), 358 states have call predecessors, (1478), 373 states have return successors, (1938), 1474 states have call predecessors, (1938), 1468 states have call successors, (1938) [2025-01-09 03:46:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8301 states to 8301 states and 13939 transitions. [2025-01-09 03:46:16,223 INFO L78 Accepts]: Start accepts. Automaton has 8301 states and 13939 transitions. Word has length 102 [2025-01-09 03:46:16,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:16,226 INFO L471 AbstractCegarLoop]: Abstraction has 8301 states and 13939 transitions. [2025-01-09 03:46:16,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:46:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 8301 states and 13939 transitions. [2025-01-09 03:46:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:46:16,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:16,229 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, 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:46:16,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:46:16,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 03:46:16,430 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:16,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:16,430 INFO L85 PathProgramCache]: Analyzing trace with hash -828084277, now seen corresponding path program 1 times [2025-01-09 03:46:16,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:16,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796137274] [2025-01-09 03:46:16,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:16,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:16,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:46:16,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:46:16,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:16,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:16,525 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:46:16,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:16,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796137274] [2025-01-09 03:46:16,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796137274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:16,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:16,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:16,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125183590] [2025-01-09 03:46:16,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:16,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:16,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:16,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:16,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:16,526 INFO L87 Difference]: Start difference. First operand 8301 states and 13939 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:46:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:17,045 INFO L93 Difference]: Finished difference Result 16632 states and 28273 transitions. [2025-01-09 03:46:17,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:46:17,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 102 [2025-01-09 03:46:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:17,111 INFO L225 Difference]: With dead ends: 16632 [2025-01-09 03:46:17,111 INFO L226 Difference]: Without dead ends: 8349 [2025-01-09 03:46:17,170 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:46:17,172 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 12 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2402 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:17,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2402 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:46:17,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8349 states. [2025-01-09 03:46:17,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8349 to 8317. [2025-01-09 03:46:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8317 states, 6461 states have (on average 1.6299334468348552) internal successors, (10531), 6736 states have internal predecessors, (10531), 1478 states have call successors, (1478), 366 states have call predecessors, (1478), 377 states have return successors, (1912), 1470 states have call predecessors, (1912), 1468 states have call successors, (1912) [2025-01-09 03:46:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8317 states to 8317 states and 13921 transitions. [2025-01-09 03:46:17,639 INFO L78 Accepts]: Start accepts. Automaton has 8317 states and 13921 transitions. Word has length 102 [2025-01-09 03:46:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:17,640 INFO L471 AbstractCegarLoop]: Abstraction has 8317 states and 13921 transitions. [2025-01-09 03:46:17,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:46:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 8317 states and 13921 transitions. [2025-01-09 03:46:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:46:17,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:17,644 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, 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:46:17,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:46:17,644 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:17,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:17,645 INFO L85 PathProgramCache]: Analyzing trace with hash 619792695, now seen corresponding path program 1 times [2025-01-09 03:46:17,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:17,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037789236] [2025-01-09 03:46:17,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:17,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:17,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:46:17,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:46:17,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:17,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:17,807 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:46:17,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037789236] [2025-01-09 03:46:17,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037789236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:17,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:17,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:46:17,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462616661] [2025-01-09 03:46:17,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:17,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:46:17,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:17,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:46:17,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:46:17,809 INFO L87 Difference]: Start difference. First operand 8317 states and 13921 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:46:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:18,871 INFO L93 Difference]: Finished difference Result 24897 states and 42861 transitions. [2025-01-09 03:46:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:46:18,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-01-09 03:46:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:19,002 INFO L225 Difference]: With dead ends: 24897 [2025-01-09 03:46:19,002 INFO L226 Difference]: Without dead ends: 16598 [2025-01-09 03:46:19,065 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:46:19,066 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 809 mSDsluCounter, 3329 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 4251 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:19,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 4251 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:46:19,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16598 states. [2025-01-09 03:46:19,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16598 to 16497. [2025-01-09 03:46:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16497 states, 12828 states have (on average 1.6262862488306828) internal successors, (20862), 13369 states have internal predecessors, (20862), 2911 states have call successors, (2911), 726 states have call predecessors, (2911), 757 states have return successors, (4425), 2913 states have call predecessors, (4425), 2893 states have call successors, (4425) [2025-01-09 03:46:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16497 states to 16497 states and 28198 transitions. [2025-01-09 03:46:19,903 INFO L78 Accepts]: Start accepts. Automaton has 16497 states and 28198 transitions. Word has length 110 [2025-01-09 03:46:19,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:19,904 INFO L471 AbstractCegarLoop]: Abstraction has 16497 states and 28198 transitions. [2025-01-09 03:46:19,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:46:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 16497 states and 28198 transitions. [2025-01-09 03:46:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 03:46:19,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:19,909 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, 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:46:19,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:46:19,910 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:19,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1787677023, now seen corresponding path program 1 times [2025-01-09 03:46:19,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:19,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623500423] [2025-01-09 03:46:19,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:19,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:19,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 03:46:19,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 03:46:19,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:19,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:20,106 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:46:20,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:20,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623500423] [2025-01-09 03:46:20,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623500423] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:20,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:20,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:20,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140793776] [2025-01-09 03:46:20,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:20,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:20,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:20,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:20,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:20,108 INFO L87 Difference]: Start difference. First operand 16497 states and 28198 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:46:20,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:20,897 INFO L93 Difference]: Finished difference Result 33120 states and 57611 transitions. [2025-01-09 03:46:20,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:46:20,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2025-01-09 03:46:20,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:21,138 INFO L225 Difference]: With dead ends: 33120 [2025-01-09 03:46:21,139 INFO L226 Difference]: Without dead ends: 16641 [2025-01-09 03:46:21,237 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:46:21,238 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 12 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2396 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:21,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2396 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:46:21,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16641 states. [2025-01-09 03:46:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16641 to 16577. [2025-01-09 03:46:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16577 states, 12900 states have (on average 1.6234108527131783) internal successors, (20942), 13425 states have internal predecessors, (20942), 2911 states have call successors, (2911), 758 states have call predecessors, (2911), 765 states have return successors, (4385), 2905 states have call predecessors, (4385), 2893 states have call successors, (4385) [2025-01-09 03:46:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16577 states to 16577 states and 28238 transitions. [2025-01-09 03:46:22,186 INFO L78 Accepts]: Start accepts. Automaton has 16577 states and 28238 transitions. Word has length 111 [2025-01-09 03:46:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:22,187 INFO L471 AbstractCegarLoop]: Abstraction has 16577 states and 28238 transitions. [2025-01-09 03:46:22,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:46:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 16577 states and 28238 transitions. [2025-01-09 03:46:22,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:46:22,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:22,193 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, 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:46:22,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:46:22,194 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:22,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:22,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1340682227, now seen corresponding path program 1 times [2025-01-09 03:46:22,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:22,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082558047] [2025-01-09 03:46:22,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:22,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:22,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:46:22,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:46:22,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:22,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:22,397 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:46:22,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:22,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082558047] [2025-01-09 03:46:22,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082558047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:22,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:22,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:46:22,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966586948] [2025-01-09 03:46:22,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:22,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:46:22,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:22,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:46:22,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:46:22,399 INFO L87 Difference]: Start difference. First operand 16577 states and 28238 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:23,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:23,991 INFO L93 Difference]: Finished difference Result 49817 states and 88358 transitions. [2025-01-09 03:46:23,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:46:23,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-01-09 03:46:23,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:24,252 INFO L225 Difference]: With dead ends: 49817 [2025-01-09 03:46:24,253 INFO L226 Difference]: Without dead ends: 33258 [2025-01-09 03:46:24,391 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:46:24,391 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 807 mSDsluCounter, 3322 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 4238 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:24,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 4238 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 03:46:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33258 states. [2025-01-09 03:46:25,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33258 to 33093. [2025-01-09 03:46:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33093 states, 25763 states have (on average 1.6196483328804876) internal successors, (41727), 26804 states have internal predecessors, (41727), 5788 states have call successors, (5788), 1510 states have call predecessors, (5788), 1541 states have return successors, (10627), 5802 states have call predecessors, (10627), 5754 states have call successors, (10627) [2025-01-09 03:46:26,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33093 states to 33093 states and 58142 transitions. [2025-01-09 03:46:26,068 INFO L78 Accepts]: Start accepts. Automaton has 33093 states and 58142 transitions. Word has length 120 [2025-01-09 03:46:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:26,069 INFO L471 AbstractCegarLoop]: Abstraction has 33093 states and 58142 transitions. [2025-01-09 03:46:26,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 33093 states and 58142 transitions. [2025-01-09 03:46:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 03:46:26,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:26,076 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, 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:46:26,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:46:26,076 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:26,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:26,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1678652227, now seen corresponding path program 1 times [2025-01-09 03:46:26,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:26,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627521817] [2025-01-09 03:46:26,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:26,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:26,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:46:26,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:46:26,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:26,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:26,174 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:46:26,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:26,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627521817] [2025-01-09 03:46:26,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627521817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:26,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:26,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:26,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019388928] [2025-01-09 03:46:26,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:26,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:26,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:26,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:26,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:26,177 INFO L87 Difference]: Start difference. First operand 33093 states and 58142 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:46:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:28,195 INFO L93 Difference]: Finished difference Result 66456 states and 119940 transitions. [2025-01-09 03:46:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:46:28,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2025-01-09 03:46:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:28,538 INFO L225 Difference]: With dead ends: 66456 [2025-01-09 03:46:28,539 INFO L226 Difference]: Without dead ends: 33381 [2025-01-09 03:46:29,040 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:46:29,043 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 11 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2399 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:29,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2399 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:46:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33381 states. [2025-01-09 03:46:29,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33381 to 33253. [2025-01-09 03:46:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33253 states, 25907 states have (on average 1.616821708418574) internal successors, (41887), 26948 states have internal predecessors, (41887), 5788 states have call successors, (5788), 1542 states have call predecessors, (5788), 1557 states have return successors, (10571), 5786 states have call predecessors, (10571), 5754 states have call successors, (10571) [2025-01-09 03:46:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33253 states to 33253 states and 58246 transitions. [2025-01-09 03:46:30,478 INFO L78 Accepts]: Start accepts. Automaton has 33253 states and 58246 transitions. Word has length 121 [2025-01-09 03:46:30,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:30,479 INFO L471 AbstractCegarLoop]: Abstraction has 33253 states and 58246 transitions. [2025-01-09 03:46:30,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:46:30,479 INFO L276 IsEmpty]: Start isEmpty. Operand 33253 states and 58246 transitions. [2025-01-09 03:46:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:46:30,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:30,487 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, 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:46:30,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:46:30,488 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:30,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:30,488 INFO L85 PathProgramCache]: Analyzing trace with hash -893542305, now seen corresponding path program 1 times [2025-01-09 03:46:30,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:30,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533446676] [2025-01-09 03:46:30,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:30,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:30,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:46:30,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:46:30,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:30,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:30,677 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:46:30,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:30,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533446676] [2025-01-09 03:46:30,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533446676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:30,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:30,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:46:30,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323129714] [2025-01-09 03:46:30,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:30,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:46:30,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:30,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:46:30,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:46:30,679 INFO L87 Difference]: Start difference. First operand 33253 states and 58246 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:46:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:34,685 INFO L93 Difference]: Finished difference Result 100081 states and 186178 transitions. [2025-01-09 03:46:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:46:34,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 131 [2025-01-09 03:46:34,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:35,458 INFO L225 Difference]: With dead ends: 100081 [2025-01-09 03:46:35,458 INFO L226 Difference]: Without dead ends: 66846 [2025-01-09 03:46:35,833 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:46:35,834 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 802 mSDsluCounter, 3337 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 4255 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:35,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 4255 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:46:35,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66846 states. [2025-01-09 03:46:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66846 to 66553. [2025-01-09 03:46:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66553 states, 51858 states have (on average 1.6139457750009643) internal successors, (83696), 53931 states have internal predecessors, (83696), 11553 states have call successors, (11553), 3078 states have call predecessors, (11553), 3141 states have return successors, (26785), 11591 states have call predecessors, (26785), 11487 states have call successors, (26785) [2025-01-09 03:46:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66553 states to 66553 states and 122034 transitions. [2025-01-09 03:46:39,193 INFO L78 Accepts]: Start accepts. Automaton has 66553 states and 122034 transitions. Word has length 131 [2025-01-09 03:46:39,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:39,193 INFO L471 AbstractCegarLoop]: Abstraction has 66553 states and 122034 transitions. [2025-01-09 03:46:39,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:46:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 66553 states and 122034 transitions. [2025-01-09 03:46:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 03:46:39,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:39,201 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, 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:46:39,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:46:39,201 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:39,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:39,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1823336983, now seen corresponding path program 1 times [2025-01-09 03:46:39,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:39,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66395593] [2025-01-09 03:46:39,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:39,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:39,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:46:39,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:46:39,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:39,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:39,304 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:46:39,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:39,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66395593] [2025-01-09 03:46:39,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66395593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:39,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:39,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:39,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138449839] [2025-01-09 03:46:39,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:39,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:39,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:39,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:39,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:39,307 INFO L87 Difference]: Start difference. First operand 66553 states and 122034 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:46:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:44,065 INFO L93 Difference]: Finished difference Result 133728 states and 255505 transitions. [2025-01-09 03:46:44,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:46:44,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2025-01-09 03:46:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:44,976 INFO L225 Difference]: With dead ends: 133728 [2025-01-09 03:46:44,976 INFO L226 Difference]: Without dead ends: 67193 [2025-01-09 03:46:45,693 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:46:45,694 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 9 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:45,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2396 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:46:45,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67193 states. [2025-01-09 03:46:48,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67193 to 66937. [2025-01-09 03:46:48,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66937 states, 52210 states have (on average 1.6104194598735875) internal successors, (84080), 54283 states have internal predecessors, (84080), 11553 states have call successors, (11553), 3142 states have call predecessors, (11553), 3173 states have return successors, (26721), 11559 states have call predecessors, (26721), 11487 states have call successors, (26721) [2025-01-09 03:46:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66937 states to 66937 states and 122354 transitions. [2025-01-09 03:46:49,399 INFO L78 Accepts]: Start accepts. Automaton has 66937 states and 122354 transitions. Word has length 132 [2025-01-09 03:46:49,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:49,400 INFO L471 AbstractCegarLoop]: Abstraction has 66937 states and 122354 transitions. [2025-01-09 03:46:49,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:46:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 66937 states and 122354 transitions. [2025-01-09 03:46:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 03:46:49,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:49,412 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, 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:46:49,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:46:49,413 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:49,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:49,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1276489221, now seen corresponding path program 1 times [2025-01-09 03:46:49,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:49,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249666442] [2025-01-09 03:46:49,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:49,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:49,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 03:46:49,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 03:46:49,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:49,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:49,939 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:46:49,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:49,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249666442] [2025-01-09 03:46:49,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249666442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:49,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:49,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:46:49,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441136393] [2025-01-09 03:46:49,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:49,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:46:49,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:49,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:46:49,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:46:49,942 INFO L87 Difference]: Start difference. First operand 66937 states and 122354 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 4 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 03:46:53,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:53,871 INFO L93 Difference]: Finished difference Result 136433 states and 251459 transitions. [2025-01-09 03:46:53,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:46:53,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 4 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 143 [2025-01-09 03:46:53,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:54,477 INFO L225 Difference]: With dead ends: 136433 [2025-01-09 03:46:54,477 INFO L226 Difference]: Without dead ends: 69466 [2025-01-09 03:46:55,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:55,231 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 674 mSDsluCounter, 2478 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 3352 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:55,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 3352 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:46:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69466 states. [2025-01-09 03:46:57,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69466 to 69303. [2025-01-09 03:46:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69303 states, 54103 states have (on average 1.599966730125871) internal successors, (86563), 56243 states have internal predecessors, (86563), 11874 states have call successors, (11874), 3310 states have call predecessors, (11874), 3325 states have return successors, (27154), 11785 states have call predecessors, (27154), 11808 states have call successors, (27154) [2025-01-09 03:46:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69303 states to 69303 states and 125591 transitions. [2025-01-09 03:46:58,731 INFO L78 Accepts]: Start accepts. Automaton has 69303 states and 125591 transitions. Word has length 143 [2025-01-09 03:46:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:58,731 INFO L471 AbstractCegarLoop]: Abstraction has 69303 states and 125591 transitions. [2025-01-09 03:46:58,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 4 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 03:46:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 69303 states and 125591 transitions. [2025-01-09 03:46:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 03:46:58,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:58,742 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 03:46:58,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:46:58,743 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:58,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:58,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1801995687, now seen corresponding path program 1 times [2025-01-09 03:46:58,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:58,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46107608] [2025-01-09 03:46:58,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:58,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:58,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 03:46:58,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 03:46:58,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:58,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:46:59,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:59,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46107608] [2025-01-09 03:46:59,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46107608] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:46:59,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535014550] [2025-01-09 03:46:59,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:59,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:46:59,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:46:59,006 INFO L229 MonitoredProcess]: Starting monitored process 7 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:46:59,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:46:59,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 03:46:59,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 03:46:59,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:59,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:59,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 1907 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:46:59,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:46:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:46:59,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:46:59,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535014550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:59,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:46:59,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-01-09 03:46:59,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439530118] [2025-01-09 03:46:59,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:59,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:46:59,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:59,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:46:59,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:46:59,523 INFO L87 Difference]: Start difference. First operand 69303 states and 125591 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 5 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17)