./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product17.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_spec2_product17.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 f4d752ef50871b3af82701ffcd8ca92c2975f63f8274731e1afbb137d2562986 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:44:18,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:44:19,092 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:44:19,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:44:19,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:44:19,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:44:19,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:44:19,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:44:19,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:44:19,146 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:44:19,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:44:19,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:44:19,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:44:19,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:44:19,147 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:44:19,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:44:19,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:44:19,147 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:44:19,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:44:19,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:44:19,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:44:19,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:44:19,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:44:19,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:44:19,147 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:44:19,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:44:19,147 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:44:19,147 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:44:19,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:44:19,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:44:19,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:44:19,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:44:19,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:44:19,148 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:44:19,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:44:19,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:44:19,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:44:19,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:44:19,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:44:19,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:44:19,148 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:44:19,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:44:19,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:44:19,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:44:19,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:44:19,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:44:19,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:44:19,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:44:19,149 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 -> f4d752ef50871b3af82701ffcd8ca92c2975f63f8274731e1afbb137d2562986 [2025-01-09 03:44:19,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:44:19,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:44:19,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:44:19,585 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:44:19,586 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:44:19,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product17.cil.c [2025-01-09 03:44:20,773 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8030993af/be8da51cdda14116acd358f27209fcd8/FLAGd30bc08fb [2025-01-09 03:44:21,236 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:44:21,236 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product17.cil.c [2025-01-09 03:44:21,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8030993af/be8da51cdda14116acd358f27209fcd8/FLAGd30bc08fb [2025-01-09 03:44:21,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8030993af/be8da51cdda14116acd358f27209fcd8 [2025-01-09 03:44:21,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:44:21,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:44:21,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:44:21,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:44:21,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:44:21,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:44:21" (1/1) ... [2025-01-09 03:44:21,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47818d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:21, skipping insertion in model container [2025-01-09 03:44:21,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:44:21" (1/1) ... [2025-01-09 03:44:21,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:44:21,616 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_spec2_product17.cil.c[17414,17427] [2025-01-09 03:44:21,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:44:21,788 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:44:21,799 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2025-01-09 03:44:21,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [716] [2025-01-09 03:44:21,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [725] [2025-01-09 03:44:21,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [846] [2025-01-09 03:44:21,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [884] [2025-01-09 03:44:21,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [983] [2025-01-09 03:44:21,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1337] [2025-01-09 03:44:21,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [2786] [2025-01-09 03:44:21,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2967] [2025-01-09 03:44:21,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3333] [2025-01-09 03:44:21,830 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_spec2_product17.cil.c[17414,17427] [2025-01-09 03:44:21,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:44:21,940 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:44:21,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:21 WrapperNode [2025-01-09 03:44:21,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:44:21,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:44:21,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:44:21,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:44:21,948 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:44:21" (1/1) ... [2025-01-09 03:44:21,971 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:44:21" (1/1) ... [2025-01-09 03:44:22,003 INFO L138 Inliner]: procedures = 90, calls = 332, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 798 [2025-01-09 03:44:22,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:44:22,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:44:22,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:44:22,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:44:22,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:21" (1/1) ... [2025-01-09 03:44:22,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:21" (1/1) ... [2025-01-09 03:44:22,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:21" (1/1) ... [2025-01-09 03:44:22,055 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-01-09 03:44:22,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:21" (1/1) ... [2025-01-09 03:44:22,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:21" (1/1) ... [2025-01-09 03:44:22,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:21" (1/1) ... [2025-01-09 03:44:22,076 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:21" (1/1) ... [2025-01-09 03:44:22,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:21" (1/1) ... [2025-01-09 03:44:22,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:21" (1/1) ... [2025-01-09 03:44:22,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:21" (1/1) ... [2025-01-09 03:44:22,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:44:22,095 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:44:22,095 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:44:22,095 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:44:22,096 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:21" (1/1) ... [2025-01-09 03:44:22,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:44:22,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:44:22,127 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:44:22,139 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:44:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:44:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-01-09 03:44:22,154 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-01-09 03:44:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-01-09 03:44:22,154 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-01-09 03:44:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:44:22,154 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:44:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:44:22,154 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:44:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:44:22,154 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:44:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:44:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:44:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:44:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:44:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-01-09 03:44:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-01-09 03:44:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:44:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:44:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:44:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:44:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:44:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:44:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:44:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:44:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:44:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:44:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:44:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:44:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:44:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:44:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:44:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:44:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:44:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:44:22,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:44:22,158 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:44:22,158 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:44:22,158 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:44:22,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:44:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:44:22,158 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:44:22,313 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:44:22,315 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:44:23,151 INFO L? ?]: Removed 427 outVars from TransFormulas that were not future-live. [2025-01-09 03:44:23,151 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:44:23,179 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:44:23,179 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:44:23,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:23 BoogieIcfgContainer [2025-01-09 03:44:23,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:44:23,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:44:23,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:44:23,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:44:23,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:44:21" (1/3) ... [2025-01-09 03:44:23,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c082711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:23, skipping insertion in model container [2025-01-09 03:44:23,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:21" (2/3) ... [2025-01-09 03:44:23,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c082711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:23, skipping insertion in model container [2025-01-09 03:44:23,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:23" (3/3) ... [2025-01-09 03:44:23,190 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product17.cil.c [2025-01-09 03:44:23,205 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:44:23,206 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product17.cil.c that has 22 procedures, 531 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:44:23,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:44:23,286 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;@57ca911f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:44:23,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:44:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 531 states, 420 states have (on average 1.7095238095238094) internal successors, (718), 441 states have internal predecessors, (718), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (88), 82 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 03:44:23,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 03:44:23,317 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:23,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:23,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:23,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:23,323 INFO L85 PathProgramCache]: Analyzing trace with hash 295006999, now seen corresponding path program 1 times [2025-01-09 03:44:23,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:23,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632407626] [2025-01-09 03:44:23,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:23,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 03:44:23,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 03:44:23,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:23,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:23,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:23,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632407626] [2025-01-09 03:44:23,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632407626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:23,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:23,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:23,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597282755] [2025-01-09 03:44:23,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:23,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:23,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:23,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:23,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:23,782 INFO L87 Difference]: Start difference. First operand has 531 states, 420 states have (on average 1.7095238095238094) internal successors, (718), 441 states have internal predecessors, (718), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (88), 82 states have call predecessors, (88), 88 states have call successors, (88) Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:23,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:23,923 INFO L93 Difference]: Finished difference Result 1042 states and 1763 transitions. [2025-01-09 03:44:23,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:23,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-01-09 03:44:23,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:23,939 INFO L225 Difference]: With dead ends: 1042 [2025-01-09 03:44:23,940 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 03:44:23,950 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:44:23,953 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 5 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2618 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:23,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2618 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:23,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 03:44:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-01-09 03:44:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 414 states have (on average 1.7077294685990339) internal successors, (707), 433 states have internal predecessors, (707), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:44:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 878 transitions. [2025-01-09 03:44:24,041 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 878 transitions. Word has length 74 [2025-01-09 03:44:24,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:24,042 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 878 transitions. [2025-01-09 03:44:24,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 878 transitions. [2025-01-09 03:44:24,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 03:44:24,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:24,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:24,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:44:24,050 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:24,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:24,050 INFO L85 PathProgramCache]: Analyzing trace with hash 232365992, now seen corresponding path program 1 times [2025-01-09 03:44:24,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:24,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528176212] [2025-01-09 03:44:24,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:24,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:24,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 03:44:24,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 03:44:24,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:24,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:24,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:24,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528176212] [2025-01-09 03:44:24,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528176212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:24,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:24,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:24,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588932067] [2025-01-09 03:44:24,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:24,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:24,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:24,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:24,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:24,260 INFO L87 Difference]: Start difference. First operand 523 states and 878 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:24,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:24,349 INFO L93 Difference]: Finished difference Result 1028 states and 1733 transitions. [2025-01-09 03:44:24,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:24,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2025-01-09 03:44:24,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:24,356 INFO L225 Difference]: With dead ends: 1028 [2025-01-09 03:44:24,357 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 03:44:24,359 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:44:24,361 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 4 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:24,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2597 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 03:44:24,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-01-09 03:44:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 414 states have (on average 1.7053140096618358) internal successors, (706), 433 states have internal predecessors, (706), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:44:24,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 877 transitions. [2025-01-09 03:44:24,397 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 877 transitions. Word has length 76 [2025-01-09 03:44:24,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:24,397 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 877 transitions. [2025-01-09 03:44:24,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 877 transitions. [2025-01-09 03:44:24,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 03:44:24,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:24,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:24,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:44:24,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:24,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:24,405 INFO L85 PathProgramCache]: Analyzing trace with hash -847942152, now seen corresponding path program 1 times [2025-01-09 03:44:24,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:24,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288711918] [2025-01-09 03:44:24,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:24,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:24,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 03:44:24,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 03:44:24,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:24,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:24,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:24,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288711918] [2025-01-09 03:44:24,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288711918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:24,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:24,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:24,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722690575] [2025-01-09 03:44:24,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:24,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:24,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:24,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:24,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:24,561 INFO L87 Difference]: Start difference. First operand 523 states and 877 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:24,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:24,625 INFO L93 Difference]: Finished difference Result 1028 states and 1732 transitions. [2025-01-09 03:44:24,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:24,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2025-01-09 03:44:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:24,633 INFO L225 Difference]: With dead ends: 1028 [2025-01-09 03:44:24,634 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 03:44:24,636 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:44:24,636 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 3 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2597 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:44:24,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2597 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 03:44:24,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-01-09 03:44:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 414 states have (on average 1.7028985507246377) internal successors, (705), 433 states have internal predecessors, (705), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:44:24,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 876 transitions. [2025-01-09 03:44:24,656 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 876 transitions. Word has length 77 [2025-01-09 03:44:24,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:24,656 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 876 transitions. [2025-01-09 03:44:24,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 876 transitions. [2025-01-09 03:44:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 03:44:24,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:24,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:24,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:44:24,658 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:24,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:24,659 INFO L85 PathProgramCache]: Analyzing trace with hash -812549460, now seen corresponding path program 1 times [2025-01-09 03:44:24,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:24,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388571081] [2025-01-09 03:44:24,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:24,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:24,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 03:44:24,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 03:44:24,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:24,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:24,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:24,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388571081] [2025-01-09 03:44:24,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388571081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:24,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:24,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:24,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112643957] [2025-01-09 03:44:24,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:24,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:24,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:24,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:24,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:24,782 INFO L87 Difference]: Start difference. First operand 523 states and 876 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:24,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:24,828 INFO L93 Difference]: Finished difference Result 1028 states and 1731 transitions. [2025-01-09 03:44:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:24,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2025-01-09 03:44:24,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:24,834 INFO L225 Difference]: With dead ends: 1028 [2025-01-09 03:44:24,835 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 03:44:24,837 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:44:24,839 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 2 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:24,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2597 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 03:44:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-01-09 03:44:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 414 states have (on average 1.7004830917874396) internal successors, (704), 433 states have internal predecessors, (704), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:44:24,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 875 transitions. [2025-01-09 03:44:24,871 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 875 transitions. Word has length 78 [2025-01-09 03:44:24,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:24,871 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 875 transitions. [2025-01-09 03:44:24,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 875 transitions. [2025-01-09 03:44:24,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 03:44:24,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:24,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:24,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:44:24,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:24,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:24,875 INFO L85 PathProgramCache]: Analyzing trace with hash -550169220, now seen corresponding path program 1 times [2025-01-09 03:44:24,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:24,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364842891] [2025-01-09 03:44:24,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:24,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:24,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 03:44:24,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 03:44:24,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:24,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:25,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:25,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:25,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364842891] [2025-01-09 03:44:25,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364842891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:25,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:25,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:25,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80147784] [2025-01-09 03:44:25,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:25,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:25,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:25,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:25,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:25,040 INFO L87 Difference]: Start difference. First operand 523 states and 875 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:25,079 INFO L93 Difference]: Finished difference Result 1028 states and 1730 transitions. [2025-01-09 03:44:25,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:25,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2025-01-09 03:44:25,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:25,083 INFO L225 Difference]: With dead ends: 1028 [2025-01-09 03:44:25,084 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 03:44:25,085 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:44:25,086 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 1 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:25,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2597 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:25,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 03:44:25,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-01-09 03:44:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 414 states have (on average 1.6980676328502415) internal successors, (703), 433 states have internal predecessors, (703), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:44:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 874 transitions. [2025-01-09 03:44:25,114 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 874 transitions. Word has length 79 [2025-01-09 03:44:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:25,115 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 874 transitions. [2025-01-09 03:44:25,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 874 transitions. [2025-01-09 03:44:25,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 03:44:25,117 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:25,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:25,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:44:25,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:25,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:25,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2049807887, now seen corresponding path program 1 times [2025-01-09 03:44:25,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:25,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158050322] [2025-01-09 03:44:25,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:25,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:25,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 03:44:25,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 03:44:25,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:25,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:25,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:25,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:25,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158050322] [2025-01-09 03:44:25,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158050322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:25,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:25,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:25,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077212003] [2025-01-09 03:44:25,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:25,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:25,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:25,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:25,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:25,247 INFO L87 Difference]: Start difference. First operand 523 states and 874 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:25,285 INFO L93 Difference]: Finished difference Result 1028 states and 1729 transitions. [2025-01-09 03:44:25,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:25,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2025-01-09 03:44:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:25,290 INFO L225 Difference]: With dead ends: 1028 [2025-01-09 03:44:25,290 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 03:44:25,292 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:44:25,293 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 0 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:25,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2597 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:25,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 03:44:25,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-01-09 03:44:25,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 414 states have (on average 1.6956521739130435) internal successors, (702), 433 states have internal predecessors, (702), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:44:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 873 transitions. [2025-01-09 03:44:25,312 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 873 transitions. Word has length 80 [2025-01-09 03:44:25,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:25,312 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 873 transitions. [2025-01-09 03:44:25,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 873 transitions. [2025-01-09 03:44:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 03:44:25,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:25,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:25,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:44:25,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:25,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:25,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1841109584, now seen corresponding path program 1 times [2025-01-09 03:44:25,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:25,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025120791] [2025-01-09 03:44:25,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:25,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:25,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 03:44:25,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 03:44:25,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:25,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:25,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:25,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025120791] [2025-01-09 03:44:25,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025120791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:25,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:25,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:25,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991329194] [2025-01-09 03:44:25,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:25,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:25,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:25,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:25,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:25,461 INFO L87 Difference]: Start difference. First operand 523 states and 873 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:44:25,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:25,597 INFO L93 Difference]: Finished difference Result 988 states and 1653 transitions. [2025-01-09 03:44:25,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:44:25,597 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2025-01-09 03:44:25,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:25,600 INFO L225 Difference]: With dead ends: 988 [2025-01-09 03:44:25,601 INFO L226 Difference]: Without dead ends: 517 [2025-01-09 03:44:25,602 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:44:25,603 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 91 mSDsluCounter, 4223 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5084 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:25,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5084 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:25,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-01-09 03:44:25,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-01-09 03:44:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 408 states have (on average 1.6887254901960784) internal successors, (689), 427 states have internal predecessors, (689), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:44:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 860 transitions. [2025-01-09 03:44:25,617 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 860 transitions. Word has length 80 [2025-01-09 03:44:25,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:25,617 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 860 transitions. [2025-01-09 03:44:25,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:44:25,618 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 860 transitions. [2025-01-09 03:44:25,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 03:44:25,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:25,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:25,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:44:25,620 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:25,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:25,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2066483890, now seen corresponding path program 1 times [2025-01-09 03:44:25,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:25,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178444833] [2025-01-09 03:44:25,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:25,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:25,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 03:44:25,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 03:44:25,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:25,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:25,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:25,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178444833] [2025-01-09 03:44:25,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178444833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:25,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:25,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:25,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99789527] [2025-01-09 03:44:25,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:25,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:25,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:25,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:25,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:25,755 INFO L87 Difference]: Start difference. First operand 517 states and 860 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:25,910 INFO L93 Difference]: Finished difference Result 991 states and 1654 transitions. [2025-01-09 03:44:25,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:25,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2025-01-09 03:44:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:25,914 INFO L225 Difference]: With dead ends: 991 [2025-01-09 03:44:25,914 INFO L226 Difference]: Without dead ends: 526 [2025-01-09 03:44:25,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:25,917 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 55 mSDsluCounter, 3239 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4056 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:25,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4056 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-01-09 03:44:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 517. [2025-01-09 03:44:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 408 states have (on average 1.678921568627451) internal successors, (685), 427 states have internal predecessors, (685), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:44:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 856 transitions. [2025-01-09 03:44:25,931 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 856 transitions. Word has length 81 [2025-01-09 03:44:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:25,931 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 856 transitions. [2025-01-09 03:44:25,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 856 transitions. [2025-01-09 03:44:25,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 03:44:25,933 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:25,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:25,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:44:25,933 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:25,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:25,934 INFO L85 PathProgramCache]: Analyzing trace with hash -33942995, now seen corresponding path program 1 times [2025-01-09 03:44:25,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:25,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63690246] [2025-01-09 03:44:25,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:25,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:25,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 03:44:25,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 03:44:25,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:25,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:26,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:26,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63690246] [2025-01-09 03:44:26,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63690246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:26,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:26,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:26,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996091235] [2025-01-09 03:44:26,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:26,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:26,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:26,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:26,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:26,029 INFO L87 Difference]: Start difference. First operand 517 states and 856 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:26,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:26,161 INFO L93 Difference]: Finished difference Result 991 states and 1650 transitions. [2025-01-09 03:44:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:26,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2025-01-09 03:44:26,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:26,166 INFO L225 Difference]: With dead ends: 991 [2025-01-09 03:44:26,166 INFO L226 Difference]: Without dead ends: 526 [2025-01-09 03:44:26,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:26,168 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 54 mSDsluCounter, 3239 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4056 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:26,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4056 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:26,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-01-09 03:44:26,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 517. [2025-01-09 03:44:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 408 states have (on average 1.6691176470588236) internal successors, (681), 427 states have internal predecessors, (681), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:44:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 852 transitions. [2025-01-09 03:44:26,185 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 852 transitions. Word has length 82 [2025-01-09 03:44:26,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:26,185 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 852 transitions. [2025-01-09 03:44:26,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 852 transitions. [2025-01-09 03:44:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 03:44:26,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:26,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:26,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:44:26,188 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:26,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:26,188 INFO L85 PathProgramCache]: Analyzing trace with hash -620980115, now seen corresponding path program 1 times [2025-01-09 03:44:26,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:26,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206714390] [2025-01-09 03:44:26,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:26,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:26,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 03:44:26,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 03:44:26,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:26,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:26,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:26,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206714390] [2025-01-09 03:44:26,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206714390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:26,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:26,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:26,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628248430] [2025-01-09 03:44:26,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:26,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:26,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:26,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:26,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:26,282 INFO L87 Difference]: Start difference. First operand 517 states and 852 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:26,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:26,399 INFO L93 Difference]: Finished difference Result 991 states and 1646 transitions. [2025-01-09 03:44:26,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:26,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2025-01-09 03:44:26,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:26,404 INFO L225 Difference]: With dead ends: 991 [2025-01-09 03:44:26,404 INFO L226 Difference]: Without dead ends: 526 [2025-01-09 03:44:26,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:26,407 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 53 mSDsluCounter, 3222 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4038 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:26,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4038 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:26,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-01-09 03:44:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 517. [2025-01-09 03:44:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 408 states have (on average 1.6593137254901962) internal successors, (677), 427 states have internal predecessors, (677), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:44:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 848 transitions. [2025-01-09 03:44:26,468 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 848 transitions. Word has length 83 [2025-01-09 03:44:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:26,468 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 848 transitions. [2025-01-09 03:44:26,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 848 transitions. [2025-01-09 03:44:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 03:44:26,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:26,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:26,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:44:26,471 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:26,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:26,472 INFO L85 PathProgramCache]: Analyzing trace with hash -892695571, now seen corresponding path program 1 times [2025-01-09 03:44:26,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:26,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265294682] [2025-01-09 03:44:26,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:26,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:26,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 03:44:26,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 03:44:26,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:26,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:26,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:26,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:26,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265294682] [2025-01-09 03:44:26,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265294682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:26,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:26,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:26,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718809841] [2025-01-09 03:44:26,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:26,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:26,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:26,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:26,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:26,572 INFO L87 Difference]: Start difference. First operand 517 states and 848 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:44:26,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:26,625 INFO L93 Difference]: Finished difference Result 982 states and 1628 transitions. [2025-01-09 03:44:26,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:44:26,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2025-01-09 03:44:26,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:26,628 INFO L225 Difference]: With dead ends: 982 [2025-01-09 03:44:26,629 INFO L226 Difference]: Without dead ends: 496 [2025-01-09 03:44:26,630 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:44:26,631 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 84 mSDsluCounter, 4112 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 4949 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:26,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 4949 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-09 03:44:26,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-01-09 03:44:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.6614987080103358) internal successors, (643), 406 states have internal predecessors, (643), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:44:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 814 transitions. [2025-01-09 03:44:26,644 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 814 transitions. Word has length 83 [2025-01-09 03:44:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:26,644 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 814 transitions. [2025-01-09 03:44:26,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:44:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 814 transitions. [2025-01-09 03:44:26,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 03:44:26,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:26,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:26,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:44:26,648 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:26,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1537574776, now seen corresponding path program 1 times [2025-01-09 03:44:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:26,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246840543] [2025-01-09 03:44:26,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:26,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:26,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 03:44:26,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 03:44:26,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:26,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:26,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:26,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:26,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246840543] [2025-01-09 03:44:26,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246840543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:26,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:26,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:26,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864898360] [2025-01-09 03:44:26,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:26,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:26,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:26,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:26,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:26,747 INFO L87 Difference]: Start difference. First operand 496 states and 814 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:26,802 INFO L93 Difference]: Finished difference Result 961 states and 1594 transitions. [2025-01-09 03:44:26,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:26,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2025-01-09 03:44:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:26,806 INFO L225 Difference]: With dead ends: 961 [2025-01-09 03:44:26,806 INFO L226 Difference]: Without dead ends: 496 [2025-01-09 03:44:26,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:26,809 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 17 mSDsluCounter, 3179 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3976 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:26,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3976 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:26,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-09 03:44:26,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-01-09 03:44:26,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.6589147286821706) internal successors, (642), 406 states have internal predecessors, (642), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:44:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 813 transitions. [2025-01-09 03:44:26,825 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 813 transitions. Word has length 84 [2025-01-09 03:44:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:26,825 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 813 transitions. [2025-01-09 03:44:26,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 813 transitions. [2025-01-09 03:44:26,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 03:44:26,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:26,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:26,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:44:26,828 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:26,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:26,828 INFO L85 PathProgramCache]: Analyzing trace with hash 214448680, now seen corresponding path program 1 times [2025-01-09 03:44:26,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:26,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488345192] [2025-01-09 03:44:26,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:26,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:26,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 03:44:26,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 03:44:26,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:26,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:26,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:26,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488345192] [2025-01-09 03:44:26,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488345192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:26,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:26,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:26,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532766540] [2025-01-09 03:44:26,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:26,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:26,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:26,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:26,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:26,945 INFO L87 Difference]: Start difference. First operand 496 states and 813 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:27,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:27,006 INFO L93 Difference]: Finished difference Result 961 states and 1593 transitions. [2025-01-09 03:44:27,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:27,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 85 [2025-01-09 03:44:27,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:27,011 INFO L225 Difference]: With dead ends: 961 [2025-01-09 03:44:27,011 INFO L226 Difference]: Without dead ends: 496 [2025-01-09 03:44:27,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:27,014 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 16 mSDsluCounter, 3179 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3976 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:27,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3976 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-09 03:44:27,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-01-09 03:44:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.6563307493540051) internal successors, (641), 406 states have internal predecessors, (641), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:44:27,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 812 transitions. [2025-01-09 03:44:27,032 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 812 transitions. Word has length 85 [2025-01-09 03:44:27,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:27,032 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 812 transitions. [2025-01-09 03:44:27,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:27,033 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 812 transitions. [2025-01-09 03:44:27,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 03:44:27,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:27,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:27,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:44:27,036 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:27,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1165037407, now seen corresponding path program 1 times [2025-01-09 03:44:27,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:27,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551592443] [2025-01-09 03:44:27,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:27,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:27,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 03:44:27,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 03:44:27,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:27,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:27,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:27,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551592443] [2025-01-09 03:44:27,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551592443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:27,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:27,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:27,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347794109] [2025-01-09 03:44:27,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:27,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:27,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:27,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:27,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:27,130 INFO L87 Difference]: Start difference. First operand 496 states and 812 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:27,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:27,160 INFO L93 Difference]: Finished difference Result 961 states and 1592 transitions. [2025-01-09 03:44:27,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:27,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2025-01-09 03:44:27,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:27,164 INFO L225 Difference]: With dead ends: 961 [2025-01-09 03:44:27,164 INFO L226 Difference]: Without dead ends: 496 [2025-01-09 03:44:27,166 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:44:27,167 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 9 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:27,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2409 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:27,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-09 03:44:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-01-09 03:44:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.6537467700258397) internal successors, (640), 406 states have internal predecessors, (640), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:44:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 811 transitions. [2025-01-09 03:44:27,187 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 811 transitions. Word has length 86 [2025-01-09 03:44:27,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:27,188 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 811 transitions. [2025-01-09 03:44:27,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:27,188 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 811 transitions. [2025-01-09 03:44:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 03:44:27,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:27,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:27,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:44:27,191 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:27,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:27,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1205712157, now seen corresponding path program 1 times [2025-01-09 03:44:27,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:27,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774014702] [2025-01-09 03:44:27,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:27,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:27,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 03:44:27,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 03:44:27,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:27,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:27,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:27,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774014702] [2025-01-09 03:44:27,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774014702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:27,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:27,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:27,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122922203] [2025-01-09 03:44:27,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:27,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:27,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:27,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:27,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:27,295 INFO L87 Difference]: Start difference. First operand 496 states and 811 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:27,333 INFO L93 Difference]: Finished difference Result 955 states and 1580 transitions. [2025-01-09 03:44:27,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:27,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2025-01-09 03:44:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:27,340 INFO L225 Difference]: With dead ends: 955 [2025-01-09 03:44:27,340 INFO L226 Difference]: Without dead ends: 496 [2025-01-09 03:44:27,344 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:44:27,345 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 4 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2388 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:27,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2388 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:27,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-09 03:44:27,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-01-09 03:44:27,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.6511627906976745) internal successors, (639), 406 states have internal predecessors, (639), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:44:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 810 transitions. [2025-01-09 03:44:27,367 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 810 transitions. Word has length 86 [2025-01-09 03:44:27,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:27,367 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 810 transitions. [2025-01-09 03:44:27,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 810 transitions. [2025-01-09 03:44:27,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 03:44:27,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:27,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:27,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:44:27,371 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:27,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:27,371 INFO L85 PathProgramCache]: Analyzing trace with hash 158899475, now seen corresponding path program 1 times [2025-01-09 03:44:27,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:27,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35725482] [2025-01-09 03:44:27,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:27,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:27,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 03:44:27,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 03:44:27,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:27,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:27,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:27,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:27,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35725482] [2025-01-09 03:44:27,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35725482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:27,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:27,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:44:27,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560589049] [2025-01-09 03:44:27,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:27,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:44:27,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:27,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:44:27,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:44:27,561 INFO L87 Difference]: Start difference. First operand 496 states and 810 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:44:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:28,890 INFO L93 Difference]: Finished difference Result 951 states and 1592 transitions. [2025-01-09 03:44:28,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:44:28,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2025-01-09 03:44:28,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:28,894 INFO L225 Difference]: With dead ends: 951 [2025-01-09 03:44:28,894 INFO L226 Difference]: Without dead ends: 500 [2025-01-09 03:44:28,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:44:28,896 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 1244 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 2484 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 2846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 2484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:28,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 1584 Invalid, 2846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 2484 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 03:44:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-01-09 03:44:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2025-01-09 03:44:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 390 states have (on average 1.646153846153846) internal successors, (642), 409 states have internal predecessors, (642), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (99), 82 states have call predecessors, (99), 83 states have call successors, (99) [2025-01-09 03:44:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 829 transitions. [2025-01-09 03:44:28,916 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 829 transitions. Word has length 87 [2025-01-09 03:44:28,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:28,916 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 829 transitions. [2025-01-09 03:44:28,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:44:28,916 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 829 transitions. [2025-01-09 03:44:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 03:44:28,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:28,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:28,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:44:28,918 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:28,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:28,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2130772416, now seen corresponding path program 1 times [2025-01-09 03:44:28,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:28,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176985326] [2025-01-09 03:44:28,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:28,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:28,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 03:44:28,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 03:44:28,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:28,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:29,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:29,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176985326] [2025-01-09 03:44:29,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176985326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:29,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:29,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:29,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519075753] [2025-01-09 03:44:29,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:29,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:29,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:29,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:29,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:29,039 INFO L87 Difference]: Start difference. First operand 500 states and 829 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:44:31,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:31,726 INFO L93 Difference]: Finished difference Result 1787 states and 3061 transitions. [2025-01-09 03:44:31,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 03:44:31,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 88 [2025-01-09 03:44:31,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:31,735 INFO L225 Difference]: With dead ends: 1787 [2025-01-09 03:44:31,735 INFO L226 Difference]: Without dead ends: 1332 [2025-01-09 03:44:31,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-01-09 03:44:31,739 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 2243 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 4513 mSolverCounterSat, 576 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2312 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 5089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 576 IncrementalHoareTripleChecker+Valid, 4513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:31,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2312 Valid, 2580 Invalid, 5089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [576 Valid, 4513 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 03:44:31,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2025-01-09 03:44:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1275. [2025-01-09 03:44:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 991 states have (on average 1.6609485368314834) internal successors, (1646), 1039 states have internal predecessors, (1646), 229 states have call successors, (229), 54 states have call predecessors, (229), 54 states have return successors, (244), 218 states have call predecessors, (244), 224 states have call successors, (244) [2025-01-09 03:44:31,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 2119 transitions. [2025-01-09 03:44:31,805 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 2119 transitions. Word has length 88 [2025-01-09 03:44:31,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:31,806 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 2119 transitions. [2025-01-09 03:44:31,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:44:31,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2119 transitions. [2025-01-09 03:44:31,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 03:44:31,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:31,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:31,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:44:31,808 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:31,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:31,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1348089831, now seen corresponding path program 1 times [2025-01-09 03:44:31,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:31,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354117688] [2025-01-09 03:44:31,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:31,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:31,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 03:44:31,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 03:44:31,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:31,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:31,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:31,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:31,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354117688] [2025-01-09 03:44:31,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354117688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:31,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:31,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:31,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101179714] [2025-01-09 03:44:31,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:31,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:31,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:31,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:31,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:31,952 INFO L87 Difference]: Start difference. First operand 1275 states and 2119 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:44:34,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:34,769 INFO L93 Difference]: Finished difference Result 5534 states and 9427 transitions. [2025-01-09 03:44:34,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:44:34,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2025-01-09 03:44:34,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:34,796 INFO L225 Difference]: With dead ends: 5534 [2025-01-09 03:44:34,797 INFO L226 Difference]: Without dead ends: 4304 [2025-01-09 03:44:34,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:44:34,806 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 2780 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 5082 mSolverCounterSat, 642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2887 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 5724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 5082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:34,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2887 Valid, 2308 Invalid, 5724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 5082 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 03:44:34,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4304 states. [2025-01-09 03:44:34,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4304 to 4020. [2025-01-09 03:44:35,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4020 states, 3028 states have (on average 1.665785997357992) internal successors, (5044), 3204 states have internal predecessors, (5044), 835 states have call successors, (835), 146 states have call predecessors, (835), 156 states have return successors, (975), 810 states have call predecessors, (975), 830 states have call successors, (975) [2025-01-09 03:44:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 6854 transitions. [2025-01-09 03:44:35,024 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 6854 transitions. Word has length 90 [2025-01-09 03:44:35,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:35,025 INFO L471 AbstractCegarLoop]: Abstraction has 4020 states and 6854 transitions. [2025-01-09 03:44:35,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:44:35,025 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 6854 transitions. [2025-01-09 03:44:35,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 03:44:35,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:35,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:35,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:44:35,027 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:35,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:35,028 INFO L85 PathProgramCache]: Analyzing trace with hash 318730533, now seen corresponding path program 1 times [2025-01-09 03:44:35,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:35,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245575466] [2025-01-09 03:44:35,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:35,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:35,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 03:44:35,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 03:44:35,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:35,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:35,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:35,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245575466] [2025-01-09 03:44:35,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245575466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:35,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:35,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:35,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612082772] [2025-01-09 03:44:35,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:35,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:35,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:35,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:35,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:35,198 INFO L87 Difference]: Start difference. First operand 4020 states and 6854 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:44:37,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:37,745 INFO L93 Difference]: Finished difference Result 10991 states and 18906 transitions. [2025-01-09 03:44:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 03:44:37,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2025-01-09 03:44:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:37,797 INFO L225 Difference]: With dead ends: 10991 [2025-01-09 03:44:37,797 INFO L226 Difference]: Without dead ends: 8055 [2025-01-09 03:44:37,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-01-09 03:44:37,815 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 2293 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 3459 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2372 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 3942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 3459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:37,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2372 Valid, 1700 Invalid, 3942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 3459 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 03:44:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8055 states. [2025-01-09 03:44:38,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8055 to 7546. [2025-01-09 03:44:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7546 states, 5713 states have (on average 1.6640994223700332) internal successors, (9507), 6043 states have internal predecessors, (9507), 1515 states have call successors, (1515), 269 states have call predecessors, (1515), 317 states have return successors, (1898), 1469 states have call predecessors, (1898), 1510 states have call successors, (1898) [2025-01-09 03:44:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7546 states to 7546 states and 12920 transitions. [2025-01-09 03:44:38,189 INFO L78 Accepts]: Start accepts. Automaton has 7546 states and 12920 transitions. Word has length 90 [2025-01-09 03:44:38,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:38,189 INFO L471 AbstractCegarLoop]: Abstraction has 7546 states and 12920 transitions. [2025-01-09 03:44:38,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:44:38,190 INFO L276 IsEmpty]: Start isEmpty. Operand 7546 states and 12920 transitions. [2025-01-09 03:44:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 03:44:38,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:38,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:38,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:44:38,192 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:38,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:38,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1140122476, now seen corresponding path program 1 times [2025-01-09 03:44:38,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:38,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681943598] [2025-01-09 03:44:38,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:38,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:38,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 03:44:38,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 03:44:38,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:38,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:38,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:38,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681943598] [2025-01-09 03:44:38,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681943598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:38,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:38,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:44:38,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773938645] [2025-01-09 03:44:38,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:38,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:44:38,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:38,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:44:38,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:44:38,305 INFO L87 Difference]: Start difference. First operand 7546 states and 12920 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:44:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:38,668 INFO L93 Difference]: Finished difference Result 13930 states and 23924 transitions. [2025-01-09 03:44:38,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:44:38,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2025-01-09 03:44:38,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:38,735 INFO L225 Difference]: With dead ends: 13930 [2025-01-09 03:44:38,735 INFO L226 Difference]: Without dead ends: 7633 [2025-01-09 03:44:38,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:44:38,763 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 0 mSDsluCounter, 2394 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3202 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:38,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3202 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:38,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7633 states. [2025-01-09 03:44:39,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7633 to 7619. [2025-01-09 03:44:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7619 states, 5769 states have (on average 1.657132951984746) internal successors, (9560), 6098 states have internal predecessors, (9560), 1512 states have call successors, (1512), 269 states have call predecessors, (1512), 337 states have return successors, (1961), 1487 states have call predecessors, (1961), 1507 states have call successors, (1961) [2025-01-09 03:44:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7619 states to 7619 states and 13033 transitions. [2025-01-09 03:44:39,107 INFO L78 Accepts]: Start accepts. Automaton has 7619 states and 13033 transitions. Word has length 95 [2025-01-09 03:44:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:39,107 INFO L471 AbstractCegarLoop]: Abstraction has 7619 states and 13033 transitions. [2025-01-09 03:44:39,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:44:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 7619 states and 13033 transitions. [2025-01-09 03:44:39,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:44:39,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:39,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:39,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:44:39,111 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:39,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:39,111 INFO L85 PathProgramCache]: Analyzing trace with hash -554933983, now seen corresponding path program 1 times [2025-01-09 03:44:39,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:39,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790489415] [2025-01-09 03:44:39,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:39,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:39,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:44:39,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:44:39,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:39,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:39,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:39,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790489415] [2025-01-09 03:44:39,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790489415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:39,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:39,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:44:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740450342] [2025-01-09 03:44:39,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:39,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:44:39,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:39,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:44:39,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:44:39,261 INFO L87 Difference]: Start difference. First operand 7619 states and 13033 transitions. Second operand has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:44:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:39,824 INFO L93 Difference]: Finished difference Result 15156 states and 26397 transitions. [2025-01-09 03:44:39,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:44:39,825 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 102 [2025-01-09 03:44:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:39,870 INFO L225 Difference]: With dead ends: 15156 [2025-01-09 03:44:39,870 INFO L226 Difference]: Without dead ends: 7767 [2025-01-09 03:44:39,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:44:39,901 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 235 mSDsluCounter, 5676 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 6529 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:39,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 6529 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:44:39,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7767 states. [2025-01-09 03:44:40,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7767 to 7643. [2025-01-09 03:44:40,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7643 states, 5790 states have (on average 1.6340241796200345) internal successors, (9461), 6122 states have internal predecessors, (9461), 1512 states have call successors, (1512), 269 states have call predecessors, (1512), 340 states have return successors, (1973), 1487 states have call predecessors, (1973), 1507 states have call successors, (1973) [2025-01-09 03:44:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7643 states to 7643 states and 12946 transitions. [2025-01-09 03:44:40,327 INFO L78 Accepts]: Start accepts. Automaton has 7643 states and 12946 transitions. Word has length 102 [2025-01-09 03:44:40,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:40,328 INFO L471 AbstractCegarLoop]: Abstraction has 7643 states and 12946 transitions. [2025-01-09 03:44:40,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:44:40,328 INFO L276 IsEmpty]: Start isEmpty. Operand 7643 states and 12946 transitions. [2025-01-09 03:44:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:44:40,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:40,330 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:44:40,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:44:40,330 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:40,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:40,331 INFO L85 PathProgramCache]: Analyzing trace with hash 780438137, now seen corresponding path program 1 times [2025-01-09 03:44:40,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:40,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667936311] [2025-01-09 03:44:40,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:40,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:40,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:44:40,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:44:40,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:40,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:44:40,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:40,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667936311] [2025-01-09 03:44:40,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667936311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:40,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:40,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:40,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132414575] [2025-01-09 03:44:40,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:40,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:40,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:40,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:40,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:40,452 INFO L87 Difference]: Start difference. First operand 7643 states and 12946 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:44:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:42,366 INFO L93 Difference]: Finished difference Result 14761 states and 25064 transitions. [2025-01-09 03:44:42,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:44:42,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 107 [2025-01-09 03:44:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:42,410 INFO L225 Difference]: With dead ends: 14761 [2025-01-09 03:44:42,411 INFO L226 Difference]: Without dead ends: 8383 [2025-01-09 03:44:42,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-01-09 03:44:42,435 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 2015 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 2962 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2091 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 3418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 2962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:42,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2091 Valid, 1638 Invalid, 3418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 2962 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 03:44:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8383 states. [2025-01-09 03:44:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8383 to 7878. [2025-01-09 03:44:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7878 states, 5965 states have (on average 1.6227996647108132) internal successors, (9680), 6315 states have internal predecessors, (9680), 1532 states have call successors, (1532), 294 states have call predecessors, (1532), 380 states have return successors, (2065), 1505 states have call predecessors, (2065), 1527 states have call successors, (2065) [2025-01-09 03:44:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7878 states to 7878 states and 13277 transitions. [2025-01-09 03:44:42,826 INFO L78 Accepts]: Start accepts. Automaton has 7878 states and 13277 transitions. Word has length 107 [2025-01-09 03:44:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:42,826 INFO L471 AbstractCegarLoop]: Abstraction has 7878 states and 13277 transitions. [2025-01-09 03:44:42,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:44:42,827 INFO L276 IsEmpty]: Start isEmpty. Operand 7878 states and 13277 transitions. [2025-01-09 03:44:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:44:42,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:42,829 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] [2025-01-09 03:44:42,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:44:42,829 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:42,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:42,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1716642842, now seen corresponding path program 1 times [2025-01-09 03:44:42,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:42,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669101737] [2025-01-09 03:44:42,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:42,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:42,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:44:42,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:44:42,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:42,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:42,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:44:42,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:42,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669101737] [2025-01-09 03:44:42,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669101737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:42,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:42,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:44:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033429043] [2025-01-09 03:44:42,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:42,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:44:42,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:42,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:44:42,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:44:42,953 INFO L87 Difference]: Start difference. First operand 7878 states and 13277 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:44:43,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:43,318 INFO L93 Difference]: Finished difference Result 17816 states and 30189 transitions. [2025-01-09 03:44:43,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:44:43,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-01-09 03:44:43,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:43,384 INFO L225 Difference]: With dead ends: 17816 [2025-01-09 03:44:43,384 INFO L226 Difference]: Without dead ends: 11203 [2025-01-09 03:44:43,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:44:43,412 INFO L435 NwaCegarLoop]: 1299 mSDtfsCounter, 759 mSDsluCounter, 7223 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 8522 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:43,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 8522 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:43,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11203 states. [2025-01-09 03:44:43,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11203 to 10529. [2025-01-09 03:44:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10529 states, 7981 states have (on average 1.6330033830347075) internal successors, (13033), 8434 states have internal predecessors, (13033), 2065 states have call successors, (2065), 381 states have call predecessors, (2065), 482 states have return successors, (2718), 2045 states have call predecessors, (2718), 2060 states have call successors, (2718) [2025-01-09 03:44:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10529 states to 10529 states and 17816 transitions. [2025-01-09 03:44:43,903 INFO L78 Accepts]: Start accepts. Automaton has 10529 states and 17816 transitions. Word has length 112 [2025-01-09 03:44:43,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:43,903 INFO L471 AbstractCegarLoop]: Abstraction has 10529 states and 17816 transitions. [2025-01-09 03:44:43,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:44:43,903 INFO L276 IsEmpty]: Start isEmpty. Operand 10529 states and 17816 transitions. [2025-01-09 03:44:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:44:43,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:43,906 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] [2025-01-09 03:44:43,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:44:43,906 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:43,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:43,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1497788124, now seen corresponding path program 1 times [2025-01-09 03:44:43,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:43,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471391996] [2025-01-09 03:44:43,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:43,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:43,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:44:43,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:44:43,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:43,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:44:44,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:44,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471391996] [2025-01-09 03:44:44,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471391996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:44,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:44,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:44,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125049136] [2025-01-09 03:44:44,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:44,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:44,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:44,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:44,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:44,023 INFO L87 Difference]: Start difference. First operand 10529 states and 17816 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:44:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:44,646 INFO L93 Difference]: Finished difference Result 10657 states and 18041 transitions. [2025-01-09 03:44:44,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:44:44,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-01-09 03:44:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:44,706 INFO L225 Difference]: With dead ends: 10657 [2025-01-09 03:44:44,706 INFO L226 Difference]: Without dead ends: 10642 [2025-01-09 03:44:44,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:44:44,714 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 870 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:44,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 2243 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:44:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10642 states. [2025-01-09 03:44:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10642 to 10537. [2025-01-09 03:44:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10537 states, 7989 states have (on average 1.6323695080736011) internal successors, (13041), 8442 states have internal predecessors, (13041), 2065 states have call successors, (2065), 381 states have call predecessors, (2065), 482 states have return successors, (2718), 2045 states have call predecessors, (2718), 2060 states have call successors, (2718) [2025-01-09 03:44:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10537 states to 10537 states and 17824 transitions. [2025-01-09 03:44:45,333 INFO L78 Accepts]: Start accepts. Automaton has 10537 states and 17824 transitions. Word has length 112 [2025-01-09 03:44:45,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:45,333 INFO L471 AbstractCegarLoop]: Abstraction has 10537 states and 17824 transitions. [2025-01-09 03:44:45,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:44:45,334 INFO L276 IsEmpty]: Start isEmpty. Operand 10537 states and 17824 transitions. [2025-01-09 03:44:45,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:44:45,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:45,336 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] [2025-01-09 03:44:45,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 03:44:45,336 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:45,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:45,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1641761665, now seen corresponding path program 1 times [2025-01-09 03:44:45,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:45,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724581016] [2025-01-09 03:44:45,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:45,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:45,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:44:45,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:44:45,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:45,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:45,540 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:44:45,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:45,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724581016] [2025-01-09 03:44:45,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724581016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:45,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:45,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 03:44:45,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586124235] [2025-01-09 03:44:45,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:45,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:44:45,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:45,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:44:45,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:44:45,542 INFO L87 Difference]: Start difference. First operand 10537 states and 17824 transitions. Second operand has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:44:46,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:46,036 INFO L93 Difference]: Finished difference Result 10552 states and 17842 transitions. [2025-01-09 03:44:46,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:44:46,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-01-09 03:44:46,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:46,108 INFO L225 Difference]: With dead ends: 10552 [2025-01-09 03:44:46,108 INFO L226 Difference]: Without dead ends: 10537 [2025-01-09 03:44:46,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:44:46,118 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 17 mSDsluCounter, 6294 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 7085 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:46,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 7085 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10537 states. [2025-01-09 03:44:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10537 to 10537. [2025-01-09 03:44:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10537 states, 7989 states have (on average 1.631368131180373) internal successors, (13033), 8442 states have internal predecessors, (13033), 2065 states have call successors, (2065), 381 states have call predecessors, (2065), 482 states have return successors, (2718), 2045 states have call predecessors, (2718), 2060 states have call successors, (2718) [2025-01-09 03:44:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10537 states to 10537 states and 17816 transitions. [2025-01-09 03:44:46,635 INFO L78 Accepts]: Start accepts. Automaton has 10537 states and 17816 transitions. Word has length 118 [2025-01-09 03:44:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:46,636 INFO L471 AbstractCegarLoop]: Abstraction has 10537 states and 17816 transitions. [2025-01-09 03:44:46,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:44:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 10537 states and 17816 transitions. [2025-01-09 03:44:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:44:46,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:46,638 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:46,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 03:44:46,638 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:46,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:46,639 INFO L85 PathProgramCache]: Analyzing trace with hash -75090784, now seen corresponding path program 1 times [2025-01-09 03:44:46,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:46,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495460832] [2025-01-09 03:44:46,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:46,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:46,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:44:46,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:44:46,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:46,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 03:44:46,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:46,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495460832] [2025-01-09 03:44:46,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495460832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:46,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:46,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 03:44:46,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021894697] [2025-01-09 03:44:46,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:46,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 03:44:46,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:46,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 03:44:46,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:44:46,862 INFO L87 Difference]: Start difference. First operand 10537 states and 17816 transitions. Second operand has 13 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 7 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 03:44:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:50,688 INFO L93 Difference]: Finished difference Result 22913 states and 38492 transitions. [2025-01-09 03:44:50,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 03:44:50,692 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 7 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 131 [2025-01-09 03:44:50,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:50,757 INFO L225 Difference]: With dead ends: 22913 [2025-01-09 03:44:50,757 INFO L226 Difference]: Without dead ends: 13464 [2025-01-09 03:44:50,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2025-01-09 03:44:50,787 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 2018 mSDsluCounter, 4573 mSDsCounter, 0 mSdLazyCounter, 8960 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2103 SdHoareTripleChecker+Valid, 5083 SdHoareTripleChecker+Invalid, 9383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 8960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:50,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2103 Valid, 5083 Invalid, 9383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 8960 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 03:44:50,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13464 states. [2025-01-09 03:44:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13464 to 12274. [2025-01-09 03:44:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12274 states, 9361 states have (on average 1.6117936117936118) internal successors, (15088), 9879 states have internal predecessors, (15088), 2293 states have call successors, (2293), 470 states have call predecessors, (2293), 619 states have return successors, (3054), 2249 states have call predecessors, (3054), 2288 states have call successors, (3054) [2025-01-09 03:44:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12274 states to 12274 states and 20435 transitions. [2025-01-09 03:44:51,190 INFO L78 Accepts]: Start accepts. Automaton has 12274 states and 20435 transitions. Word has length 131 [2025-01-09 03:44:51,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:51,190 INFO L471 AbstractCegarLoop]: Abstraction has 12274 states and 20435 transitions. [2025-01-09 03:44:51,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 7 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 03:44:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 12274 states and 20435 transitions. [2025-01-09 03:44:51,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:44:51,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:51,192 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:51,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 03:44:51,192 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:51,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:51,193 INFO L85 PathProgramCache]: Analyzing trace with hash 25821183, now seen corresponding path program 1 times [2025-01-09 03:44:51,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:51,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762900327] [2025-01-09 03:44:51,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:51,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:51,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:44:51,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:44:51,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:51,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 03:44:51,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:51,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762900327] [2025-01-09 03:44:51,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762900327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:51,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:51,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:44:51,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650173118] [2025-01-09 03:44:51,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:51,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:44:51,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:51,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:44:51,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:44:51,345 INFO L87 Difference]: Start difference. First operand 12274 states and 20435 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:44:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:53,049 INFO L93 Difference]: Finished difference Result 24557 states and 41046 transitions. [2025-01-09 03:44:53,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:44:53,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 131 [2025-01-09 03:44:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:53,208 INFO L225 Difference]: With dead ends: 24557 [2025-01-09 03:44:53,208 INFO L226 Difference]: Without dead ends: 12340 [2025-01-09 03:44:53,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:44:53,282 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 1188 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:53,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 1575 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 03:44:53,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12340 states. [2025-01-09 03:44:53,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12340 to 12274. [2025-01-09 03:44:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12274 states, 9361 states have (on average 1.61093900224335) internal successors, (15080), 9879 states have internal predecessors, (15080), 2293 states have call successors, (2293), 470 states have call predecessors, (2293), 619 states have return successors, (3054), 2249 states have call predecessors, (3054), 2288 states have call successors, (3054) [2025-01-09 03:44:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12274 states to 12274 states and 20427 transitions. [2025-01-09 03:44:53,764 INFO L78 Accepts]: Start accepts. Automaton has 12274 states and 20427 transitions. Word has length 131 [2025-01-09 03:44:53,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:53,765 INFO L471 AbstractCegarLoop]: Abstraction has 12274 states and 20427 transitions. [2025-01-09 03:44:53,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:44:53,766 INFO L276 IsEmpty]: Start isEmpty. Operand 12274 states and 20427 transitions. [2025-01-09 03:44:53,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 03:44:53,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:53,769 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:53,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 03:44:53,770 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:53,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:53,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1555316437, now seen corresponding path program 1 times [2025-01-09 03:44:53,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:53,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544442094] [2025-01-09 03:44:53,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:53,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:53,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 03:44:53,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 03:44:53,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:53,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:53,876 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:44:53,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:53,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544442094] [2025-01-09 03:44:53,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544442094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:53,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:53,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:53,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632551052] [2025-01-09 03:44:53,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:53,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:53,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:53,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:53,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:53,880 INFO L87 Difference]: Start difference. First operand 12274 states and 20427 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:44:56,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:56,542 INFO L93 Difference]: Finished difference Result 40313 states and 69069 transitions. [2025-01-09 03:44:56,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:44:56,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 138 [2025-01-09 03:44:56,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:56,753 INFO L225 Difference]: With dead ends: 40313 [2025-01-09 03:44:56,753 INFO L226 Difference]: Without dead ends: 28084 [2025-01-09 03:44:56,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:44:56,813 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 1785 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1857 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:56,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1857 Valid, 911 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 03:44:56,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28084 states. [2025-01-09 03:44:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28084 to 27186. [2025-01-09 03:44:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27186 states, 20249 states have (on average 1.6046224504913822) internal successors, (32492), 21506 states have internal predecessors, (32492), 5636 states have call successors, (5636), 935 states have call predecessors, (5636), 1300 states have return successors, (8652), 5569 states have call predecessors, (8652), 5631 states have call successors, (8652) [2025-01-09 03:44:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27186 states to 27186 states and 46780 transitions. [2025-01-09 03:44:58,109 INFO L78 Accepts]: Start accepts. Automaton has 27186 states and 46780 transitions. Word has length 138 [2025-01-09 03:44:58,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:58,110 INFO L471 AbstractCegarLoop]: Abstraction has 27186 states and 46780 transitions. [2025-01-09 03:44:58,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:44:58,110 INFO L276 IsEmpty]: Start isEmpty. Operand 27186 states and 46780 transitions. [2025-01-09 03:44:58,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 03:44:58,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:58,114 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:58,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 03:44:58,114 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:58,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:58,114 INFO L85 PathProgramCache]: Analyzing trace with hash 970045673, now seen corresponding path program 1 times [2025-01-09 03:44:58,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:58,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123593322] [2025-01-09 03:44:58,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:58,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:58,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 03:44:58,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 03:44:58,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:58,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:58,200 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:44:58,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:58,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123593322] [2025-01-09 03:44:58,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123593322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:58,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:58,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:58,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787355379] [2025-01-09 03:44:58,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:58,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:58,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:58,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:58,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:58,203 INFO L87 Difference]: Start difference. First operand 27186 states and 46780 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:45:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:02,242 INFO L93 Difference]: Finished difference Result 90984 states and 163170 transitions. [2025-01-09 03:45:02,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:45:02,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 139 [2025-01-09 03:45:02,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:02,655 INFO L225 Difference]: With dead ends: 90984 [2025-01-09 03:45:02,655 INFO L226 Difference]: Without dead ends: 63843 [2025-01-09 03:45:02,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:45:02,785 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1789 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1860 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:02,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1860 Valid, 884 Invalid, 1524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 03:45:02,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63843 states. [2025-01-09 03:45:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63843 to 61863. [2025-01-09 03:45:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61863 states, 44862 states have (on average 1.596451339663858) internal successors, (71620), 47961 states have internal predecessors, (71620), 14257 states have call successors, (14257), 1865 states have call predecessors, (14257), 2743 states have return successors, (25696), 14176 states have call predecessors, (25696), 14252 states have call successors, (25696) [2025-01-09 03:45:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61863 states to 61863 states and 111573 transitions. [2025-01-09 03:45:07,531 INFO L78 Accepts]: Start accepts. Automaton has 61863 states and 111573 transitions. Word has length 139 [2025-01-09 03:45:07,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:07,532 INFO L471 AbstractCegarLoop]: Abstraction has 61863 states and 111573 transitions. [2025-01-09 03:45:07,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:45:07,532 INFO L276 IsEmpty]: Start isEmpty. Operand 61863 states and 111573 transitions. [2025-01-09 03:45:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 03:45:07,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:07,537 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:07,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 03:45:07,537 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:07,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:07,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1752036577, now seen corresponding path program 1 times [2025-01-09 03:45:07,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:07,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567145109] [2025-01-09 03:45:07,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:07,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:07,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 03:45:07,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 03:45:07,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:07,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:07,763 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:45:07,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:07,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567145109] [2025-01-09 03:45:07,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567145109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:07,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:07,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:07,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614238591] [2025-01-09 03:45:07,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:07,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:07,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:07,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:07,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:07,765 INFO L87 Difference]: Start difference. First operand 61863 states and 111573 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)