./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product01.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product01.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8190dbbeca15ebdc96e247bb91a06680a00a60089c25180495df59d4a11849af --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:43:58,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:43:58,316 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:43:58,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:43:58,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:43:58,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:43:58,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:43:58,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:43:58,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:43:58,346 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:43:58,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:43:58,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:43:58,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:43:58,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:43:58,347 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:43:58,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:43:58,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:43:58,348 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:43:58,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:43:58,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:43:58,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:43:58,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:43:58,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:43:58,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:43:58,348 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:43:58,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:43:58,348 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:43:58,349 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:43:58,349 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:43:58,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:43:58,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:43:58,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:43:58,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:43:58,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:43:58,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:43:58,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:43:58,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:43:58,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:43:58,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:43:58,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:43:58,350 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:43:58,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:43:58,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:43:58,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:43:58,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:43:58,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:43:58,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:43:58,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:43:58,350 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 -> 8190dbbeca15ebdc96e247bb91a06680a00a60089c25180495df59d4a11849af [2025-01-09 03:43:58,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:43:58,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:43:58,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:43:58,567 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:43:58,567 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:43:58,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product01.cil.c [2025-01-09 03:43:59,735 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b3617b34/149844c547fb44b2bdf51bd52dc97a89/FLAGa29b5eee9 [2025-01-09 03:44:00,102 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:44:00,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product01.cil.c [2025-01-09 03:44:00,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b3617b34/149844c547fb44b2bdf51bd52dc97a89/FLAGa29b5eee9 [2025-01-09 03:44:00,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b3617b34/149844c547fb44b2bdf51bd52dc97a89 [2025-01-09 03:44:00,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:44:00,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:44:00,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:44:00,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:44:00,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:44:00,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:44:00" (1/1) ... [2025-01-09 03:44:00,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb75994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:00, skipping insertion in model container [2025-01-09 03:44:00,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:44:00" (1/1) ... [2025-01-09 03:44:00,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:44:00,310 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_product01.cil.c[1545,1558] [2025-01-09 03:44:00,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:44:00,626 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:44:00,632 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-01-09 03:44:00,633 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [57] [2025-01-09 03:44:00,633 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [178] [2025-01-09 03:44:00,633 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [192] [2025-01-09 03:44:00,633 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [375] [2025-01-09 03:44:00,633 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [741] [2025-01-09 03:44:00,633 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1101] [2025-01-09 03:44:00,633 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2529] [2025-01-09 03:44:00,634 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2620] [2025-01-09 03:44:00,634 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2655] [2025-01-09 03:44:00,636 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_product01.cil.c[1545,1558] [2025-01-09 03:44:00,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:44:00,747 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:44:00,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:00 WrapperNode [2025-01-09 03:44:00,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:44:00,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:44:00,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:44:00,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:44:00,756 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:00" (1/1) ... [2025-01-09 03:44:00,779 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:00" (1/1) ... [2025-01-09 03:44:00,820 INFO L138 Inliner]: procedures = 88, calls = 328, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 750 [2025-01-09 03:44:00,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:44:00,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:44:00,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:44:00,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:44:00,829 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:00" (1/1) ... [2025-01-09 03:44:00,829 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:00" (1/1) ... [2025-01-09 03:44:00,835 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:00" (1/1) ... [2025-01-09 03:44:00,862 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-01-09 03:44:00,862 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:00" (1/1) ... [2025-01-09 03:44:00,862 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:00" (1/1) ... [2025-01-09 03:44:00,874 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:00" (1/1) ... [2025-01-09 03:44:00,876 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:00" (1/1) ... [2025-01-09 03:44:00,883 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:00" (1/1) ... [2025-01-09 03:44:00,887 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:00" (1/1) ... [2025-01-09 03:44:00,893 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:00" (1/1) ... [2025-01-09 03:44:00,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:44:00,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:44:00,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:44:00,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:44:00,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:00" (1/1) ... [2025-01-09 03:44:00,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:44:00,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:44:00,962 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:00,967 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:00,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:44:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-01-09 03:44:00,985 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-01-09 03:44:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:44:00,985 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:44:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:44:00,985 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:44:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:44:00,985 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:44:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:44:00,985 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:44:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:44:00,986 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:44:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-01-09 03:44:00,987 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-01-09 03:44:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:44:00,987 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:44:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:44:00,987 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:44:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:44:00,988 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:44:00,988 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:44:00,988 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:44:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:44:00,989 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:44:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:44:00,989 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:44:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:44:00,989 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:44:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:44:00,989 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:44:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:44:00,989 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:44:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:44:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:44:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:44:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:44:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:44:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:44:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:44:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:44:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:44:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:44:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:44:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:44:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:44:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:44:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:44:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:44:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:44:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:44:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:44:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:44:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:44:00,992 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:44:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:44:00,992 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:44:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:44:00,992 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:44:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:44:00,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:44:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:44:00,992 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:44:01,129 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:44:01,132 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:44:01,999 INFO L? ?]: Removed 409 outVars from TransFormulas that were not future-live. [2025-01-09 03:44:02,000 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:44:02,023 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:44:02,024 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:44:02,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:02 BoogieIcfgContainer [2025-01-09 03:44:02,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:44:02,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:44:02,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:44:02,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:44:02,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:44:00" (1/3) ... [2025-01-09 03:44:02,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a38e32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:02, skipping insertion in model container [2025-01-09 03:44:02,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:00" (2/3) ... [2025-01-09 03:44:02,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a38e32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:02, skipping insertion in model container [2025-01-09 03:44:02,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:02" (3/3) ... [2025-01-09 03:44:02,034 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product01.cil.c [2025-01-09 03:44:02,043 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:44:02,046 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product01.cil.c that has 21 procedures, 516 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:44:02,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:44:02,104 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;@784ba1cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:44:02,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:44:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 516 states, 408 states have (on average 1.7156862745098038) internal successors, (700), 429 states have internal predecessors, (700), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (86), 80 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 03:44:02,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 03:44:02,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:02,122 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:02,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:02,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:02,130 INFO L85 PathProgramCache]: Analyzing trace with hash 933424840, now seen corresponding path program 1 times [2025-01-09 03:44:02,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:02,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522159300] [2025-01-09 03:44:02,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:02,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:02,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 03:44:02,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 03:44:02,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:02,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:02,550 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:02,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:02,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522159300] [2025-01-09 03:44:02,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522159300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:02,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:02,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:02,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720028116] [2025-01-09 03:44:02,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:02,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:02,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:02,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:02,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:02,574 INFO L87 Difference]: Start difference. First operand has 516 states, 408 states have (on average 1.7156862745098038) internal successors, (700), 429 states have internal predecessors, (700), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (86), 80 states have call predecessors, (86), 86 states have call successors, (86) 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:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:02,703 INFO L93 Difference]: Finished difference Result 1012 states and 1719 transitions. [2025-01-09 03:44:02,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:02,705 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:02,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:02,715 INFO L225 Difference]: With dead ends: 1012 [2025-01-09 03:44:02,715 INFO L226 Difference]: Without dead ends: 508 [2025-01-09 03:44:02,721 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:02,723 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 5 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2552 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:02,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2552 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:02,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-01-09 03:44:02,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-01-09 03:44:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 402 states have (on average 1.7139303482587065) internal successors, (689), 421 states have internal predecessors, (689), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 856 transitions. [2025-01-09 03:44:02,786 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 856 transitions. Word has length 74 [2025-01-09 03:44:02,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:02,787 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 856 transitions. [2025-01-09 03:44:02,788 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:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 856 transitions. [2025-01-09 03:44:02,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 03:44:02,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:02,796 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:02,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:44:02,797 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:02,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:02,797 INFO L85 PathProgramCache]: Analyzing trace with hash 872711574, now seen corresponding path program 1 times [2025-01-09 03:44:02,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:02,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465597287] [2025-01-09 03:44:02,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:02,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:02,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 03:44:02,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 03:44:02,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:02,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:03,002 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:03,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:03,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465597287] [2025-01-09 03:44:03,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465597287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:03,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:03,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:03,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152326773] [2025-01-09 03:44:03,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:03,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:03,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:03,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:03,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:03,006 INFO L87 Difference]: Start difference. First operand 508 states and 856 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:03,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:03,057 INFO L93 Difference]: Finished difference Result 998 states and 1689 transitions. [2025-01-09 03:44:03,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:03,057 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:03,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:03,061 INFO L225 Difference]: With dead ends: 998 [2025-01-09 03:44:03,061 INFO L226 Difference]: Without dead ends: 508 [2025-01-09 03:44:03,063 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:03,063 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 4 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2531 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:03,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2531 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:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-01-09 03:44:03,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-01-09 03:44:03,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 402 states have (on average 1.7114427860696517) internal successors, (688), 421 states have internal predecessors, (688), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 855 transitions. [2025-01-09 03:44:03,099 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 855 transitions. Word has length 76 [2025-01-09 03:44:03,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:03,100 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 855 transitions. [2025-01-09 03:44:03,100 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:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 855 transitions. [2025-01-09 03:44:03,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 03:44:03,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:03,103 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:03,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:44:03,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:03,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash 851926952, now seen corresponding path program 1 times [2025-01-09 03:44:03,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:03,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105664881] [2025-01-09 03:44:03,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:03,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:03,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 03:44:03,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 03:44:03,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:03,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:03,269 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:03,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:03,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105664881] [2025-01-09 03:44:03,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105664881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:03,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:03,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:03,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111507729] [2025-01-09 03:44:03,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:03,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:03,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:03,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:03,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:03,272 INFO L87 Difference]: Start difference. First operand 508 states and 855 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:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:03,329 INFO L93 Difference]: Finished difference Result 998 states and 1688 transitions. [2025-01-09 03:44:03,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:03,334 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:03,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:03,340 INFO L225 Difference]: With dead ends: 998 [2025-01-09 03:44:03,341 INFO L226 Difference]: Without dead ends: 508 [2025-01-09 03:44:03,343 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:03,344 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 3 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2531 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:03,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2531 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:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-01-09 03:44:03,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-01-09 03:44:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 402 states have (on average 1.708955223880597) internal successors, (687), 421 states have internal predecessors, (687), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:03,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 854 transitions. [2025-01-09 03:44:03,372 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 854 transitions. Word has length 77 [2025-01-09 03:44:03,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:03,373 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 854 transitions. [2025-01-09 03:44:03,373 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:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 854 transitions. [2025-01-09 03:44:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 03:44:03,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:03,377 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:03,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:44:03,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:03,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash -627189542, now seen corresponding path program 1 times [2025-01-09 03:44:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:03,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655100734] [2025-01-09 03:44:03,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:03,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:03,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 03:44:03,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 03:44:03,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:03,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:03,510 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:03,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:03,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655100734] [2025-01-09 03:44:03,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655100734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:03,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:03,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:03,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164917614] [2025-01-09 03:44:03,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:03,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:03,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:03,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:03,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:03,513 INFO L87 Difference]: Start difference. First operand 508 states and 854 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:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:03,561 INFO L93 Difference]: Finished difference Result 998 states and 1687 transitions. [2025-01-09 03:44:03,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:03,562 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:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:03,567 INFO L225 Difference]: With dead ends: 998 [2025-01-09 03:44:03,568 INFO L226 Difference]: Without dead ends: 508 [2025-01-09 03:44:03,570 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:03,571 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 2 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2531 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:03,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2531 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:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-01-09 03:44:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-01-09 03:44:03,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 402 states have (on average 1.7064676616915422) internal successors, (686), 421 states have internal predecessors, (686), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 853 transitions. [2025-01-09 03:44:03,598 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 853 transitions. Word has length 78 [2025-01-09 03:44:03,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:03,598 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 853 transitions. [2025-01-09 03:44:03,599 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:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 853 transitions. [2025-01-09 03:44:03,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 03:44:03,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:03,602 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:03,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:44:03,602 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:03,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:03,602 INFO L85 PathProgramCache]: Analyzing trace with hash -69953812, now seen corresponding path program 1 times [2025-01-09 03:44:03,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:03,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967363927] [2025-01-09 03:44:03,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:03,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:03,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 03:44:03,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 03:44:03,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:03,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:03,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:03,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:03,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967363927] [2025-01-09 03:44:03,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967363927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:03,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:03,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:03,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736070821] [2025-01-09 03:44:03,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:03,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:03,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:03,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:03,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:03,747 INFO L87 Difference]: Start difference. First operand 508 states and 853 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:03,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:03,785 INFO L93 Difference]: Finished difference Result 998 states and 1686 transitions. [2025-01-09 03:44:03,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:03,786 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:03,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:03,789 INFO L225 Difference]: With dead ends: 998 [2025-01-09 03:44:03,789 INFO L226 Difference]: Without dead ends: 508 [2025-01-09 03:44:03,792 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:03,793 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 1 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2531 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:03,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2531 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:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-01-09 03:44:03,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-01-09 03:44:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 402 states have (on average 1.7039800995024876) internal successors, (685), 421 states have internal predecessors, (685), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 852 transitions. [2025-01-09 03:44:03,815 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 852 transitions. Word has length 79 [2025-01-09 03:44:03,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:03,815 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 852 transitions. [2025-01-09 03:44:03,816 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:03,816 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 852 transitions. [2025-01-09 03:44:03,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 03:44:03,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:03,817 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:03,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:44:03,818 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:03,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:03,818 INFO L85 PathProgramCache]: Analyzing trace with hash -810308578, now seen corresponding path program 1 times [2025-01-09 03:44:03,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:03,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269246747] [2025-01-09 03:44:03,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:03,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:03,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 03:44:03,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 03:44:03,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:03,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:04,018 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:04,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:04,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269246747] [2025-01-09 03:44:04,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269246747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:04,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:04,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:44:04,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638409783] [2025-01-09 03:44:04,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:04,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:44:04,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:04,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:44:04,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:44:04,020 INFO L87 Difference]: Start difference. First operand 508 states and 852 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 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:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:04,121 INFO L93 Difference]: Finished difference Result 964 states and 1618 transitions. [2025-01-09 03:44:04,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:44:04,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 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:04,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:04,126 INFO L225 Difference]: With dead ends: 964 [2025-01-09 03:44:04,126 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 03:44:04,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:44:04,128 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 91 mSDsluCounter, 5797 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6637 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:04,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6637 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:04,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 03:44:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 521. [2025-01-09 03:44:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 412 states have (on average 1.6990291262135921) internal successors, (700), 433 states have internal predecessors, (700), 87 states have call successors, (87), 20 states have call predecessors, (87), 21 states have return successors, (84), 80 states have call predecessors, (84), 82 states have call successors, (84) [2025-01-09 03:44:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 871 transitions. [2025-01-09 03:44:04,157 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 871 transitions. Word has length 80 [2025-01-09 03:44:04,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:04,157 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 871 transitions. [2025-01-09 03:44:04,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 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:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 871 transitions. [2025-01-09 03:44:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 03:44:04,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:04,160 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:04,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:44:04,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:04,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:04,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1019006881, now seen corresponding path program 1 times [2025-01-09 03:44:04,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:04,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242163352] [2025-01-09 03:44:04,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:04,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:04,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 03:44:04,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 03:44:04,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:04,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:04,234 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:04,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:04,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242163352] [2025-01-09 03:44:04,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242163352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:04,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:04,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:04,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398933946] [2025-01-09 03:44:04,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:04,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:04,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:04,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:04,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:04,236 INFO L87 Difference]: Start difference. First operand 521 states and 871 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:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:04,291 INFO L93 Difference]: Finished difference Result 1016 states and 1712 transitions. [2025-01-09 03:44:04,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:04,292 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:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:04,295 INFO L225 Difference]: With dead ends: 1016 [2025-01-09 03:44:04,295 INFO L226 Difference]: Without dead ends: 502 [2025-01-09 03:44:04,297 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:04,297 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 0 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2533 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:04,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2533 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:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-01-09 03:44:04,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2025-01-09 03:44:04,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 396 states have (on average 1.6944444444444444) internal successors, (671), 415 states have internal predecessors, (671), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 838 transitions. [2025-01-09 03:44:04,313 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 838 transitions. Word has length 80 [2025-01-09 03:44:04,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:04,314 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 838 transitions. [2025-01-09 03:44:04,315 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:04,315 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 838 transitions. [2025-01-09 03:44:04,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 03:44:04,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:04,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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:04,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:44:04,317 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:04,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:04,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1197492602, now seen corresponding path program 1 times [2025-01-09 03:44:04,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:04,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207086074] [2025-01-09 03:44:04,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:04,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:04,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 03:44:04,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 03:44:04,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:04,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:04,425 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:04,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:04,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207086074] [2025-01-09 03:44:04,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207086074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:04,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:04,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:04,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938438692] [2025-01-09 03:44:04,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:04,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:04,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:04,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:04,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:04,427 INFO L87 Difference]: Start difference. First operand 502 states and 838 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:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:04,584 INFO L93 Difference]: Finished difference Result 961 states and 1610 transitions. [2025-01-09 03:44:04,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:04,585 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:04,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:04,588 INFO L225 Difference]: With dead ends: 961 [2025-01-09 03:44:04,588 INFO L226 Difference]: Without dead ends: 511 [2025-01-09 03:44:04,590 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:04,591 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 55 mSDsluCounter, 3151 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 3946 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:04,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 3946 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:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-01-09 03:44:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 502. [2025-01-09 03:44:04,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 396 states have (on average 1.6843434343434343) internal successors, (667), 415 states have internal predecessors, (667), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:04,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 834 transitions. [2025-01-09 03:44:04,607 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 834 transitions. Word has length 81 [2025-01-09 03:44:04,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:04,607 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 834 transitions. [2025-01-09 03:44:04,607 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:04,607 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 834 transitions. [2025-01-09 03:44:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 03:44:04,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:04,609 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:04,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:44:04,609 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:04,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:04,610 INFO L85 PathProgramCache]: Analyzing trace with hash 333046747, now seen corresponding path program 1 times [2025-01-09 03:44:04,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:04,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048757020] [2025-01-09 03:44:04,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:04,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:04,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 03:44:04,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 03:44:04,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:04,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:04,716 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:04,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:04,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048757020] [2025-01-09 03:44:04,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048757020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:04,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:04,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:04,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688835384] [2025-01-09 03:44:04,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:04,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:04,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:04,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:04,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:04,719 INFO L87 Difference]: Start difference. First operand 502 states and 834 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:04,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:04,867 INFO L93 Difference]: Finished difference Result 961 states and 1606 transitions. [2025-01-09 03:44:04,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:04,868 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:04,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:04,871 INFO L225 Difference]: With dead ends: 961 [2025-01-09 03:44:04,871 INFO L226 Difference]: Without dead ends: 511 [2025-01-09 03:44:04,873 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:04,874 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 54 mSDsluCounter, 3151 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3946 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:04,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3946 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:04,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-01-09 03:44:04,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 502. [2025-01-09 03:44:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 396 states have (on average 1.6742424242424243) internal successors, (663), 415 states have internal predecessors, (663), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 830 transitions. [2025-01-09 03:44:04,893 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 830 transitions. Word has length 82 [2025-01-09 03:44:04,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:04,893 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 830 transitions. [2025-01-09 03:44:04,893 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:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 830 transitions. [2025-01-09 03:44:04,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 03:44:04,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:04,895 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:04,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:44:04,896 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:04,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:04,897 INFO L85 PathProgramCache]: Analyzing trace with hash -593284107, now seen corresponding path program 1 times [2025-01-09 03:44:04,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:04,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162631375] [2025-01-09 03:44:04,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:04,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:04,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 03:44:04,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 03:44:04,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:04,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:05,035 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:05,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:05,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162631375] [2025-01-09 03:44:05,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162631375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:05,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:05,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:05,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553251830] [2025-01-09 03:44:05,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:05,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:05,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:05,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:05,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:05,037 INFO L87 Difference]: Start difference. First operand 502 states and 830 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:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:05,179 INFO L93 Difference]: Finished difference Result 961 states and 1602 transitions. [2025-01-09 03:44:05,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:05,179 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:05,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:05,184 INFO L225 Difference]: With dead ends: 961 [2025-01-09 03:44:05,184 INFO L226 Difference]: Without dead ends: 511 [2025-01-09 03:44:05,186 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:05,187 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 53 mSDsluCounter, 3134 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3928 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:05,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3928 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:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-01-09 03:44:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 502. [2025-01-09 03:44:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 396 states have (on average 1.6641414141414141) internal successors, (659), 415 states have internal predecessors, (659), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 826 transitions. [2025-01-09 03:44:05,206 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 826 transitions. Word has length 83 [2025-01-09 03:44:05,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:05,206 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 826 transitions. [2025-01-09 03:44:05,206 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:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 826 transitions. [2025-01-09 03:44:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 03:44:05,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:05,208 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:05,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:44:05,209 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:05,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:05,209 INFO L85 PathProgramCache]: Analyzing trace with hash -864999563, now seen corresponding path program 1 times [2025-01-09 03:44:05,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:05,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103091173] [2025-01-09 03:44:05,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:05,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:05,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 03:44:05,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 03:44:05,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:05,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:05,330 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:05,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:05,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103091173] [2025-01-09 03:44:05,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103091173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:05,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:05,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:05,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100205129] [2025-01-09 03:44:05,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:05,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:05,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:05,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:05,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:05,331 INFO L87 Difference]: Start difference. First operand 502 states and 826 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:05,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:05,390 INFO L93 Difference]: Finished difference Result 952 states and 1584 transitions. [2025-01-09 03:44:05,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:44:05,391 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:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:05,395 INFO L225 Difference]: With dead ends: 952 [2025-01-09 03:44:05,396 INFO L226 Difference]: Without dead ends: 481 [2025-01-09 03:44:05,398 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:05,398 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 84 mSDsluCounter, 4002 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 4817 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:05,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 4817 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:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-01-09 03:44:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2025-01-09 03:44:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 375 states have (on average 1.6666666666666667) internal successors, (625), 394 states have internal predecessors, (625), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:05,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 792 transitions. [2025-01-09 03:44:05,414 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 792 transitions. Word has length 83 [2025-01-09 03:44:05,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:05,415 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 792 transitions. [2025-01-09 03:44:05,415 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:05,415 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 792 transitions. [2025-01-09 03:44:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 03:44:05,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:05,417 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:05,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:44:05,417 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:05,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:05,417 INFO L85 PathProgramCache]: Analyzing trace with hash 856917366, now seen corresponding path program 1 times [2025-01-09 03:44:05,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:05,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124295259] [2025-01-09 03:44:05,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:05,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:05,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 03:44:05,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 03:44:05,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:05,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:05,547 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:05,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:05,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124295259] [2025-01-09 03:44:05,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124295259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:05,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:05,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:05,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922127240] [2025-01-09 03:44:05,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:05,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:05,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:05,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:05,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:05,549 INFO L87 Difference]: Start difference. First operand 481 states and 792 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:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:05,619 INFO L93 Difference]: Finished difference Result 931 states and 1550 transitions. [2025-01-09 03:44:05,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:05,620 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:05,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:05,623 INFO L225 Difference]: With dead ends: 931 [2025-01-09 03:44:05,624 INFO L226 Difference]: Without dead ends: 481 [2025-01-09 03:44:05,625 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:05,626 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 17 mSDsluCounter, 3091 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3866 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:05,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3866 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:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-01-09 03:44:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2025-01-09 03:44:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 375 states have (on average 1.664) internal successors, (624), 394 states have internal predecessors, (624), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 791 transitions. [2025-01-09 03:44:05,643 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 791 transitions. Word has length 84 [2025-01-09 03:44:05,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:05,643 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 791 transitions. [2025-01-09 03:44:05,643 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:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 791 transitions. [2025-01-09 03:44:05,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 03:44:05,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:05,646 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:05,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:44:05,646 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:05,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:05,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1329790352, now seen corresponding path program 1 times [2025-01-09 03:44:05,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:05,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697798107] [2025-01-09 03:44:05,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:05,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:05,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 03:44:05,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 03:44:05,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:05,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:05,764 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:05,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:05,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697798107] [2025-01-09 03:44:05,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697798107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:05,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:05,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:05,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740241754] [2025-01-09 03:44:05,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:05,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:05,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:05,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:05,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:05,766 INFO L87 Difference]: Start difference. First operand 481 states and 791 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:05,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:05,828 INFO L93 Difference]: Finished difference Result 931 states and 1549 transitions. [2025-01-09 03:44:05,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:05,829 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:05,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:05,833 INFO L225 Difference]: With dead ends: 931 [2025-01-09 03:44:05,833 INFO L226 Difference]: Without dead ends: 481 [2025-01-09 03:44:05,835 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:05,836 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 16 mSDsluCounter, 3091 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3866 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:05,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3866 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:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-01-09 03:44:05,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2025-01-09 03:44:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 375 states have (on average 1.6613333333333333) internal successors, (623), 394 states have internal predecessors, (623), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 790 transitions. [2025-01-09 03:44:05,849 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 790 transitions. Word has length 85 [2025-01-09 03:44:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:05,850 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 790 transitions. [2025-01-09 03:44:05,850 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:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 790 transitions. [2025-01-09 03:44:05,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 03:44:05,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:05,852 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:05,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:44:05,852 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:05,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:05,852 INFO L85 PathProgramCache]: Analyzing trace with hash -296565999, now seen corresponding path program 1 times [2025-01-09 03:44:05,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:05,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325932419] [2025-01-09 03:44:05,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:05,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:05,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 03:44:05,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 03:44:05,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:05,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:06,012 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:06,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:06,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325932419] [2025-01-09 03:44:06,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325932419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:06,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:06,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 03:44:06,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020370893] [2025-01-09 03:44:06,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:06,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:44:06,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:06,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:44:06,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:44:06,014 INFO L87 Difference]: Start difference. First operand 481 states and 790 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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:06,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:06,115 INFO L93 Difference]: Finished difference Result 925 states and 1537 transitions. [2025-01-09 03:44:06,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:44:06,115 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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 86 [2025-01-09 03:44:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:06,119 INFO L225 Difference]: With dead ends: 925 [2025-01-09 03:44:06,119 INFO L226 Difference]: Without dead ends: 481 [2025-01-09 03:44:06,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:44:06,121 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 6 mSDsluCounter, 6170 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6944 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:06,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 6944 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:06,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-01-09 03:44:06,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2025-01-09 03:44:06,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 375 states have (on average 1.6586666666666667) internal successors, (622), 394 states have internal predecessors, (622), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:06,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 789 transitions. [2025-01-09 03:44:06,135 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 789 transitions. Word has length 86 [2025-01-09 03:44:06,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:06,136 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 789 transitions. [2025-01-09 03:44:06,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 789 transitions. [2025-01-09 03:44:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 03:44:06,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:06,138 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:06,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:44:06,138 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:06,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:06,138 INFO L85 PathProgramCache]: Analyzing trace with hash -186424805, now seen corresponding path program 1 times [2025-01-09 03:44:06,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:06,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588064984] [2025-01-09 03:44:06,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:06,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:06,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 03:44:06,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 03:44:06,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:06,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:06,294 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:06,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:06,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588064984] [2025-01-09 03:44:06,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588064984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:06,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:06,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:44:06,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808345887] [2025-01-09 03:44:06,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:06,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:44:06,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:06,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:44:06,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:44:06,296 INFO L87 Difference]: Start difference. First operand 481 states and 789 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:07,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:07,579 INFO L93 Difference]: Finished difference Result 921 states and 1549 transitions. [2025-01-09 03:44:07,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:44:07,580 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:07,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:07,583 INFO L225 Difference]: With dead ends: 921 [2025-01-09 03:44:07,583 INFO L226 Difference]: Without dead ends: 485 [2025-01-09 03:44:07,585 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:07,585 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 1210 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 2374 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 2374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:07,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 1589 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 2374 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 03:44:07,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-01-09 03:44:07,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2025-01-09 03:44:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 378 states have (on average 1.6534391534391535) internal successors, (625), 397 states have internal predecessors, (625), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (97), 80 states have call predecessors, (97), 81 states have call successors, (97) [2025-01-09 03:44:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 808 transitions. [2025-01-09 03:44:07,604 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 808 transitions. Word has length 87 [2025-01-09 03:44:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:07,604 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 808 transitions. [2025-01-09 03:44:07,604 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:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 808 transitions. [2025-01-09 03:44:07,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 03:44:07,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:07,606 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:07,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:44:07,606 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:07,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1242351034, now seen corresponding path program 1 times [2025-01-09 03:44:07,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:07,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545242801] [2025-01-09 03:44:07,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:07,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:07,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 03:44:07,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 03:44:07,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:07,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:07,713 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:07,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:07,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545242801] [2025-01-09 03:44:07,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545242801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:07,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:07,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:07,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501584099] [2025-01-09 03:44:07,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:07,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:07,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:07,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:07,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:07,715 INFO L87 Difference]: Start difference. First operand 485 states and 808 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:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:10,185 INFO L93 Difference]: Finished difference Result 1727 states and 2974 transitions. [2025-01-09 03:44:10,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 03:44:10,185 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:10,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:10,195 INFO L225 Difference]: With dead ends: 1727 [2025-01-09 03:44:10,195 INFO L226 Difference]: Without dead ends: 1287 [2025-01-09 03:44:10,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-01-09 03:44:10,198 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 2171 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 4314 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2238 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 4878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 4314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:10,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2238 Valid, 2580 Invalid, 4878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 4314 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 03:44:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2025-01-09 03:44:10,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1230. [2025-01-09 03:44:10,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 955 states have (on average 1.668062827225131) internal successors, (1593), 1003 states have internal predecessors, (1593), 223 states have call successors, (223), 51 states have call predecessors, (223), 51 states have return successors, (238), 212 states have call predecessors, (238), 218 states have call successors, (238) [2025-01-09 03:44:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2054 transitions. [2025-01-09 03:44:10,254 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2054 transitions. Word has length 88 [2025-01-09 03:44:10,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:10,254 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 2054 transitions. [2025-01-09 03:44:10,254 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:10,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2054 transitions. [2025-01-09 03:44:10,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 03:44:10,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:10,256 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:10,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:44:10,256 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:10,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:10,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1108741414, now seen corresponding path program 1 times [2025-01-09 03:44:10,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:10,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519773618] [2025-01-09 03:44:10,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:10,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:10,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 03:44:10,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 03:44:10,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:10,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:10,396 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:10,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:10,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519773618] [2025-01-09 03:44:10,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519773618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:10,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:10,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:10,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858525145] [2025-01-09 03:44:10,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:10,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:10,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:10,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:10,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:10,397 INFO L87 Difference]: Start difference. First operand 1230 states and 2054 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:13,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:13,048 INFO L93 Difference]: Finished difference Result 5354 states and 9164 transitions. [2025-01-09 03:44:13,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:44:13,049 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:13,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:13,077 INFO L225 Difference]: With dead ends: 5354 [2025-01-09 03:44:13,077 INFO L226 Difference]: Without dead ends: 4169 [2025-01-09 03:44:13,087 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:13,087 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 2708 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 4876 mSolverCounterSat, 630 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2813 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 5506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 630 IncrementalHoareTripleChecker+Valid, 4876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:13,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2813 Valid, 2308 Invalid, 5506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [630 Valid, 4876 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 03:44:13,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4169 states. [2025-01-09 03:44:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4169 to 3885. [2025-01-09 03:44:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3885 states, 2920 states have (on average 1.6722602739726027) internal successors, (4883), 3096 states have internal predecessors, (4883), 817 states have call successors, (817), 137 states have call predecessors, (817), 147 states have return successors, (957), 792 states have call predecessors, (957), 812 states have call successors, (957) [2025-01-09 03:44:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 6657 transitions. [2025-01-09 03:44:13,284 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 6657 transitions. Word has length 90 [2025-01-09 03:44:13,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:13,285 INFO L471 AbstractCegarLoop]: Abstraction has 3885 states and 6657 transitions. [2025-01-09 03:44:13,285 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:13,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 6657 transitions. [2025-01-09 03:44:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 03:44:13,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:13,287 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:13,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:44:13,287 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:13,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2138100712, now seen corresponding path program 1 times [2025-01-09 03:44:13,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:13,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981102163] [2025-01-09 03:44:13,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:13,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:13,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 03:44:13,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 03:44:13,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:13,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:13,399 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:13,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:13,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981102163] [2025-01-09 03:44:13,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981102163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:13,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:13,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:13,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560669429] [2025-01-09 03:44:13,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:13,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:13,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:13,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:13,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:13,401 INFO L87 Difference]: Start difference. First operand 3885 states and 6657 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:15,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:15,405 INFO L93 Difference]: Finished difference Result 10676 states and 18445 transitions. [2025-01-09 03:44:15,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 03:44:15,406 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:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:15,455 INFO L225 Difference]: With dead ends: 10676 [2025-01-09 03:44:15,456 INFO L226 Difference]: Without dead ends: 7830 [2025-01-09 03:44:15,470 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:15,471 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 2239 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 3353 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2316 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 3828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 3353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:15,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2316 Valid, 1700 Invalid, 3828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 3353 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 03:44:15,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7830 states. [2025-01-09 03:44:15,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7830 to 7321. [2025-01-09 03:44:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7321 states, 5533 states have (on average 1.6696186517260077) internal successors, (9238), 5863 states have internal predecessors, (9238), 1485 states have call successors, (1485), 254 states have call predecessors, (1485), 302 states have return successors, (1868), 1439 states have call predecessors, (1868), 1480 states have call successors, (1868) [2025-01-09 03:44:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 12591 transitions. [2025-01-09 03:44:15,804 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 12591 transitions. Word has length 90 [2025-01-09 03:44:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:15,805 INFO L471 AbstractCegarLoop]: Abstraction has 7321 states and 12591 transitions. [2025-01-09 03:44:15,805 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:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 12591 transitions. [2025-01-09 03:44:15,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 03:44:15,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:15,806 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:15,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:44:15,807 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:15,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:15,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1002868753, now seen corresponding path program 1 times [2025-01-09 03:44:15,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:15,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045874773] [2025-01-09 03:44:15,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:15,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:15,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 03:44:15,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 03:44:15,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:15,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:15,954 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:15,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:15,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045874773] [2025-01-09 03:44:15,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045874773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:15,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:15,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:44:15,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845585544] [2025-01-09 03:44:15,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:15,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:44:15,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:15,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:44:15,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:44:15,957 INFO L87 Difference]: Start difference. First operand 7321 states and 12591 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:16,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:16,260 INFO L93 Difference]: Finished difference Result 13525 states and 23331 transitions. [2025-01-09 03:44:16,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:44:16,263 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:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:16,319 INFO L225 Difference]: With dead ends: 13525 [2025-01-09 03:44:16,319 INFO L226 Difference]: Without dead ends: 7408 [2025-01-09 03:44:16,346 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:16,346 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 0 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3118 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:16,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3118 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:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2025-01-09 03:44:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7394. [2025-01-09 03:44:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7394 states, 5589 states have (on average 1.6623725174449813) internal successors, (9291), 5918 states have internal predecessors, (9291), 1482 states have call successors, (1482), 254 states have call predecessors, (1482), 322 states have return successors, (1931), 1457 states have call predecessors, (1931), 1477 states have call successors, (1931) [2025-01-09 03:44:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7394 states to 7394 states and 12704 transitions. [2025-01-09 03:44:16,757 INFO L78 Accepts]: Start accepts. Automaton has 7394 states and 12704 transitions. Word has length 95 [2025-01-09 03:44:16,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:16,757 INFO L471 AbstractCegarLoop]: Abstraction has 7394 states and 12704 transitions. [2025-01-09 03:44:16,758 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:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 7394 states and 12704 transitions. [2025-01-09 03:44:16,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:44:16,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:16,760 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:16,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:44:16,760 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:16,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:16,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1446397268, now seen corresponding path program 1 times [2025-01-09 03:44:16,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:16,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111703543] [2025-01-09 03:44:16,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:16,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:16,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:44:16,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:44:16,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:16,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:16,893 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:16,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:16,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111703543] [2025-01-09 03:44:16,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111703543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:16,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:16,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:16,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725501314] [2025-01-09 03:44:16,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:16,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:16,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:16,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:16,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:16,895 INFO L87 Difference]: Start difference. First operand 7394 states and 12704 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:44:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:17,178 INFO L93 Difference]: Finished difference Result 14751 states and 25804 transitions. [2025-01-09 03:44:17,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:44:17,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 102 [2025-01-09 03:44:17,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:17,222 INFO L225 Difference]: With dead ends: 14751 [2025-01-09 03:44:17,222 INFO L226 Difference]: Without dead ends: 7542 [2025-01-09 03:44:17,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:17,248 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 224 mSDsluCounter, 3065 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 3895 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:17,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 3895 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7542 states. [2025-01-09 03:44:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7542 to 7418. [2025-01-09 03:44:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7418 states, 5610 states have (on average 1.6385026737967914) internal successors, (9192), 5942 states have internal predecessors, (9192), 1482 states have call successors, (1482), 254 states have call predecessors, (1482), 325 states have return successors, (1943), 1457 states have call predecessors, (1943), 1477 states have call successors, (1943) [2025-01-09 03:44:17,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7418 states to 7418 states and 12617 transitions. [2025-01-09 03:44:17,549 INFO L78 Accepts]: Start accepts. Automaton has 7418 states and 12617 transitions. Word has length 102 [2025-01-09 03:44:17,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:17,550 INFO L471 AbstractCegarLoop]: Abstraction has 7418 states and 12617 transitions. [2025-01-09 03:44:17,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:44:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 7418 states and 12617 transitions. [2025-01-09 03:44:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:44:17,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:17,552 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:17,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:44:17,553 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:17,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:17,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1587352502, now seen corresponding path program 1 times [2025-01-09 03:44:17,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:17,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439226565] [2025-01-09 03:44:17,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:17,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:17,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:44:17,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:44:17,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:17,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:17,677 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:17,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:17,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439226565] [2025-01-09 03:44:17,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439226565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:17,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:17,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:17,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014584628] [2025-01-09 03:44:17,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:17,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:17,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:17,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:17,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:17,679 INFO L87 Difference]: Start difference. First operand 7418 states and 12617 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:19,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:19,397 INFO L93 Difference]: Finished difference Result 14356 states and 24471 transitions. [2025-01-09 03:44:19,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:44:19,397 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:19,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:19,448 INFO L225 Difference]: With dead ends: 14356 [2025-01-09 03:44:19,448 INFO L226 Difference]: Without dead ends: 8158 [2025-01-09 03:44:19,472 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:19,473 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 1961 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 2856 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2035 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 3304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 2856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:19,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2035 Valid, 1638 Invalid, 3304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 2856 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 03:44:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8158 states. [2025-01-09 03:44:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8158 to 7653. [2025-01-09 03:44:19,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7653 states, 5785 states have (on average 1.6267934312878134) internal successors, (9411), 6135 states have internal predecessors, (9411), 1502 states have call successors, (1502), 279 states have call predecessors, (1502), 365 states have return successors, (2035), 1475 states have call predecessors, (2035), 1497 states have call successors, (2035) [2025-01-09 03:44:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7653 states to 7653 states and 12948 transitions. [2025-01-09 03:44:19,937 INFO L78 Accepts]: Start accepts. Automaton has 7653 states and 12948 transitions. Word has length 107 [2025-01-09 03:44:19,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:19,938 INFO L471 AbstractCegarLoop]: Abstraction has 7653 states and 12948 transitions. [2025-01-09 03:44:19,939 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:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 7653 states and 12948 transitions. [2025-01-09 03:44:19,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:44:19,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:19,942 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:19,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:44:19,942 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:19,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:19,942 INFO L85 PathProgramCache]: Analyzing trace with hash -611347815, now seen corresponding path program 1 times [2025-01-09 03:44:19,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:19,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822180229] [2025-01-09 03:44:19,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:19,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:19,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:44:19,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:44:19,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:19,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:20,059 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:20,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:20,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822180229] [2025-01-09 03:44:20,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822180229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:20,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:20,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:44:20,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811786137] [2025-01-09 03:44:20,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:20,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:44:20,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:20,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:44:20,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:44:20,061 INFO L87 Difference]: Start difference. First operand 7653 states and 12948 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 03:44:20,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:20,534 INFO L93 Difference]: Finished difference Result 17321 states and 29464 transitions. [2025-01-09 03:44:20,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:44:20,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-01-09 03:44:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:20,586 INFO L225 Difference]: With dead ends: 17321 [2025-01-09 03:44:20,586 INFO L226 Difference]: Without dead ends: 10888 [2025-01-09 03:44:20,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:20,607 INFO L435 NwaCegarLoop]: 1260 mSDtfsCounter, 720 mSDsluCounter, 3274 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 4534 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:20,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 4534 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:20,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10888 states. [2025-01-09 03:44:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10888 to 10214. [2025-01-09 03:44:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10214 states, 7729 states have (on average 1.637469271574589) internal successors, (12656), 8182 states have internal predecessors, (12656), 2023 states have call successors, (2023), 360 states have call predecessors, (2023), 461 states have return successors, (2676), 2003 states have call predecessors, (2676), 2018 states have call successors, (2676) [2025-01-09 03:44:20,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10214 states to 10214 states and 17355 transitions. [2025-01-09 03:44:20,975 INFO L78 Accepts]: Start accepts. Automaton has 10214 states and 17355 transitions. Word has length 112 [2025-01-09 03:44:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:20,975 INFO L471 AbstractCegarLoop]: Abstraction has 10214 states and 17355 transitions. [2025-01-09 03:44:20,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 03:44:20,976 INFO L276 IsEmpty]: Start isEmpty. Operand 10214 states and 17355 transitions. [2025-01-09 03:44:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:44:20,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:20,978 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:20,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:44:20,978 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:20,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:20,978 INFO L85 PathProgramCache]: Analyzing trace with hash -392493097, now seen corresponding path program 1 times [2025-01-09 03:44:20,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:20,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920051507] [2025-01-09 03:44:20,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:20,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:20,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:44:20,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:44:20,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:20,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:21,092 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:21,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:21,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920051507] [2025-01-09 03:44:21,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920051507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:21,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:21,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:21,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324689109] [2025-01-09 03:44:21,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:21,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:21,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:21,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:21,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:21,094 INFO L87 Difference]: Start difference. First operand 10214 states and 17355 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:21,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:21,727 INFO L93 Difference]: Finished difference Result 10342 states and 17580 transitions. [2025-01-09 03:44:21,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:44:21,727 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:21,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:21,793 INFO L225 Difference]: With dead ends: 10342 [2025-01-09 03:44:21,793 INFO L226 Difference]: Without dead ends: 10327 [2025-01-09 03:44:21,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:44:21,804 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 850 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 2755 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:21,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 2755 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:44:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10327 states. [2025-01-09 03:44:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10327 to 10222. [2025-01-09 03:44:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10222 states, 7737 states have (on average 1.6368101331265348) internal successors, (12664), 8190 states have internal predecessors, (12664), 2023 states have call successors, (2023), 360 states have call predecessors, (2023), 461 states have return successors, (2676), 2003 states have call predecessors, (2676), 2018 states have call successors, (2676) [2025-01-09 03:44:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10222 states to 10222 states and 17363 transitions. [2025-01-09 03:44:22,232 INFO L78 Accepts]: Start accepts. Automaton has 10222 states and 17363 transitions. Word has length 112 [2025-01-09 03:44:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:22,232 INFO L471 AbstractCegarLoop]: Abstraction has 10222 states and 17363 transitions. [2025-01-09 03:44:22,232 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:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 10222 states and 17363 transitions. [2025-01-09 03:44:22,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:44:22,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:22,234 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:22,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:44:22,235 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:22,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:22,235 INFO L85 PathProgramCache]: Analyzing trace with hash -2025369198, now seen corresponding path program 1 times [2025-01-09 03:44:22,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:22,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396891902] [2025-01-09 03:44:22,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:22,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:22,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:44:22,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:44:22,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:22,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:22,385 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:22,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:22,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396891902] [2025-01-09 03:44:22,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396891902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:22,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:22,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:22,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000700174] [2025-01-09 03:44:22,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:22,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:22,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:22,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:22,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:22,388 INFO L87 Difference]: Start difference. First operand 10222 states and 17363 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 03:44:22,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:22,707 INFO L93 Difference]: Finished difference Result 10237 states and 17381 transitions. [2025-01-09 03:44:22,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:44:22,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-01-09 03:44:22,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:22,771 INFO L225 Difference]: With dead ends: 10237 [2025-01-09 03:44:22,772 INFO L226 Difference]: Without dead ends: 10222 [2025-01-09 03:44:22,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:22,783 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 0 mSDsluCounter, 3864 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4638 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:22,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4638 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:22,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10222 states. [2025-01-09 03:44:23,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10222 to 10222. [2025-01-09 03:44:23,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10222 states, 7737 states have (on average 1.6357761406229805) internal successors, (12656), 8190 states have internal predecessors, (12656), 2023 states have call successors, (2023), 360 states have call predecessors, (2023), 461 states have return successors, (2676), 2003 states have call predecessors, (2676), 2018 states have call successors, (2676) [2025-01-09 03:44:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10222 states to 10222 states and 17355 transitions. [2025-01-09 03:44:23,382 INFO L78 Accepts]: Start accepts. Automaton has 10222 states and 17355 transitions. Word has length 118 [2025-01-09 03:44:23,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:23,382 INFO L471 AbstractCegarLoop]: Abstraction has 10222 states and 17355 transitions. [2025-01-09 03:44:23,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 03:44:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 10222 states and 17355 transitions. [2025-01-09 03:44:23,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:44:23,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:23,386 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:23,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 03:44:23,386 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:23,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:23,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1078535746, now seen corresponding path program 1 times [2025-01-09 03:44:23,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:23,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699272887] [2025-01-09 03:44:23,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:23,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:23,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:44:23,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:44:23,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:23,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:23,595 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:23,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:23,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699272887] [2025-01-09 03:44:23,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699272887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:23,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:23,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 03:44:23,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255085554] [2025-01-09 03:44:23,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:23,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:44:23,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:23,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:44:23,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:44:23,600 INFO L87 Difference]: Start difference. First operand 10222 states and 17355 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 03:44:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:26,472 INFO L93 Difference]: Finished difference Result 22328 states and 37635 transitions. [2025-01-09 03:44:26,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 03:44:26,477 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 131 [2025-01-09 03:44:26,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:26,642 INFO L225 Difference]: With dead ends: 22328 [2025-01-09 03:44:26,642 INFO L226 Difference]: Without dead ends: 13149 [2025-01-09 03:44:26,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-01-09 03:44:26,664 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 2631 mSDsluCounter, 2589 mSDsCounter, 0 mSdLazyCounter, 5795 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2714 SdHoareTripleChecker+Valid, 3097 SdHoareTripleChecker+Invalid, 6406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 5795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:26,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2714 Valid, 3097 Invalid, 6406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 5795 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 03:44:26,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13149 states. [2025-01-09 03:44:27,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13149 to 11959. [2025-01-09 03:44:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11959 states, 9109 states have (on average 1.614996157646284) internal successors, (14711), 9627 states have internal predecessors, (14711), 2251 states have call successors, (2251), 449 states have call predecessors, (2251), 598 states have return successors, (3012), 2207 states have call predecessors, (3012), 2246 states have call successors, (3012) [2025-01-09 03:44:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11959 states to 11959 states and 19974 transitions. [2025-01-09 03:44:27,081 INFO L78 Accepts]: Start accepts. Automaton has 11959 states and 19974 transitions. Word has length 131 [2025-01-09 03:44:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:27,081 INFO L471 AbstractCegarLoop]: Abstraction has 11959 states and 19974 transitions. [2025-01-09 03:44:27,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 03:44:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 11959 states and 19974 transitions. [2025-01-09 03:44:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 03:44:27,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:27,084 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:27,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 03:44:27,084 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:27,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:27,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1156705798, now seen corresponding path program 1 times [2025-01-09 03:44:27,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:27,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423588804] [2025-01-09 03:44:27,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:27,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:27,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:44:27,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:44:27,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:27,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 03:44:27,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:27,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423588804] [2025-01-09 03:44:27,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423588804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:27,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:27,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:44:27,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675967622] [2025-01-09 03:44:27,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:27,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:44:27,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:27,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:44:27,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:44:27,249 INFO L87 Difference]: Start difference. First operand 11959 states and 19974 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, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:44:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:28,653 INFO L93 Difference]: Finished difference Result 23927 states and 40123 transitions. [2025-01-09 03:44:28,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:44:28,653 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, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 129 [2025-01-09 03:44:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:28,703 INFO L225 Difference]: With dead ends: 23927 [2025-01-09 03:44:28,703 INFO L226 Difference]: Without dead ends: 12025 [2025-01-09 03:44:28,731 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:28,732 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 1157 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 2699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:28,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 1580 Invalid, 2699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 03:44:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12025 states. [2025-01-09 03:44:29,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12025 to 11959. [2025-01-09 03:44:29,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11959 states, 9109 states have (on average 1.614117905368317) internal successors, (14703), 9627 states have internal predecessors, (14703), 2251 states have call successors, (2251), 449 states have call predecessors, (2251), 598 states have return successors, (3012), 2207 states have call predecessors, (3012), 2246 states have call successors, (3012) [2025-01-09 03:44:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11959 states to 11959 states and 19966 transitions. [2025-01-09 03:44:29,165 INFO L78 Accepts]: Start accepts. Automaton has 11959 states and 19966 transitions. Word has length 129 [2025-01-09 03:44:29,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:29,166 INFO L471 AbstractCegarLoop]: Abstraction has 11959 states and 19966 transitions. [2025-01-09 03:44:29,166 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, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:44:29,166 INFO L276 IsEmpty]: Start isEmpty. Operand 11959 states and 19966 transitions. [2025-01-09 03:44:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 03:44:29,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:29,169 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:29,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 03:44:29,170 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:29,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:29,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1110735395, now seen corresponding path program 1 times [2025-01-09 03:44:29,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:29,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311769744] [2025-01-09 03:44:29,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:29,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:29,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 03:44:29,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 03:44:29,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:29,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:29,265 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:29,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:29,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311769744] [2025-01-09 03:44:29,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311769744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:29,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:29,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:29,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645441213] [2025-01-09 03:44:29,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:29,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:29,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:29,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:29,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:29,267 INFO L87 Difference]: Start difference. First operand 11959 states and 19966 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:31,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:31,138 INFO L93 Difference]: Finished difference Result 39368 states and 67684 transitions. [2025-01-09 03:44:31,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:44:31,139 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:31,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:31,329 INFO L225 Difference]: With dead ends: 39368 [2025-01-09 03:44:31,329 INFO L226 Difference]: Without dead ends: 27454 [2025-01-09 03:44:31,391 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:31,392 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 1733 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1803 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:31,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1803 Valid, 914 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 03:44:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27454 states. [2025-01-09 03:44:32,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27454 to 26556. [2025-01-09 03:44:32,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26556 states, 19745 states have (on average 1.607343631299063) internal successors, (31737), 21002 states have internal predecessors, (31737), 5552 states have call successors, (5552), 893 states have call predecessors, (5552), 1258 states have return successors, (8568), 5485 states have call predecessors, (8568), 5547 states have call successors, (8568) [2025-01-09 03:44:32,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26556 states to 26556 states and 45857 transitions. [2025-01-09 03:44:32,916 INFO L78 Accepts]: Start accepts. Automaton has 26556 states and 45857 transitions. Word has length 138 [2025-01-09 03:44:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:32,917 INFO L471 AbstractCegarLoop]: Abstraction has 26556 states and 45857 transitions. [2025-01-09 03:44:32,917 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:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 26556 states and 45857 transitions. [2025-01-09 03:44:32,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 03:44:32,920 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:32,921 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:32,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 03:44:32,921 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:32,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash 72938945, now seen corresponding path program 1 times [2025-01-09 03:44:32,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:32,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422601481] [2025-01-09 03:44:32,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:32,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:32,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 03:44:32,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 03:44:32,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:32,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:33,002 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:33,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:33,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422601481] [2025-01-09 03:44:33,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422601481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:33,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:33,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:33,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761146462] [2025-01-09 03:44:33,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:33,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:33,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:33,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:33,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:33,005 INFO L87 Difference]: Start difference. First operand 26556 states and 45857 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:44:36,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:36,601 INFO L93 Difference]: Finished difference Result 89094 states and 160399 transitions. [2025-01-09 03:44:36,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:44:36,601 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:44:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:36,917 INFO L225 Difference]: With dead ends: 89094 [2025-01-09 03:44:36,917 INFO L226 Difference]: Without dead ends: 62583 [2025-01-09 03:44:37,007 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:37,007 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1735 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:37,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1804 Valid, 884 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 03:44:37,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62583 states. [2025-01-09 03:44:40,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62583 to 60603. [2025-01-09 03:44:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60603 states, 43854 states have (on average 1.5986911114151503) internal successors, (70109), 46953 states have internal predecessors, (70109), 14089 states have call successors, (14089), 1781 states have call predecessors, (14089), 2659 states have return successors, (25528), 14008 states have call predecessors, (25528), 14084 states have call successors, (25528) [2025-01-09 03:44:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60603 states to 60603 states and 109726 transitions. [2025-01-09 03:44:40,979 INFO L78 Accepts]: Start accepts. Automaton has 60603 states and 109726 transitions. Word has length 139 [2025-01-09 03:44:40,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:40,980 INFO L471 AbstractCegarLoop]: Abstraction has 60603 states and 109726 transitions. [2025-01-09 03:44:40,980 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:44:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 60603 states and 109726 transitions. [2025-01-09 03:44:40,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 03:44:40,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:40,986 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:44:40,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 03:44:40,986 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:40,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:40,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1742153250, now seen corresponding path program 1 times [2025-01-09 03:44:40,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:40,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908303712] [2025-01-09 03:44:40,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:40,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:41,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 03:44:41,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 03:44:41,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:41,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:41,110 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:44:41,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:41,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908303712] [2025-01-09 03:44:41,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908303712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:41,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:41,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:41,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819843885] [2025-01-09 03:44:41,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:41,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:41,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:41,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:41,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:41,113 INFO L87 Difference]: Start difference. First operand 60603 states and 109726 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) [2025-01-09 03:44:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:50,967 INFO L93 Difference]: Finished difference Result 206867 states and 396463 transitions. [2025-01-09 03:44:50,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:44:50,968 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 142 [2025-01-09 03:44:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:52,137 INFO L225 Difference]: With dead ends: 206867 [2025-01-09 03:44:52,138 INFO L226 Difference]: Without dead ends: 146309 [2025-01-09 03:44:52,487 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:52,487 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1717 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:52,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1783 Valid, 881 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 03:44:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146309 states.