./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product29.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_product29.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 0d12edbd4df2f08d75221f3c96b68e50e6394815b34a699d313e71ea24bf9c38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:47:24,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:47:24,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:47:24,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:47:24,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:47:24,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:47:24,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:47:24,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:47:24,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:47:24,128 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:47:24,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:47:24,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:47:24,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:47:24,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:47:24,129 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:47:24,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:47:24,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:47:24,129 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:47:24,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:47:24,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:47:24,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:47:24,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:47:24,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:47:24,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:47:24,129 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:47:24,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:47:24,129 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:47:24,129 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:47:24,130 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:47:24,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:47:24,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:47:24,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:47:24,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:47:24,130 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:47:24,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:47:24,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:47:24,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:47:24,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:47:24,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:47:24,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:47:24,130 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:47:24,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:47:24,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:47:24,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:47:24,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:47:24,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:47:24,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:47:24,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:47:24,131 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 -> 0d12edbd4df2f08d75221f3c96b68e50e6394815b34a699d313e71ea24bf9c38 [2025-01-09 03:47:24,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:47:24,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:47:24,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:47:24,364 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:47:24,364 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:47:24,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product29.cil.c [2025-01-09 03:47:25,716 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1cd6b6fb/ed630ac73e3e4eceabf54a078d6f77d9/FLAG6c36e2a04 [2025-01-09 03:47:26,103 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:47:26,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product29.cil.c [2025-01-09 03:47:26,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1cd6b6fb/ed630ac73e3e4eceabf54a078d6f77d9/FLAG6c36e2a04 [2025-01-09 03:47:26,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1cd6b6fb/ed630ac73e3e4eceabf54a078d6f77d9 [2025-01-09 03:47:26,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:47:26,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:47:26,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:47:26,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:47:26,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:47:26,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:47:26" (1/1) ... [2025-01-09 03:47:26,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5caa8ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:26, skipping insertion in model container [2025-01-09 03:47:26,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:47:26" (1/1) ... [2025-01-09 03:47:26,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:47:26,500 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_product29.cil.c[40506,40519] [2025-01-09 03:47:26,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:47:26,587 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:47:26,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2025-01-09 03:47:26,601 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [716] [2025-01-09 03:47:26,602 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [754] [2025-01-09 03:47:26,602 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1120] [2025-01-09 03:47:26,605 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1220] [2025-01-09 03:47:26,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1340] [2025-01-09 03:47:26,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [1358] [2025-01-09 03:47:26,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1548] [2025-01-09 03:47:26,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1897] [2025-01-09 03:47:26,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1906] [2025-01-09 03:47:26,681 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_product29.cil.c[40506,40519] [2025-01-09 03:47:26,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:47:26,732 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:47:26,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:26 WrapperNode [2025-01-09 03:47:26,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:47:26,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:47:26,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:47:26,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:47:26,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:26" (1/1) ... [2025-01-09 03:47:26,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:26" (1/1) ... [2025-01-09 03:47:26,796 INFO L138 Inliner]: procedures = 91, calls = 347, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 924 [2025-01-09 03:47:26,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:47:26,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:47:26,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:47:26,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:47:26,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:26" (1/1) ... [2025-01-09 03:47:26,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:26" (1/1) ... [2025-01-09 03:47:26,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:26" (1/1) ... [2025-01-09 03:47:26,832 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:47:26,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:26" (1/1) ... [2025-01-09 03:47:26,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:26" (1/1) ... [2025-01-09 03:47:26,849 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:26" (1/1) ... [2025-01-09 03:47:26,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:26" (1/1) ... [2025-01-09 03:47:26,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:26" (1/1) ... [2025-01-09 03:47:26,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:26" (1/1) ... [2025-01-09 03:47:26,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:26" (1/1) ... [2025-01-09 03:47:26,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:47:26,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:47:26,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:47:26,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:47:26,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:26" (1/1) ... [2025-01-09 03:47:26,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:47:26,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:47:26,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:47:26,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:47:26,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:47:26,964 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-01-09 03:47:26,964 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-01-09 03:47:26,964 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-01-09 03:47:26,964 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-01-09 03:47:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:47:26,965 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:47:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:47:26,965 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:47:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-01-09 03:47:26,965 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-01-09 03:47:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:47:26,965 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:47:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-01-09 03:47:26,965 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-01-09 03:47:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:47:26,965 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:47:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:47:26,965 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:47:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:47:26,965 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:47:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:47:26,965 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:47:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:47:26,965 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:47:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:47:26,965 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:47:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-01-09 03:47:26,965 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-01-09 03:47:26,966 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:47:26,966 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:47:26,966 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-01-09 03:47:26,966 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:47:26,966 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:47:26,966 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:47:26,966 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:47:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:47:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:47:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:47:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:47:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:47:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:47:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-01-09 03:47:26,967 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-01-09 03:47:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:47:26,967 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:47:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:47:26,967 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:47:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:47:26,967 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:47:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:47:26,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:47:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:47:26,967 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:47:27,147 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:47:27,149 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:47:28,616 INFO L? ?]: Removed 470 outVars from TransFormulas that were not future-live. [2025-01-09 03:47:28,616 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:47:28,655 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:47:28,656 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:47:28,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:47:28 BoogieIcfgContainer [2025-01-09 03:47:28,656 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:47:28,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:47:28,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:47:28,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:47:28,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:47:26" (1/3) ... [2025-01-09 03:47:28,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b53fe01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:47:28, skipping insertion in model container [2025-01-09 03:47:28,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:26" (2/3) ... [2025-01-09 03:47:28,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b53fe01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:47:28, skipping insertion in model container [2025-01-09 03:47:28,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:47:28" (3/3) ... [2025-01-09 03:47:28,669 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product29.cil.c [2025-01-09 03:47:28,685 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:47:28,687 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product29.cil.c that has 27 procedures, 596 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:47:28,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:47:28,771 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;@6efbad6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:47:28,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:47:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 596 states, 462 states have (on average 1.6774891774891776) internal successors, (775), 480 states have internal predecessors, (775), 106 states have call successors, (106), 26 states have call predecessors, (106), 26 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 03:47:28,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 03:47:28,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:28,807 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] [2025-01-09 03:47:28,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:28,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:28,812 INFO L85 PathProgramCache]: Analyzing trace with hash -982036824, now seen corresponding path program 1 times [2025-01-09 03:47:28,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:28,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478982495] [2025-01-09 03:47:28,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:28,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:28,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 03:47:29,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 03:47:29,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:29,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:29,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:29,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:29,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478982495] [2025-01-09 03:47:29,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478982495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:29,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:29,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:29,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957160833] [2025-01-09 03:47:29,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:29,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:29,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:29,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:29,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:29,522 INFO L87 Difference]: Start difference. First operand has 596 states, 462 states have (on average 1.6774891774891776) internal successors, (775), 480 states have internal predecessors, (775), 106 states have call successors, (106), 26 states have call predecessors, (106), 26 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) Second operand has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:47:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:29,699 INFO L93 Difference]: Finished difference Result 1189 states and 1986 transitions. [2025-01-09 03:47:29,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:47:29,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 99 [2025-01-09 03:47:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:29,714 INFO L225 Difference]: With dead ends: 1189 [2025-01-09 03:47:29,714 INFO L226 Difference]: Without dead ends: 601 [2025-01-09 03:47:29,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:47:29,726 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 91 mSDsluCounter, 4770 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5741 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:29,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5741 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:47:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-01-09 03:47:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 599. [2025-01-09 03:47:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 465 states have (on average 1.6709677419354838) internal successors, (777), 483 states have internal predecessors, (777), 107 states have call successors, (107), 26 states have call predecessors, (107), 26 states have return successors, (106), 102 states have call predecessors, (106), 104 states have call successors, (106) [2025-01-09 03:47:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 990 transitions. [2025-01-09 03:47:29,832 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 990 transitions. Word has length 99 [2025-01-09 03:47:29,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:29,834 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 990 transitions. [2025-01-09 03:47:29,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:47:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 990 transitions. [2025-01-09 03:47:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 03:47:29,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:29,841 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] [2025-01-09 03:47:29,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:47:29,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:29,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:29,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2032820004, now seen corresponding path program 1 times [2025-01-09 03:47:29,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:29,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796120353] [2025-01-09 03:47:29,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:29,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:29,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 03:47:29,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:47:29,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:29,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:30,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:30,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796120353] [2025-01-09 03:47:30,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796120353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:30,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:30,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:30,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145947441] [2025-01-09 03:47:30,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:30,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:30,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:30,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:30,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:30,177 INFO L87 Difference]: Start difference. First operand 599 states and 990 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:47:30,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:30,460 INFO L93 Difference]: Finished difference Result 1193 states and 1983 transitions. [2025-01-09 03:47:30,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:47:30,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 100 [2025-01-09 03:47:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:30,469 INFO L225 Difference]: With dead ends: 1193 [2025-01-09 03:47:30,469 INFO L226 Difference]: Without dead ends: 610 [2025-01-09 03:47:30,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:47:30,475 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 90 mSDsluCounter, 4764 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 5736 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:30,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 5736 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:47:30,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-01-09 03:47:30,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 599. [2025-01-09 03:47:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 465 states have (on average 1.6709677419354838) internal successors, (777), 483 states have internal predecessors, (777), 107 states have call successors, (107), 26 states have call predecessors, (107), 26 states have return successors, (106), 102 states have call predecessors, (106), 104 states have call successors, (106) [2025-01-09 03:47:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 990 transitions. [2025-01-09 03:47:30,524 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 990 transitions. Word has length 100 [2025-01-09 03:47:30,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:30,524 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 990 transitions. [2025-01-09 03:47:30,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:47:30,525 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 990 transitions. [2025-01-09 03:47:30,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 03:47:30,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:30,529 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] [2025-01-09 03:47:30,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:47:30,529 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:30,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:30,530 INFO L85 PathProgramCache]: Analyzing trace with hash -44800552, now seen corresponding path program 1 times [2025-01-09 03:47:30,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:30,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921174741] [2025-01-09 03:47:30,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:30,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:30,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 03:47:30,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:47:30,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:30,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:30,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:30,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921174741] [2025-01-09 03:47:30,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921174741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:30,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:30,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:30,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453221046] [2025-01-09 03:47:30,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:30,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:30,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:30,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:30,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:30,732 INFO L87 Difference]: Start difference. First operand 599 states and 990 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:47:30,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:30,814 INFO L93 Difference]: Finished difference Result 1180 states and 1961 transitions. [2025-01-09 03:47:30,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:47:30,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2025-01-09 03:47:30,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:30,822 INFO L225 Difference]: With dead ends: 1180 [2025-01-09 03:47:30,823 INFO L226 Difference]: Without dead ends: 569 [2025-01-09 03:47:30,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:47:30,828 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 14 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2875 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:30,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2875 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:30,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-01-09 03:47:30,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2025-01-09 03:47:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 438 states have (on average 1.6552511415525115) internal successors, (725), 454 states have internal predecessors, (725), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-01-09 03:47:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 934 transitions. [2025-01-09 03:47:30,863 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 934 transitions. Word has length 100 [2025-01-09 03:47:30,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:30,864 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 934 transitions. [2025-01-09 03:47:30,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:47:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 934 transitions. [2025-01-09 03:47:30,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:47:30,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:30,869 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] [2025-01-09 03:47:30,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:47:30,869 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:30,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash -286387892, now seen corresponding path program 1 times [2025-01-09 03:47:30,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:30,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806999157] [2025-01-09 03:47:30,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:30,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:30,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:47:30,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:47:30,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:30,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:31,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:31,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806999157] [2025-01-09 03:47:31,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806999157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:31,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:31,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:31,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304802631] [2025-01-09 03:47:31,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:31,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:31,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:31,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:31,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:31,081 INFO L87 Difference]: Start difference. First operand 569 states and 934 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:47:31,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:31,143 INFO L93 Difference]: Finished difference Result 1131 states and 1867 transitions. [2025-01-09 03:47:31,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:47:31,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 101 [2025-01-09 03:47:31,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:31,147 INFO L225 Difference]: With dead ends: 1131 [2025-01-09 03:47:31,147 INFO L226 Difference]: Without dead ends: 563 [2025-01-09 03:47:31,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:47:31,150 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 63 mSDsluCounter, 4562 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5486 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:31,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5486 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-01-09 03:47:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-01-09 03:47:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 432 states have (on average 1.6481481481481481) internal successors, (712), 448 states have internal predecessors, (712), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-01-09 03:47:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 921 transitions. [2025-01-09 03:47:31,166 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 921 transitions. Word has length 101 [2025-01-09 03:47:31,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:31,167 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 921 transitions. [2025-01-09 03:47:31,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:47:31,167 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 921 transitions. [2025-01-09 03:47:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:47:31,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:31,169 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:47:31,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:47:31,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:31,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:31,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2020594944, now seen corresponding path program 1 times [2025-01-09 03:47:31,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:31,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17388121] [2025-01-09 03:47:31,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:31,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:31,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:47:31,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:47:31,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:31,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:31,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:31,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17388121] [2025-01-09 03:47:31,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17388121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:31,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:31,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:31,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991329310] [2025-01-09 03:47:31,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:31,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:31,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:31,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:31,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:31,353 INFO L87 Difference]: Start difference. First operand 563 states and 921 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:47:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:31,417 INFO L93 Difference]: Finished difference Result 1119 states and 1841 transitions. [2025-01-09 03:47:31,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:47:31,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 102 [2025-01-09 03:47:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:31,420 INFO L225 Difference]: With dead ends: 1119 [2025-01-09 03:47:31,420 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 03:47:31,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:47:31,423 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 49 mSDsluCounter, 4514 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5426 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:31,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5426 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 03:47:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-01-09 03:47:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 426 states have (on average 1.6408450704225352) internal successors, (699), 442 states have internal predecessors, (699), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-01-09 03:47:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 908 transitions. [2025-01-09 03:47:31,443 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 908 transitions. Word has length 102 [2025-01-09 03:47:31,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:31,443 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 908 transitions. [2025-01-09 03:47:31,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:47:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 908 transitions. [2025-01-09 03:47:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:47:31,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:31,446 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:47:31,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:47:31,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:31,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:31,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1093785153, now seen corresponding path program 1 times [2025-01-09 03:47:31,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:31,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376835971] [2025-01-09 03:47:31,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:31,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:31,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:47:31,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:47:31,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:31,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:31,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:47:31,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:31,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376835971] [2025-01-09 03:47:31,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376835971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:31,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:31,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:31,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489234286] [2025-01-09 03:47:31,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:31,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:31,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:31,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:31,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:31,643 INFO L87 Difference]: Start difference. First operand 557 states and 908 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:47:31,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:31,715 INFO L93 Difference]: Finished difference Result 1107 states and 1815 transitions. [2025-01-09 03:47:31,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:47:31,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 102 [2025-01-09 03:47:31,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:31,720 INFO L225 Difference]: With dead ends: 1107 [2025-01-09 03:47:31,720 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 03:47:31,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:47:31,725 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 24 mSDsluCounter, 4478 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5378 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:31,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5378 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 03:47:31,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-01-09 03:47:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 426 states have (on average 1.6384976525821595) internal successors, (698), 442 states have internal predecessors, (698), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-01-09 03:47:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 907 transitions. [2025-01-09 03:47:31,752 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 907 transitions. Word has length 102 [2025-01-09 03:47:31,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:31,752 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 907 transitions. [2025-01-09 03:47:31,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:47:31,752 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 907 transitions. [2025-01-09 03:47:31,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 03:47:31,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:31,756 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, 1] [2025-01-09 03:47:31,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:47:31,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:31,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:31,757 INFO L85 PathProgramCache]: Analyzing trace with hash 14533616, now seen corresponding path program 1 times [2025-01-09 03:47:31,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:31,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386237684] [2025-01-09 03:47:31,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:31,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:31,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:47:31,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:47:31,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:31,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:31,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:31,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386237684] [2025-01-09 03:47:31,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386237684] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:31,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:31,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:31,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286689936] [2025-01-09 03:47:31,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:31,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:31,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:31,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:31,910 INFO L87 Difference]: Start difference. First operand 557 states and 907 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:47:31,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:31,982 INFO L93 Difference]: Finished difference Result 1098 states and 1800 transitions. [2025-01-09 03:47:31,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:31,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 103 [2025-01-09 03:47:31,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:31,988 INFO L225 Difference]: With dead ends: 1098 [2025-01-09 03:47:31,988 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 03:47:31,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:31,992 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 15 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2661 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:31,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2661 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:31,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 03:47:32,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-01-09 03:47:32,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 426 states have (on average 1.636150234741784) internal successors, (697), 442 states have internal predecessors, (697), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-01-09 03:47:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 906 transitions. [2025-01-09 03:47:32,017 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 906 transitions. Word has length 103 [2025-01-09 03:47:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:32,017 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 906 transitions. [2025-01-09 03:47:32,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:47:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 906 transitions. [2025-01-09 03:47:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 03:47:32,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:32,021 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, 1, 1] [2025-01-09 03:47:32,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:47:32,022 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:32,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:32,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2081198560, now seen corresponding path program 1 times [2025-01-09 03:47:32,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:32,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956202644] [2025-01-09 03:47:32,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:32,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:32,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 03:47:32,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 03:47:32,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:32,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:32,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:32,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956202644] [2025-01-09 03:47:32,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956202644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:32,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:32,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:32,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380025022] [2025-01-09 03:47:32,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:32,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:32,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:32,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:32,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:32,167 INFO L87 Difference]: Start difference. First operand 557 states and 906 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:47:32,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:32,215 INFO L93 Difference]: Finished difference Result 1098 states and 1798 transitions. [2025-01-09 03:47:32,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:32,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-01-09 03:47:32,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:32,220 INFO L225 Difference]: With dead ends: 1098 [2025-01-09 03:47:32,220 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 03:47:32,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:32,224 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 14 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2663 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:32,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2663 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:32,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 03:47:32,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-01-09 03:47:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 426 states have (on average 1.6338028169014085) internal successors, (696), 442 states have internal predecessors, (696), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-01-09 03:47:32,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 905 transitions. [2025-01-09 03:47:32,245 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 905 transitions. Word has length 104 [2025-01-09 03:47:32,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:32,246 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 905 transitions. [2025-01-09 03:47:32,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:47:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 905 transitions. [2025-01-09 03:47:32,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 03:47:32,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:32,249 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, 1, 1, 1] [2025-01-09 03:47:32,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:47:32,249 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:32,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:32,250 INFO L85 PathProgramCache]: Analyzing trace with hash -695074251, now seen corresponding path program 1 times [2025-01-09 03:47:32,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:32,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927251135] [2025-01-09 03:47:32,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:32,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:32,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 03:47:32,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 03:47:32,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:32,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:32,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:32,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927251135] [2025-01-09 03:47:32,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927251135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:32,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:32,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:32,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861437567] [2025-01-09 03:47:32,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:32,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:32,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:32,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:32,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:32,375 INFO L87 Difference]: Start difference. First operand 557 states and 905 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:47:32,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:32,414 INFO L93 Difference]: Finished difference Result 1098 states and 1796 transitions. [2025-01-09 03:47:32,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:32,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 105 [2025-01-09 03:47:32,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:32,418 INFO L225 Difference]: With dead ends: 1098 [2025-01-09 03:47:32,419 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 03:47:32,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:32,422 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 13 mSDsluCounter, 1771 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2665 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:32,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2665 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:32,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 03:47:32,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-01-09 03:47:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 426 states have (on average 1.6314553990610328) internal successors, (695), 442 states have internal predecessors, (695), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-01-09 03:47:32,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 904 transitions. [2025-01-09 03:47:32,440 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 904 transitions. Word has length 105 [2025-01-09 03:47:32,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:32,440 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 904 transitions. [2025-01-09 03:47:32,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:47:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 904 transitions. [2025-01-09 03:47:32,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:47:32,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:47:32,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:47:32,443 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:32,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:32,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1016405189, now seen corresponding path program 1 times [2025-01-09 03:47:32,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:32,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896170268] [2025-01-09 03:47:32,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:32,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:32,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:47:32,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:47:32,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:32,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:32,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:32,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896170268] [2025-01-09 03:47:32,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896170268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:32,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:32,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:32,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305394594] [2025-01-09 03:47:32,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:32,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:32,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:32,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:32,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:32,562 INFO L87 Difference]: Start difference. First operand 557 states and 904 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:47:32,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:32,609 INFO L93 Difference]: Finished difference Result 1098 states and 1794 transitions. [2025-01-09 03:47:32,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:32,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 106 [2025-01-09 03:47:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:32,615 INFO L225 Difference]: With dead ends: 1098 [2025-01-09 03:47:32,615 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 03:47:32,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:32,619 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 12 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:32,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2667 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:32,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 03:47:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-01-09 03:47:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 426 states have (on average 1.6291079812206573) internal successors, (694), 442 states have internal predecessors, (694), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-01-09 03:47:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 903 transitions. [2025-01-09 03:47:32,637 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 903 transitions. Word has length 106 [2025-01-09 03:47:32,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:32,637 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 903 transitions. [2025-01-09 03:47:32,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:47:32,637 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 903 transitions. [2025-01-09 03:47:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:47:32,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:32,640 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, 1, 1, 1, 1, 1] [2025-01-09 03:47:32,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:47:32,641 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:32,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:32,641 INFO L85 PathProgramCache]: Analyzing trace with hash 114283642, now seen corresponding path program 1 times [2025-01-09 03:47:32,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:32,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425948420] [2025-01-09 03:47:32,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:32,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:32,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:47:32,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:47:32,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:32,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:32,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:32,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425948420] [2025-01-09 03:47:32,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425948420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:32,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:32,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:32,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776778368] [2025-01-09 03:47:32,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:32,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:32,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:32,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:32,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:32,821 INFO L87 Difference]: Start difference. First operand 557 states and 903 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:47:33,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:33,404 INFO L93 Difference]: Finished difference Result 1580 states and 2591 transitions. [2025-01-09 03:47:33,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:47:33,404 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), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 107 [2025-01-09 03:47:33,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:33,411 INFO L225 Difference]: With dead ends: 1580 [2025-01-09 03:47:33,411 INFO L226 Difference]: Without dead ends: 1041 [2025-01-09 03:47:33,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:47:33,415 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 767 mSDsluCounter, 3435 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 4380 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:33,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 4380 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 03:47:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2025-01-09 03:47:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1033. [2025-01-09 03:47:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 793 states have (on average 1.5952080706179066) internal successors, (1265), 823 states have internal predecessors, (1265), 194 states have call successors, (194), 49 states have call predecessors, (194), 45 states have return successors, (195), 185 states have call predecessors, (195), 190 states have call successors, (195) [2025-01-09 03:47:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1654 transitions. [2025-01-09 03:47:33,452 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1654 transitions. Word has length 107 [2025-01-09 03:47:33,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:33,453 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1654 transitions. [2025-01-09 03:47:33,453 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), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:47:33,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1654 transitions. [2025-01-09 03:47:33,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:47:33,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:33,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:47:33,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:47:33,455 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:33,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:33,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1945449826, now seen corresponding path program 1 times [2025-01-09 03:47:33,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:33,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510840808] [2025-01-09 03:47:33,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:33,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:33,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:47:33,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:47:33,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:33,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 03:47:33,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:33,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510840808] [2025-01-09 03:47:33,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510840808] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:47:33,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68933597] [2025-01-09 03:47:33,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:33,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:47:33,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:47:33,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:47:33,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:47:33,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:47:34,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:47:34,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:34,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:34,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 1626 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:47:34,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:47:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:47:34,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:47:34,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68933597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:34,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:47:34,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:47:34,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619258697] [2025-01-09 03:47:34,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:34,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:47:34,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:34,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:47:34,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:34,132 INFO L87 Difference]: Start difference. First operand 1033 states and 1654 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:47:34,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:34,222 INFO L93 Difference]: Finished difference Result 2977 states and 4834 transitions. [2025-01-09 03:47:34,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:47:34,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2025-01-09 03:47:34,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:34,236 INFO L225 Difference]: With dead ends: 2977 [2025-01-09 03:47:34,236 INFO L226 Difference]: Without dead ends: 1962 [2025-01-09 03:47:34,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 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:47:34,244 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 828 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:34,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1764 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:34,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-01-09 03:47:34,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1901. [2025-01-09 03:47:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1468 states have (on average 1.6137602179836512) internal successors, (2369), 1528 states have internal predecessors, (2369), 347 states have call successors, (347), 88 states have call predecessors, (347), 85 states have return successors, (362), 334 states have call predecessors, (362), 343 states have call successors, (362) [2025-01-09 03:47:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 3078 transitions. [2025-01-09 03:47:34,327 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 3078 transitions. Word has length 112 [2025-01-09 03:47:34,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:34,328 INFO L471 AbstractCegarLoop]: Abstraction has 1901 states and 3078 transitions. [2025-01-09 03:47:34,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:47:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 3078 transitions. [2025-01-09 03:47:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:47:34,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:34,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:47:34,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:47:34,536 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,SelfDestructingSolverStorable11 [2025-01-09 03:47:34,536 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:34,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:34,537 INFO L85 PathProgramCache]: Analyzing trace with hash 464621158, now seen corresponding path program 1 times [2025-01-09 03:47:34,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:34,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787102196] [2025-01-09 03:47:34,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:34,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:34,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:47:34,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:47:34,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:34,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 03:47:34,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:34,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787102196] [2025-01-09 03:47:34,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787102196] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:47:34,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228306518] [2025-01-09 03:47:34,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:34,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:47:34,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:47:34,705 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:47:34,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:47:34,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:47:35,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:47:35,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:35,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:35,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 1628 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:47:35,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:47:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:47:35,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:47:35,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228306518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:35,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:47:35,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:47:35,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309163359] [2025-01-09 03:47:35,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:35,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:47:35,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:35,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:47:35,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:35,201 INFO L87 Difference]: Start difference. First operand 1901 states and 3078 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:47:35,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:35,326 INFO L93 Difference]: Finished difference Result 4266 states and 6945 transitions. [2025-01-09 03:47:35,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:47:35,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2025-01-09 03:47:35,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:35,346 INFO L225 Difference]: With dead ends: 4266 [2025-01-09 03:47:35,346 INFO L226 Difference]: Without dead ends: 2383 [2025-01-09 03:47:35,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 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:47:35,359 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 826 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:35,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1697 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:35,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2025-01-09 03:47:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2336. [2025-01-09 03:47:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 1807 states have (on average 1.6258992805755397) internal successors, (2938), 1882 states have internal predecessors, (2938), 424 states have call successors, (424), 106 states have call predecessors, (424), 104 states have return successors, (443), 410 states have call predecessors, (443), 420 states have call successors, (443) [2025-01-09 03:47:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3805 transitions. [2025-01-09 03:47:35,479 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3805 transitions. Word has length 114 [2025-01-09 03:47:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:35,479 INFO L471 AbstractCegarLoop]: Abstraction has 2336 states and 3805 transitions. [2025-01-09 03:47:35,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:47:35,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3805 transitions. [2025-01-09 03:47:35,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:47:35,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:35,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:47:35,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:47:35,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:47:35,689 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:35,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:35,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1369995875, now seen corresponding path program 1 times [2025-01-09 03:47:35,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:35,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863291330] [2025-01-09 03:47:35,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:35,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:35,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:47:35,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:47:35,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:35,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:35,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:47:35,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:35,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863291330] [2025-01-09 03:47:35,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863291330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:35,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:35,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:35,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421503090] [2025-01-09 03:47:35,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:35,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:35,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:35,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:35,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:35,877 INFO L87 Difference]: Start difference. First operand 2336 states and 3805 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:47:36,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:36,428 INFO L93 Difference]: Finished difference Result 6904 states and 11475 transitions. [2025-01-09 03:47:36,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:47:36,429 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 116 [2025-01-09 03:47:36,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:36,468 INFO L225 Difference]: With dead ends: 6904 [2025-01-09 03:47:36,468 INFO L226 Difference]: Without dead ends: 4586 [2025-01-09 03:47:36,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:47:36,490 INFO L435 NwaCegarLoop]: 1014 mSDtfsCounter, 897 mSDsluCounter, 3644 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 4658 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:36,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 4658 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:47:36,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4586 states. [2025-01-09 03:47:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4586 to 4533. [2025-01-09 03:47:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4533 states, 3509 states have (on average 1.6221145625534341) internal successors, (5692), 3654 states have internal predecessors, (5692), 818 states have call successors, (818), 206 states have call predecessors, (818), 205 states have return successors, (1003), 798 states have call predecessors, (1003), 812 states have call successors, (1003) [2025-01-09 03:47:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4533 states to 4533 states and 7513 transitions. [2025-01-09 03:47:36,804 INFO L78 Accepts]: Start accepts. Automaton has 4533 states and 7513 transitions. Word has length 116 [2025-01-09 03:47:36,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:36,804 INFO L471 AbstractCegarLoop]: Abstraction has 4533 states and 7513 transitions. [2025-01-09 03:47:36,805 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:47:36,805 INFO L276 IsEmpty]: Start isEmpty. Operand 4533 states and 7513 transitions. [2025-01-09 03:47:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:47:36,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:36,809 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:47:36,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:47:36,809 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:36,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:36,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1857949404, now seen corresponding path program 1 times [2025-01-09 03:47:36,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:36,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213823826] [2025-01-09 03:47:36,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:36,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:36,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:47:36,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:47:36,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:36,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:47:36,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:36,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213823826] [2025-01-09 03:47:36,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213823826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:36,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:36,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:36,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10657260] [2025-01-09 03:47:36,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:36,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:36,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:36,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:36,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:36,973 INFO L87 Difference]: Start difference. First operand 4533 states and 7513 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:47:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:37,455 INFO L93 Difference]: Finished difference Result 9072 states and 15169 transitions. [2025-01-09 03:47:37,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:47:37,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 118 [2025-01-09 03:47:37,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:37,528 INFO L225 Difference]: With dead ends: 9072 [2025-01-09 03:47:37,534 INFO L226 Difference]: Without dead ends: 4557 [2025-01-09 03:47:37,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:47:37,598 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 12 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2631 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:37,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2631 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:47:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4557 states. [2025-01-09 03:47:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4557 to 4541. [2025-01-09 03:47:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4541 states, 3515 states have (on average 1.6204836415362731) internal successors, (5696), 3660 states have internal predecessors, (5696), 818 states have call successors, (818), 210 states have call predecessors, (818), 207 states have return successors, (993), 796 states have call predecessors, (993), 812 states have call successors, (993) [2025-01-09 03:47:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 7507 transitions. [2025-01-09 03:47:38,153 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 7507 transitions. Word has length 118 [2025-01-09 03:47:38,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:38,157 INFO L471 AbstractCegarLoop]: Abstraction has 4541 states and 7507 transitions. [2025-01-09 03:47:38,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:47:38,158 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 7507 transitions. [2025-01-09 03:47:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 03:47:38,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:38,166 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:47:38,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:47:38,166 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:38,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash -615760728, now seen corresponding path program 1 times [2025-01-09 03:47:38,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:38,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824643221] [2025-01-09 03:47:38,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:38,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 03:47:38,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 03:47:38,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:38,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 03:47:38,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:38,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824643221] [2025-01-09 03:47:38,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824643221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:38,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:38,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:38,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566985232] [2025-01-09 03:47:38,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:38,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:38,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:38,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:38,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:38,373 INFO L87 Difference]: Start difference. First operand 4541 states and 7507 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:47:39,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:39,270 INFO L93 Difference]: Finished difference Result 13568 states and 23019 transitions. [2025-01-09 03:47:39,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:47:39,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 126 [2025-01-09 03:47:39,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:39,344 INFO L225 Difference]: With dead ends: 13568 [2025-01-09 03:47:39,344 INFO L226 Difference]: Without dead ends: 9045 [2025-01-09 03:47:39,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:47:39,367 INFO L435 NwaCegarLoop]: 974 mSDtfsCounter, 892 mSDsluCounter, 3535 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 4509 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:39,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 4509 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:47:39,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9045 states. [2025-01-09 03:47:39,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9045 to 8976. [2025-01-09 03:47:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8976 states, 6951 states have (on average 1.6171773845489859) internal successors, (11241), 7236 states have internal predecessors, (11241), 1611 states have call successors, (1611), 414 states have call predecessors, (1611), 413 states have return successors, (2318), 1577 states have call predecessors, (2318), 1601 states have call successors, (2318) [2025-01-09 03:47:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8976 states to 8976 states and 15170 transitions. [2025-01-09 03:47:39,820 INFO L78 Accepts]: Start accepts. Automaton has 8976 states and 15170 transitions. Word has length 126 [2025-01-09 03:47:39,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:39,821 INFO L471 AbstractCegarLoop]: Abstraction has 8976 states and 15170 transitions. [2025-01-09 03:47:39,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:47:39,821 INFO L276 IsEmpty]: Start isEmpty. Operand 8976 states and 15170 transitions. [2025-01-09 03:47:39,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:47:39,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:39,824 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:47:39,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:47:39,825 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:39,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:39,825 INFO L85 PathProgramCache]: Analyzing trace with hash -383535130, now seen corresponding path program 1 times [2025-01-09 03:47:39,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:39,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592506412] [2025-01-09 03:47:39,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:39,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:39,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:47:39,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:47:39,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:39,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:47:39,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:39,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592506412] [2025-01-09 03:47:39,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592506412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:39,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:39,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:39,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111809510] [2025-01-09 03:47:39,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:39,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:39,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:39,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:39,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:39,907 INFO L87 Difference]: Start difference. First operand 8976 states and 15170 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:47:40,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:40,334 INFO L93 Difference]: Finished difference Result 18006 states and 30825 transitions. [2025-01-09 03:47:40,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:47:40,335 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 127 [2025-01-09 03:47:40,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:40,475 INFO L225 Difference]: With dead ends: 18006 [2025-01-09 03:47:40,475 INFO L226 Difference]: Without dead ends: 9048 [2025-01-09 03:47:40,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:47:40,530 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 12 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:40,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2622 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:47:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9048 states. [2025-01-09 03:47:40,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9048 to 9016. [2025-01-09 03:47:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9016 states, 6987 states have (on average 1.6145699155574638) internal successors, (11281), 7264 states have internal predecessors, (11281), 1611 states have call successors, (1611), 430 states have call predecessors, (1611), 417 states have return successors, (2304), 1573 states have call predecessors, (2304), 1601 states have call successors, (2304) [2025-01-09 03:47:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9016 states to 9016 states and 15196 transitions. [2025-01-09 03:47:40,960 INFO L78 Accepts]: Start accepts. Automaton has 9016 states and 15196 transitions. Word has length 127 [2025-01-09 03:47:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:40,960 INFO L471 AbstractCegarLoop]: Abstraction has 9016 states and 15196 transitions. [2025-01-09 03:47:40,960 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:47:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 9016 states and 15196 transitions. [2025-01-09 03:47:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 03:47:40,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:40,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:47:40,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:47:40,967 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:40,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:40,968 INFO L85 PathProgramCache]: Analyzing trace with hash -533729841, now seen corresponding path program 1 times [2025-01-09 03:47:40,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:40,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622205611] [2025-01-09 03:47:40,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:40,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:40,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 03:47:41,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 03:47:41,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:41,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:47:41,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:41,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622205611] [2025-01-09 03:47:41,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622205611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:41,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:41,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:41,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147492102] [2025-01-09 03:47:41,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:41,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:41,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:41,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:41,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:41,371 INFO L87 Difference]: Start difference. First operand 9016 states and 15196 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 03:47:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:42,866 INFO L93 Difference]: Finished difference Result 27066 states and 47329 transitions. [2025-01-09 03:47:42,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:47:42,867 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 136 [2025-01-09 03:47:42,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:43,007 INFO L225 Difference]: With dead ends: 27066 [2025-01-09 03:47:43,007 INFO L226 Difference]: Without dead ends: 18068 [2025-01-09 03:47:43,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:47:43,078 INFO L435 NwaCegarLoop]: 1011 mSDtfsCounter, 887 mSDsluCounter, 3655 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 4666 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:43,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 4666 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 03:47:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18068 states. [2025-01-09 03:47:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18068 to 17967. [2025-01-09 03:47:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17967 states, 13927 states have (on average 1.611402312055719) internal successors, (22442), 14476 states have internal predecessors, (22442), 3202 states have call successors, (3202), 854 states have call predecessors, (3202), 837 states have return successors, (5629), 3140 states have call predecessors, (5629), 3184 states have call successors, (5629) [2025-01-09 03:47:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17967 states to 17967 states and 31273 transitions. [2025-01-09 03:47:43,849 INFO L78 Accepts]: Start accepts. Automaton has 17967 states and 31273 transitions. Word has length 136 [2025-01-09 03:47:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:43,849 INFO L471 AbstractCegarLoop]: Abstraction has 17967 states and 31273 transitions. [2025-01-09 03:47:43,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 03:47:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 17967 states and 31273 transitions. [2025-01-09 03:47:43,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 03:47:43,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:43,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:47:43,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:47:43,857 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:43,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:43,859 INFO L85 PathProgramCache]: Analyzing trace with hash -84600546, now seen corresponding path program 1 times [2025-01-09 03:47:43,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:43,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916314748] [2025-01-09 03:47:43,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:43,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:43,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 03:47:43,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 03:47:43,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:43,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 03:47:44,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:44,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916314748] [2025-01-09 03:47:44,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916314748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:44,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:44,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:44,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034969739] [2025-01-09 03:47:44,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:44,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:44,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:44,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:44,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:44,014 INFO L87 Difference]: Start difference. First operand 17967 states and 31273 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:47:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:44,918 INFO L93 Difference]: Finished difference Result 36060 states and 64127 transitions. [2025-01-09 03:47:44,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:47:44,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2025-01-09 03:47:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:45,261 INFO L225 Difference]: With dead ends: 36060 [2025-01-09 03:47:45,261 INFO L226 Difference]: Without dead ends: 18111 [2025-01-09 03:47:45,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:47:45,679 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 11 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:45,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2625 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:45,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18111 states. [2025-01-09 03:47:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18111 to 18047. [2025-01-09 03:47:46,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18047 states, 13999 states have (on average 1.6088292020858632) internal successors, (22522), 14548 states have internal predecessors, (22522), 3202 states have call successors, (3202), 870 states have call predecessors, (3202), 845 states have return successors, (5613), 3132 states have call predecessors, (5613), 3184 states have call successors, (5613) [2025-01-09 03:47:46,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18047 states to 18047 states and 31337 transitions. [2025-01-09 03:47:46,646 INFO L78 Accepts]: Start accepts. Automaton has 18047 states and 31337 transitions. Word has length 139 [2025-01-09 03:47:46,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:46,647 INFO L471 AbstractCegarLoop]: Abstraction has 18047 states and 31337 transitions. [2025-01-09 03:47:46,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:47:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 18047 states and 31337 transitions. [2025-01-09 03:47:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 03:47:46,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:46,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:47:46,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:47:46,658 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:46,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:46,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1519278530, now seen corresponding path program 1 times [2025-01-09 03:47:46,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:46,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257083992] [2025-01-09 03:47:46,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:46,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:46,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 03:47:46,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 03:47:46,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:46,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 03:47:46,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:46,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257083992] [2025-01-09 03:47:46,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257083992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:46,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:46,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:46,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284389871] [2025-01-09 03:47:46,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:46,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:46,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:46,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:46,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:46,884 INFO L87 Difference]: Start difference. First operand 18047 states and 31337 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:47:49,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:49,339 INFO L93 Difference]: Finished difference Result 54280 states and 99687 transitions. [2025-01-09 03:47:49,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:47:49,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 148 [2025-01-09 03:47:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:49,736 INFO L225 Difference]: With dead ends: 54280 [2025-01-09 03:47:49,737 INFO L226 Difference]: Without dead ends: 36251 [2025-01-09 03:47:49,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:47:49,903 INFO L435 NwaCegarLoop]: 964 mSDtfsCounter, 886 mSDsluCounter, 3528 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 4492 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:49,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 4492 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:47:49,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36251 states. [2025-01-09 03:47:51,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36251 to 36086. [2025-01-09 03:47:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36086 states, 27995 states have (on average 1.605679585640293) internal successors, (44951), 29088 states have internal predecessors, (44951), 6389 states have call successors, (6389), 1734 states have call predecessors, (6389), 1701 states have return successors, (14622), 6271 states have call predecessors, (14622), 6355 states have call successors, (14622) [2025-01-09 03:47:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36086 states to 36086 states and 65962 transitions. [2025-01-09 03:47:51,936 INFO L78 Accepts]: Start accepts. Automaton has 36086 states and 65962 transitions. Word has length 148 [2025-01-09 03:47:51,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:51,937 INFO L471 AbstractCegarLoop]: Abstraction has 36086 states and 65962 transitions. [2025-01-09 03:47:51,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:47:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 36086 states and 65962 transitions. [2025-01-09 03:47:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 03:47:51,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:51,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:47:51,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:47:51,944 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:51,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:51,945 INFO L85 PathProgramCache]: Analyzing trace with hash -576875318, now seen corresponding path program 1 times [2025-01-09 03:47:51,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:51,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680743245] [2025-01-09 03:47:51,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:51,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:51,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 03:47:51,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 03:47:51,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:51,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:47:52,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680743245] [2025-01-09 03:47:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680743245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:52,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:52,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:52,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697690943] [2025-01-09 03:47:52,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:52,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:52,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:52,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:52,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:52,170 INFO L87 Difference]: Start difference. First operand 36086 states and 65962 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:47:54,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:54,963 INFO L93 Difference]: Finished difference Result 72407 states and 137311 transitions. [2025-01-09 03:47:54,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:47:54,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 151 [2025-01-09 03:47:54,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:55,314 INFO L225 Difference]: With dead ends: 72407 [2025-01-09 03:47:55,314 INFO L226 Difference]: Without dead ends: 36291 [2025-01-09 03:47:55,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:47:55,962 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 9 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:55,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2622 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:47:55,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36291 states. [2025-01-09 03:47:57,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36291 to 36165. [2025-01-09 03:47:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36165 states, 28067 states have (on average 1.6025581643923468) internal successors, (44979), 29173 states have internal predecessors, (44979), 6382 states have call successors, (6382), 1748 states have call predecessors, (6382), 1715 states have return successors, (14522), 6250 states have call predecessors, (14522), 6348 states have call successors, (14522) [2025-01-09 03:47:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36165 states to 36165 states and 65883 transitions. [2025-01-09 03:47:58,157 INFO L78 Accepts]: Start accepts. Automaton has 36165 states and 65883 transitions. Word has length 151 [2025-01-09 03:47:58,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:58,157 INFO L471 AbstractCegarLoop]: Abstraction has 36165 states and 65883 transitions. [2025-01-09 03:47:58,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:47:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 36165 states and 65883 transitions. [2025-01-09 03:47:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 03:47:58,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:58,167 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, 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] [2025-01-09 03:47:58,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:47:58,168 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:58,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:58,168 INFO L85 PathProgramCache]: Analyzing trace with hash -826699163, now seen corresponding path program 1 times [2025-01-09 03:47:58,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:58,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881229290] [2025-01-09 03:47:58,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:58,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:58,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 03:47:58,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 03:47:58,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:58,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:47:58,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:58,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881229290] [2025-01-09 03:47:58,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881229290] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:47:58,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837652659] [2025-01-09 03:47:58,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:58,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:47:58,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:47:58,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:47:58,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:47:58,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 03:47:58,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 03:47:58,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:58,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:58,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 2052 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:47:58,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:47:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 03:47:58,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:47:58,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837652659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:58,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:47:58,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 03:47:58,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515586597] [2025-01-09 03:47:58,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:58,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:47:58,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:58,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:47:58,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:47:58,633 INFO L87 Difference]: Start difference. First operand 36165 states and 65883 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:48:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:00,912 INFO L93 Difference]: Finished difference Result 80693 states and 151721 transitions. [2025-01-09 03:48:00,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:00,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 184 [2025-01-09 03:48:00,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:01,359 INFO L225 Difference]: With dead ends: 80693 [2025-01-09 03:48:01,359 INFO L226 Difference]: Without dead ends: 58357 [2025-01-09 03:48:01,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:48:01,693 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 889 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 1798 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:48:01,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 1798 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:01,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58357 states. [2025-01-09 03:48:03,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58357 to 58113. [2025-01-09 03:48:03,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58113 states, 45217 states have (on average 1.6158966760289273) internal successors, (73066), 46933 states have internal predecessors, (73066), 10124 states have call successors, (10124), 2756 states have call predecessors, (10124), 2771 states have return successors, (24849), 10054 states have call predecessors, (24849), 10074 states have call successors, (24849) [2025-01-09 03:48:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58113 states to 58113 states and 108039 transitions. [2025-01-09 03:48:04,928 INFO L78 Accepts]: Start accepts. Automaton has 58113 states and 108039 transitions. Word has length 184 [2025-01-09 03:48:04,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:04,928 INFO L471 AbstractCegarLoop]: Abstraction has 58113 states and 108039 transitions. [2025-01-09 03:48:04,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:48:04,928 INFO L276 IsEmpty]: Start isEmpty. Operand 58113 states and 108039 transitions. [2025-01-09 03:48:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-09 03:48:04,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:04,944 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:04,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:48:05,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:05,146 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:05,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:05,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1196977580, now seen corresponding path program 1 times [2025-01-09 03:48:05,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:05,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021408147] [2025-01-09 03:48:05,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:05,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:05,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 03:48:05,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 03:48:05,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:05,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:48:05,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:05,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021408147] [2025-01-09 03:48:05,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021408147] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:05,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188084454] [2025-01-09 03:48:05,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:05,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:05,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:05,392 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:48:05,395 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:48:05,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 03:48:05,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 03:48:05,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:05,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:05,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 2072 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:48:05,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:05,958 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:48:05,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:05,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188084454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:05,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:05,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-01-09 03:48:05,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586880122] [2025-01-09 03:48:05,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:05,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:48:05,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:05,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:48:05,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:48:05,964 INFO L87 Difference]: Start difference. First operand 58113 states and 108039 transitions. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 7 states have internal predecessors, (140), 5 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 5 states have call successors, (22) [2025-01-09 03:48:15,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:15,071 INFO L93 Difference]: Finished difference Result 152888 states and 308511 transitions. [2025-01-09 03:48:15,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 03:48:15,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 7 states have internal predecessors, (140), 5 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 5 states have call successors, (22) Word has length 190 [2025-01-09 03:48:15,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:16,112 INFO L225 Difference]: With dead ends: 152888 [2025-01-09 03:48:16,112 INFO L226 Difference]: Without dead ends: 90905 [2025-01-09 03:48:16,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:48:16,843 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 2415 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 4908 mSolverCounterSat, 795 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2516 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 5703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 795 IncrementalHoareTripleChecker+Valid, 4908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:16,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2516 Valid, 2328 Invalid, 5703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [795 Valid, 4908 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-09 03:48:16,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90905 states. [2025-01-09 03:48:20,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90905 to 82045. [2025-01-09 03:48:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82045 states, 63823 states have (on average 1.6129765131692337) internal successors, (102945), 66213 states have internal predecessors, (102945), 14250 states have call successors, (14250), 3732 states have call predecessors, (14250), 3971 states have return successors, (39780), 14226 states have call predecessors, (39780), 14184 states have call successors, (39780) [2025-01-09 03:48:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82045 states to 82045 states and 156975 transitions. [2025-01-09 03:48:21,346 INFO L78 Accepts]: Start accepts. Automaton has 82045 states and 156975 transitions. Word has length 190 [2025-01-09 03:48:21,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:21,347 INFO L471 AbstractCegarLoop]: Abstraction has 82045 states and 156975 transitions. [2025-01-09 03:48:21,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 7 states have internal predecessors, (140), 5 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 5 states have call successors, (22) [2025-01-09 03:48:21,347 INFO L276 IsEmpty]: Start isEmpty. Operand 82045 states and 156975 transitions. [2025-01-09 03:48:21,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-09 03:48:21,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:21,362 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:21,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:48:21,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 03:48:21,563 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:21,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:21,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1719446050, now seen corresponding path program 1 times [2025-01-09 03:48:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:21,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014825517] [2025-01-09 03:48:21,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:21,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:21,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 03:48:21,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 03:48:21,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:21,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-09 03:48:21,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:21,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014825517] [2025-01-09 03:48:21,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014825517] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:21,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100734486] [2025-01-09 03:48:21,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:21,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:21,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:21,817 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:48:21,823 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:48:21,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 03:48:22,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 03:48:22,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:22,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:22,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 2160 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:48:22,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:48:22,539 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:22,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100734486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:22,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:22,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2025-01-09 03:48:22,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196411417] [2025-01-09 03:48:22,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:22,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:22,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:22,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:22,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2025-01-09 03:48:22,540 INFO L87 Difference]: Start difference. First operand 82045 states and 156975 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 5 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26)