./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_product09.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 4cb164e6307f0ddcae5850d7f4578967441d1456f6ed5a5be472ba090758b873 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:35:11,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:35:11,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:35:11,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:35:11,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:35:11,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:35:11,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:35:11,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:35:11,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:35:11,142 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:35:11,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:35:11,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:35:11,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:35:11,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:35:11,143 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:35:11,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:35:11,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:35:11,143 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:35:11,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:35:11,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:35:11,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:35:11,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:35:11,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:35:11,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:35:11,144 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:35:11,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:35:11,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:35:11,144 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:35:11,144 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:35:11,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:35:11,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:35:11,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:35:11,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:35:11,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:35:11,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:35:11,145 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:35:11,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:35:11,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:35:11,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:35:11,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:35:11,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:35:11,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:35:11,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:35:11,145 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 -> 4cb164e6307f0ddcae5850d7f4578967441d1456f6ed5a5be472ba090758b873 [2025-02-05 15:35:11,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:35:11,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:35:11,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:35:11,397 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:35:11,398 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:35:11,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c [2025-02-05 15:35:12,485 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d658aca5f/a74aeabd7efd4c1c9c5f4439196dcd6d/FLAG48003af18 [2025-02-05 15:35:12,850 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:35:12,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c [2025-02-05 15:35:12,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d658aca5f/a74aeabd7efd4c1c9c5f4439196dcd6d/FLAG48003af18 [2025-02-05 15:35:13,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d658aca5f/a74aeabd7efd4c1c9c5f4439196dcd6d [2025-02-05 15:35:13,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:35:13,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:35:13,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:35:13,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:35:13,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:35:13,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:35:13" (1/1) ... [2025-02-05 15:35:13,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ade09f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:13, skipping insertion in model container [2025-02-05 15:35:13,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:35:13" (1/1) ... [2025-02-05 15:35:13,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:35:13,364 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_product09.cil.c[28842,28855] [2025-02-05 15:35:13,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:35:13,474 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:35:13,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-02-05 15:35:13,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [412] [2025-02-05 15:35:13,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [532] [2025-02-05 15:35:13,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [716] [2025-02-05 15:35:13,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1383] [2025-02-05 15:35:13,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1418] [2025-02-05 15:35:13,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1427] [2025-02-05 15:35:13,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2869] [2025-02-05 15:35:13,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3235] [2025-02-05 15:35:13,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3247] [2025-02-05 15:35:13,541 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_product09.cil.c[28842,28855] [2025-02-05 15:35:13,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:35:13,608 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:35:13,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:13 WrapperNode [2025-02-05 15:35:13,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:35:13,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:35:13,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:35:13,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:35:13,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:13" (1/1) ... [2025-02-05 15:35:13,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:13" (1/1) ... [2025-02-05 15:35:13,676 INFO L138 Inliner]: procedures = 89, calls = 330, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 808 [2025-02-05 15:35:13,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:35:13,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:35:13,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:35:13,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:35:13,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:13" (1/1) ... [2025-02-05 15:35:13,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:13" (1/1) ... [2025-02-05 15:35:13,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:13" (1/1) ... [2025-02-05 15:35:13,705 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-02-05 15:35:13,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:13" (1/1) ... [2025-02-05 15:35:13,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:13" (1/1) ... [2025-02-05 15:35:13,729 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:13" (1/1) ... [2025-02-05 15:35:13,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:13" (1/1) ... [2025-02-05 15:35:13,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:13" (1/1) ... [2025-02-05 15:35:13,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:13" (1/1) ... [2025-02-05 15:35:13,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:35:13,746 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:35:13,746 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:35:13,747 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:35:13,747 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:13" (1/1) ... [2025-02-05 15:35:13,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:35:13,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:13,771 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-02-05 15:35:13,780 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-02-05 15:35:13,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:35:13,797 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-02-05 15:35:13,798 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-02-05 15:35:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:35:13,798 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:35:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:35:13,798 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:35:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:35:13,798 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:35:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:35:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:35:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:35:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:35:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-02-05 15:35:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-02-05 15:35:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:35:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:35:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:35:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:35:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:35:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:35:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:35:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:35:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:35:13,800 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:35:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:35:13,800 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:35:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:35:13,800 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:35:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:35:13,800 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:35:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:35:13,800 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:35:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:35:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:35:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:35:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:35:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:35:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:35:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:35:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:35:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:35:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:35:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:35:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:35:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:35:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:35:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:35:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:35:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:35:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:35:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:35:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:35:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:35:13,801 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:35:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:35:13,801 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:35:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:35:13,802 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:35:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:35:13,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:35:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:35:13,802 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:35:13,960 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:35:13,963 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:35:14,012 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: #res := ~retValue_acc~4; [2025-02-05 15:35:14,018 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1500: #res := ~retValue_acc~10; [2025-02-05 15:35:14,303 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2190: #res := ~retValue_acc~18; [2025-02-05 15:35:14,381 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2294: #res := ~retValue_acc~21; [2025-02-05 15:35:14,401 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L490: #res := ~retValue_acc~3; [2025-02-05 15:35:14,483 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1745-1: isEmpty_#res#1 := isEmpty_~retValue_acc~15#1; [2025-02-05 15:35:14,572 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~16#1; [2025-02-05 15:35:14,573 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1838-1: isIdle_#res#1 := isIdle_~retValue_acc~17#1; [2025-02-05 15:35:14,747 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~13#1; [2025-02-05 15:35:14,747 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2280-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~20#1; [2025-02-05 15:35:14,748 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~11#1; [2025-02-05 15:35:14,793 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1069: #res := ~retValue_acc~6; [2025-02-05 15:35:14,845 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L409-1: main_#res#1 := main_~retValue_acc~1#1; [2025-02-05 15:35:14,845 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1415-1: valid_product_#res#1 := valid_product_~retValue_acc~9#1; [2025-02-05 15:35:14,853 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L833: #res := ~retValue_acc~5; [2025-02-05 15:35:14,855 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1662: #res := ~retValue_acc~12; [2025-02-05 15:35:14,858 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1380: #res := ~retValue_acc~7; [2025-02-05 15:35:14,965 INFO L? ?]: Removed 421 outVars from TransFormulas that were not future-live. [2025-02-05 15:35:14,965 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:35:14,977 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:35:14,977 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:35:14,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:35:14 BoogieIcfgContainer [2025-02-05 15:35:14,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:35:14,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:35:14,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:35:14,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:35:14,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:35:13" (1/3) ... [2025-02-05 15:35:14,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33323c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:35:14, skipping insertion in model container [2025-02-05 15:35:14,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:13" (2/3) ... [2025-02-05 15:35:14,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33323c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:35:14, skipping insertion in model container [2025-02-05 15:35:14,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:35:14" (3/3) ... [2025-02-05 15:35:14,983 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product09.cil.c [2025-02-05 15:35:14,992 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:35:14,995 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product09.cil.c that has 21 procedures, 526 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:35:15,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:35:15,046 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;@d07aab1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:35:15,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:35:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 526 states, 417 states have (on average 1.7170263788968825) internal successors, (716), 439 states have internal predecessors, (716), 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-02-05 15:35:15,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 15:35:15,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:15,064 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:15,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:15,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:15,068 INFO L85 PathProgramCache]: Analyzing trace with hash 421352534, now seen corresponding path program 1 times [2025-02-05 15:35:15,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:15,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506213248] [2025-02-05 15:35:15,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:15,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:15,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 15:35:15,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 15:35:15,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:15,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:15,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:15,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506213248] [2025-02-05 15:35:15,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506213248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:15,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:15,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:15,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445757509] [2025-02-05 15:35:15,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:15,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:15,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:15,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:15,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:15,517 INFO L87 Difference]: Start difference. First operand has 526 states, 417 states have (on average 1.7170263788968825) internal successors, (716), 439 states have internal predecessors, (716), 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 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:15,623 INFO L93 Difference]: Finished difference Result 1032 states and 1750 transitions. [2025-02-05 15:35:15,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:15,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2025-02-05 15:35:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:15,638 INFO L225 Difference]: With dead ends: 1032 [2025-02-05 15:35:15,638 INFO L226 Difference]: Without dead ends: 517 [2025-02-05 15:35:15,643 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-02-05 15:35:15,645 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 5 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2600 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-02-05 15:35:15,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2600 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:15,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-02-05 15:35:15,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-02-05 15:35:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.710462287104623) internal successors, (703), 430 states have internal predecessors, (703), 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-02-05 15:35:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 870 transitions. [2025-02-05 15:35:15,706 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 870 transitions. Word has length 92 [2025-02-05 15:35:15,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:15,706 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 870 transitions. [2025-02-05 15:35:15,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 870 transitions. [2025-02-05 15:35:15,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 15:35:15,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:15,713 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:35:15,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:35:15,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:15,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:15,715 INFO L85 PathProgramCache]: Analyzing trace with hash 349917990, now seen corresponding path program 1 times [2025-02-05 15:35:15,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:15,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598561662] [2025-02-05 15:35:15,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:15,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:15,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 15:35:15,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 15:35:15,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:15,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:15,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:15,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598561662] [2025-02-05 15:35:15,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598561662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:15,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:15,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:15,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378298499] [2025-02-05 15:35:15,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:15,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:15,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:15,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:15,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:15,954 INFO L87 Difference]: Start difference. First operand 517 states and 870 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:16,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:16,035 INFO L93 Difference]: Finished difference Result 1016 states and 1717 transitions. [2025-02-05 15:35:16,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:16,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2025-02-05 15:35:16,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:16,042 INFO L225 Difference]: With dead ends: 1016 [2025-02-05 15:35:16,044 INFO L226 Difference]: Without dead ends: 517 [2025-02-05 15:35:16,046 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-02-05 15:35:16,047 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 4 mSDsluCounter, 1714 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2573 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-02-05 15:35:16,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2573 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:16,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-02-05 15:35:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-02-05 15:35:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.7080291970802919) internal successors, (702), 430 states have internal predecessors, (702), 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-02-05 15:35:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 869 transitions. [2025-02-05 15:35:16,088 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 869 transitions. Word has length 93 [2025-02-05 15:35:16,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:16,088 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 869 transitions. [2025-02-05 15:35:16,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 869 transitions. [2025-02-05 15:35:16,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 15:35:16,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:16,094 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:35:16,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:35:16,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:16,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:16,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1377966029, now seen corresponding path program 1 times [2025-02-05 15:35:16,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:16,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573594371] [2025-02-05 15:35:16,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:16,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:16,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 15:35:16,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 15:35:16,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:16,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:16,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:16,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573594371] [2025-02-05 15:35:16,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573594371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:16,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:16,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:16,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518729359] [2025-02-05 15:35:16,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:16,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:16,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:16,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:16,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:16,259 INFO L87 Difference]: Start difference. First operand 517 states and 869 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:16,324 INFO L93 Difference]: Finished difference Result 1016 states and 1716 transitions. [2025-02-05 15:35:16,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:16,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2025-02-05 15:35:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:16,329 INFO L225 Difference]: With dead ends: 1016 [2025-02-05 15:35:16,330 INFO L226 Difference]: Without dead ends: 517 [2025-02-05 15:35:16,332 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-02-05 15:35:16,332 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 3 mSDsluCounter, 1714 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2573 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-02-05 15:35:16,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2573 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-02-05 15:35:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-02-05 15:35:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.705596107055961) internal successors, (701), 430 states have internal predecessors, (701), 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-02-05 15:35:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 868 transitions. [2025-02-05 15:35:16,357 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 868 transitions. Word has length 94 [2025-02-05 15:35:16,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:16,358 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 868 transitions. [2025-02-05 15:35:16,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 868 transitions. [2025-02-05 15:35:16,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 15:35:16,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:16,362 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:35:16,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:35:16,363 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:16,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:16,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1378791075, now seen corresponding path program 1 times [2025-02-05 15:35:16,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:16,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103330167] [2025-02-05 15:35:16,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:16,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:16,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 15:35:16,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 15:35:16,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:16,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:16,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:16,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103330167] [2025-02-05 15:35:16,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103330167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:16,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:16,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:16,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770253456] [2025-02-05 15:35:16,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:16,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:16,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:16,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:16,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:16,533 INFO L87 Difference]: Start difference. First operand 517 states and 868 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:16,582 INFO L93 Difference]: Finished difference Result 1016 states and 1715 transitions. [2025-02-05 15:35:16,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:16,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 95 [2025-02-05 15:35:16,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:16,590 INFO L225 Difference]: With dead ends: 1016 [2025-02-05 15:35:16,590 INFO L226 Difference]: Without dead ends: 517 [2025-02-05 15:35:16,592 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-02-05 15:35:16,593 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 2 mSDsluCounter, 1714 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2573 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-02-05 15:35:16,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2573 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:16,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-02-05 15:35:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-02-05 15:35:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.70316301703163) internal successors, (700), 430 states have internal predecessors, (700), 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-02-05 15:35:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 867 transitions. [2025-02-05 15:35:16,621 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 867 transitions. Word has length 95 [2025-02-05 15:35:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:16,621 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 867 transitions. [2025-02-05 15:35:16,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 867 transitions. [2025-02-05 15:35:16,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 15:35:16,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:16,625 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:35:16,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:35:16,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:16,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:16,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1425502224, now seen corresponding path program 1 times [2025-02-05 15:35:16,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:16,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991421151] [2025-02-05 15:35:16,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:16,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:16,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 15:35:16,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 15:35:16,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:16,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:16,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:16,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991421151] [2025-02-05 15:35:16,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991421151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:16,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:16,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:16,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006242448] [2025-02-05 15:35:16,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:16,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:16,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:16,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:16,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:16,752 INFO L87 Difference]: Start difference. First operand 517 states and 867 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:16,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:16,791 INFO L93 Difference]: Finished difference Result 1016 states and 1714 transitions. [2025-02-05 15:35:16,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:16,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96 [2025-02-05 15:35:16,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:16,797 INFO L225 Difference]: With dead ends: 1016 [2025-02-05 15:35:16,797 INFO L226 Difference]: Without dead ends: 517 [2025-02-05 15:35:16,800 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-02-05 15:35:16,801 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 1 mSDsluCounter, 1714 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2573 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-02-05 15:35:16,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2573 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:16,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-02-05 15:35:16,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-02-05 15:35:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.7007299270072993) internal successors, (699), 430 states have internal predecessors, (699), 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-02-05 15:35:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 866 transitions. [2025-02-05 15:35:16,828 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 866 transitions. Word has length 96 [2025-02-05 15:35:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:16,830 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 866 transitions. [2025-02-05 15:35:16,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:16,830 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 866 transitions. [2025-02-05 15:35:16,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 15:35:16,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:16,834 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:16,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:35:16,834 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:16,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:16,835 INFO L85 PathProgramCache]: Analyzing trace with hash -934832608, now seen corresponding path program 1 times [2025-02-05 15:35:16,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:16,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633605573] [2025-02-05 15:35:16,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:16,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:16,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 15:35:16,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 15:35:16,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:16,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:17,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:17,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633605573] [2025-02-05 15:35:17,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633605573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:17,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:17,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:35:17,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3674621] [2025-02-05 15:35:17,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:17,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:35:17,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:17,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:35:17,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:35:17,034 INFO L87 Difference]: Start difference. First operand 517 states and 866 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:35:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:17,133 INFO L93 Difference]: Finished difference Result 982 states and 1646 transitions. [2025-02-05 15:35:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:35:17,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 97 [2025-02-05 15:35:17,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:17,139 INFO L225 Difference]: With dead ends: 982 [2025-02-05 15:35:17,139 INFO L226 Difference]: Without dead ends: 532 [2025-02-05 15:35:17,141 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-02-05 15:35:17,142 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 91 mSDsluCounter, 4199 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5055 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:17,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5055 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:17,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-05 15:35:17,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 530. [2025-02-05 15:35:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 421 states have (on average 1.6959619952494063) internal successors, (714), 442 states have internal predecessors, (714), 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-02-05 15:35:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 885 transitions. [2025-02-05 15:35:17,166 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 885 transitions. Word has length 97 [2025-02-05 15:35:17,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:17,166 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 885 transitions. [2025-02-05 15:35:17,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:35:17,166 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 885 transitions. [2025-02-05 15:35:17,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 15:35:17,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:17,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:17,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:35:17,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:17,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:17,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1506083841, now seen corresponding path program 1 times [2025-02-05 15:35:17,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:17,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809469280] [2025-02-05 15:35:17,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:17,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:17,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 15:35:17,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 15:35:17,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:17,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:17,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:17,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809469280] [2025-02-05 15:35:17,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809469280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:17,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:17,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:17,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671159080] [2025-02-05 15:35:17,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:17,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:17,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:17,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:17,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:17,277 INFO L87 Difference]: Start difference. First operand 530 states and 885 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:17,313 INFO L93 Difference]: Finished difference Result 1034 states and 1740 transitions. [2025-02-05 15:35:17,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:17,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2025-02-05 15:35:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:17,316 INFO L225 Difference]: With dead ends: 1034 [2025-02-05 15:35:17,316 INFO L226 Difference]: Without dead ends: 511 [2025-02-05 15:35:17,318 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-02-05 15:35:17,318 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 0 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2575 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-02-05 15:35:17,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2575 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:17,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-02-05 15:35:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-02-05 15:35:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 405 states have (on average 1.691358024691358) internal successors, (685), 424 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-02-05 15:35:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 852 transitions. [2025-02-05 15:35:17,332 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 852 transitions. Word has length 97 [2025-02-05 15:35:17,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:17,332 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 852 transitions. [2025-02-05 15:35:17,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:17,332 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 852 transitions. [2025-02-05 15:35:17,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 15:35:17,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:17,335 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:17,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:35:17,335 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:17,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:17,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1212508539, now seen corresponding path program 1 times [2025-02-05 15:35:17,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:17,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681902156] [2025-02-05 15:35:17,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:17,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:17,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:35:17,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:35:17,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:17,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:17,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:17,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681902156] [2025-02-05 15:35:17,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681902156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:17,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:17,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:35:17,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237837109] [2025-02-05 15:35:17,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:17,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:35:17,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:17,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:35:17,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:35:17,448 INFO L87 Difference]: Start difference. First operand 511 states and 852 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:17,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:17,600 INFO L93 Difference]: Finished difference Result 979 states and 1638 transitions. [2025-02-05 15:35:17,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:17,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2025-02-05 15:35:17,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:17,605 INFO L225 Difference]: With dead ends: 979 [2025-02-05 15:35:17,605 INFO L226 Difference]: Without dead ends: 520 [2025-02-05 15:35:17,606 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-02-05 15:35:17,607 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 55 mSDsluCounter, 3207 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4016 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-02-05 15:35:17,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4016 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:17,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-02-05 15:35:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 511. [2025-02-05 15:35:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 405 states have (on average 1.6814814814814816) internal successors, (681), 424 states have internal predecessors, (681), 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-02-05 15:35:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 848 transitions. [2025-02-05 15:35:17,621 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 848 transitions. Word has length 98 [2025-02-05 15:35:17,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:17,622 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 848 transitions. [2025-02-05 15:35:17,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 848 transitions. [2025-02-05 15:35:17,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 15:35:17,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:17,624 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:35:17,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:35:17,625 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:17,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:17,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1681925801, now seen corresponding path program 1 times [2025-02-05 15:35:17,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:17,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800909934] [2025-02-05 15:35:17,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:17,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:17,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:35:17,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:35:17,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:17,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:17,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:17,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800909934] [2025-02-05 15:35:17,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800909934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:17,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:17,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:35:17,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095958431] [2025-02-05 15:35:17,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:17,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:35:17,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:17,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:35:17,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:35:17,753 INFO L87 Difference]: Start difference. First operand 511 states and 848 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:17,898 INFO L93 Difference]: Finished difference Result 979 states and 1634 transitions. [2025-02-05 15:35:17,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:17,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2025-02-05 15:35:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:17,902 INFO L225 Difference]: With dead ends: 979 [2025-02-05 15:35:17,902 INFO L226 Difference]: Without dead ends: 520 [2025-02-05 15:35:17,903 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-02-05 15:35:17,904 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 54 mSDsluCounter, 3207 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4016 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-02-05 15:35:17,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4016 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:17,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-02-05 15:35:17,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 511. [2025-02-05 15:35:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 405 states have (on average 1.671604938271605) internal successors, (677), 424 states have internal predecessors, (677), 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-02-05 15:35:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 844 transitions. [2025-02-05 15:35:17,918 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 844 transitions. Word has length 99 [2025-02-05 15:35:17,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:17,918 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 844 transitions. [2025-02-05 15:35:17,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:17,918 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 844 transitions. [2025-02-05 15:35:17,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 15:35:17,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:17,921 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:35:17,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:35:17,921 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:17,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:17,921 INFO L85 PathProgramCache]: Analyzing trace with hash -896735864, now seen corresponding path program 1 times [2025-02-05 15:35:17,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:17,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594792222] [2025-02-05 15:35:17,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:17,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:17,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 15:35:17,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 15:35:17,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:17,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:18,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:18,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594792222] [2025-02-05 15:35:18,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594792222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:18,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:18,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:35:18,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885408989] [2025-02-05 15:35:18,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:18,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:35:18,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:18,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:35:18,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:35:18,049 INFO L87 Difference]: Start difference. First operand 511 states and 844 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:18,190 INFO L93 Difference]: Finished difference Result 979 states and 1630 transitions. [2025-02-05 15:35:18,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:18,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2025-02-05 15:35:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:18,194 INFO L225 Difference]: With dead ends: 979 [2025-02-05 15:35:18,194 INFO L226 Difference]: Without dead ends: 520 [2025-02-05 15:35:18,196 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-02-05 15:35:18,197 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 53 mSDsluCounter, 3190 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3998 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-02-05 15:35:18,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3998 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-02-05 15:35:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 511. [2025-02-05 15:35:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 405 states have (on average 1.6617283950617283) internal successors, (673), 424 states have internal predecessors, (673), 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-02-05 15:35:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 840 transitions. [2025-02-05 15:35:18,213 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 840 transitions. Word has length 100 [2025-02-05 15:35:18,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:18,213 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 840 transitions. [2025-02-05 15:35:18,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 840 transitions. [2025-02-05 15:35:18,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 15:35:18,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:18,216 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:35:18,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:35:18,216 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:18,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:18,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1316906423, now seen corresponding path program 1 times [2025-02-05 15:35:18,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:18,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267035822] [2025-02-05 15:35:18,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:18,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:18,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 15:35:18,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 15:35:18,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:18,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:18,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:18,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267035822] [2025-02-05 15:35:18,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267035822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:18,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:18,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:35:18,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411131390] [2025-02-05 15:35:18,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:18,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:35:18,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:18,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:35:18,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:35:18,349 INFO L87 Difference]: Start difference. First operand 511 states and 840 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:35:18,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:18,409 INFO L93 Difference]: Finished difference Result 970 states and 1612 transitions. [2025-02-05 15:35:18,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:35:18,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 100 [2025-02-05 15:35:18,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:18,417 INFO L225 Difference]: With dead ends: 970 [2025-02-05 15:35:18,418 INFO L226 Difference]: Without dead ends: 490 [2025-02-05 15:35:18,419 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-02-05 15:35:18,420 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 84 mSDsluCounter, 4072 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 4901 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-02-05 15:35:18,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 4901 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:18,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-02-05 15:35:18,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-02-05 15:35:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 384 states have (on average 1.6640625) internal successors, (639), 403 states have internal predecessors, (639), 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-02-05 15:35:18,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 806 transitions. [2025-02-05 15:35:18,433 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 806 transitions. Word has length 100 [2025-02-05 15:35:18,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:18,434 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 806 transitions. [2025-02-05 15:35:18,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:35:18,434 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 806 transitions. [2025-02-05 15:35:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 15:35:18,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:18,436 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:35:18,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:35:18,436 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:18,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:18,437 INFO L85 PathProgramCache]: Analyzing trace with hash 126571578, now seen corresponding path program 1 times [2025-02-05 15:35:18,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:18,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022485772] [2025-02-05 15:35:18,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:18,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:18,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 15:35:18,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 15:35:18,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:18,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:18,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:18,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022485772] [2025-02-05 15:35:18,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022485772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:18,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:18,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:35:18,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957270706] [2025-02-05 15:35:18,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:18,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:35:18,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:18,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:35:18,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:35:18,560 INFO L87 Difference]: Start difference. First operand 490 states and 806 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:18,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:18,620 INFO L93 Difference]: Finished difference Result 949 states and 1578 transitions. [2025-02-05 15:35:18,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:18,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2025-02-05 15:35:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:18,624 INFO L225 Difference]: With dead ends: 949 [2025-02-05 15:35:18,624 INFO L226 Difference]: Without dead ends: 490 [2025-02-05 15:35:18,626 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-02-05 15:35:18,626 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 17 mSDsluCounter, 3147 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3936 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-02-05 15:35:18,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3936 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:18,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-02-05 15:35:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-02-05 15:35:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 384 states have (on average 1.6614583333333333) internal successors, (638), 403 states have internal predecessors, (638), 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-02-05 15:35:18,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 805 transitions. [2025-02-05 15:35:18,641 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 805 transitions. Word has length 101 [2025-02-05 15:35:18,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:18,641 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 805 transitions. [2025-02-05 15:35:18,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:18,641 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 805 transitions. [2025-02-05 15:35:18,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 15:35:18,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:18,644 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:35:18,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:35:18,644 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:18,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:18,645 INFO L85 PathProgramCache]: Analyzing trace with hash -58412917, now seen corresponding path program 1 times [2025-02-05 15:35:18,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:18,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694378761] [2025-02-05 15:35:18,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:18,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:18,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 15:35:18,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 15:35:18,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:18,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:18,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:18,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694378761] [2025-02-05 15:35:18,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694378761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:18,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:18,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:35:18,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331728475] [2025-02-05 15:35:18,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:18,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:35:18,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:18,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:35:18,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:35:18,745 INFO L87 Difference]: Start difference. First operand 490 states and 805 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:18,818 INFO L93 Difference]: Finished difference Result 949 states and 1577 transitions. [2025-02-05 15:35:18,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:18,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 102 [2025-02-05 15:35:18,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:18,822 INFO L225 Difference]: With dead ends: 949 [2025-02-05 15:35:18,822 INFO L226 Difference]: Without dead ends: 490 [2025-02-05 15:35:18,824 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-02-05 15:35:18,825 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 16 mSDsluCounter, 3147 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3936 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-02-05 15:35:18,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3936 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:18,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-02-05 15:35:18,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-02-05 15:35:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 384 states have (on average 1.6588541666666667) internal successors, (637), 403 states have internal predecessors, (637), 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-02-05 15:35:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 804 transitions. [2025-02-05 15:35:18,841 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 804 transitions. Word has length 102 [2025-02-05 15:35:18,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:18,841 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 804 transitions. [2025-02-05 15:35:18,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 804 transitions. [2025-02-05 15:35:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 15:35:18,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:18,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:18,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:35:18,845 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:18,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:18,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1263074, now seen corresponding path program 1 times [2025-02-05 15:35:18,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:18,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723829575] [2025-02-05 15:35:18,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:18,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:18,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 15:35:18,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:35:18,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:18,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:18,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:18,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723829575] [2025-02-05 15:35:18,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723829575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:18,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:18,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:18,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037601878] [2025-02-05 15:35:18,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:18,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:18,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:18,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:18,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:18,919 INFO L87 Difference]: Start difference. First operand 490 states and 804 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:18,945 INFO L93 Difference]: Finished difference Result 949 states and 1576 transitions. [2025-02-05 15:35:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:18,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 103 [2025-02-05 15:35:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:18,950 INFO L225 Difference]: With dead ends: 949 [2025-02-05 15:35:18,950 INFO L226 Difference]: Without dead ends: 490 [2025-02-05 15:35:18,951 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-02-05 15:35:18,952 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 9 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2385 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-02-05 15:35:18,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2385 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:18,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-02-05 15:35:18,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-02-05 15:35:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 384 states have (on average 1.65625) internal successors, (636), 403 states have internal predecessors, (636), 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-02-05 15:35:18,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 803 transitions. [2025-02-05 15:35:18,966 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 803 transitions. Word has length 103 [2025-02-05 15:35:18,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:18,966 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 803 transitions. [2025-02-05 15:35:18,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:18,967 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 803 transitions. [2025-02-05 15:35:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 15:35:18,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:18,969 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:18,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:35:18,970 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:18,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:18,970 INFO L85 PathProgramCache]: Analyzing trace with hash 954258205, now seen corresponding path program 1 times [2025-02-05 15:35:18,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:18,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409374970] [2025-02-05 15:35:18,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:18,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:18,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 15:35:19,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:35:19,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:19,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:19,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:19,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409374970] [2025-02-05 15:35:19,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409374970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:19,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:19,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:19,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932966140] [2025-02-05 15:35:19,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:19,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:19,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:19,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:19,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:19,141 INFO L87 Difference]: Start difference. First operand 490 states and 803 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:19,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:19,235 INFO L93 Difference]: Finished difference Result 943 states and 1564 transitions. [2025-02-05 15:35:19,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:19,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 103 [2025-02-05 15:35:19,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:19,239 INFO L225 Difference]: With dead ends: 943 [2025-02-05 15:35:19,239 INFO L226 Difference]: Without dead ends: 490 [2025-02-05 15:35:19,241 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-02-05 15:35:19,241 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 4 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2364 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:19,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2364 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:19,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-02-05 15:35:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-02-05 15:35:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 384 states have (on average 1.6536458333333333) internal successors, (635), 403 states have internal predecessors, (635), 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-02-05 15:35:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 802 transitions. [2025-02-05 15:35:19,275 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 802 transitions. Word has length 103 [2025-02-05 15:35:19,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:19,275 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 802 transitions. [2025-02-05 15:35:19,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 802 transitions. [2025-02-05 15:35:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 15:35:19,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:19,280 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:35:19,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:35:19,280 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:19,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:19,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1698637890, now seen corresponding path program 1 times [2025-02-05 15:35:19,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:19,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854363592] [2025-02-05 15:35:19,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:19,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:19,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:35:19,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:35:19,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:19,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:35:19,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:19,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854363592] [2025-02-05 15:35:19,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854363592] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:35:19,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285042487] [2025-02-05 15:35:19,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:19,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:19,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:19,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:35:19,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:35:19,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:35:19,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:35:19,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:19,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:20,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 1395 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:35:20,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:35:20,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:35:20,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:35:20,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285042487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:20,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:35:20,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-02-05 15:35:20,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718506994] [2025-02-05 15:35:20,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:20,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:20,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:20,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:20,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:35:20,145 INFO L87 Difference]: Start difference. First operand 490 states and 802 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:20,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:20,194 INFO L93 Difference]: Finished difference Result 937 states and 1559 transitions. [2025-02-05 15:35:20,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:20,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2025-02-05 15:35:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:20,202 INFO L225 Difference]: With dead ends: 937 [2025-02-05 15:35:20,202 INFO L226 Difference]: Without dead ends: 492 [2025-02-05 15:35:20,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:35:20,208 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 0 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:20,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2394 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:20,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-02-05 15:35:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2025-02-05 15:35:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 386 states have (on average 1.650259067357513) internal successors, (637), 405 states have internal predecessors, (637), 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-02-05 15:35:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 804 transitions. [2025-02-05 15:35:20,237 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 804 transitions. Word has length 104 [2025-02-05 15:35:20,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:20,238 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 804 transitions. [2025-02-05 15:35:20,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:35:20,238 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 804 transitions. [2025-02-05 15:35:20,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 15:35:20,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:20,245 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:35:20,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:35:20,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 15:35:20,446 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:20,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:20,446 INFO L85 PathProgramCache]: Analyzing trace with hash -2026509679, now seen corresponding path program 1 times [2025-02-05 15:35:20,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:20,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38840454] [2025-02-05 15:35:20,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:20,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:20,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:35:20,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:35:20,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:20,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:20,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:20,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38840454] [2025-02-05 15:35:20,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38840454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:20,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:20,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:35:20,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878145540] [2025-02-05 15:35:20,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:20,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:35:20,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:20,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:35:20,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:35:20,756 INFO L87 Difference]: Start difference. First operand 492 states and 804 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-05 15:35:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:23,557 INFO L93 Difference]: Finished difference Result 1667 states and 2802 transitions. [2025-02-05 15:35:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 15:35:23,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 107 [2025-02-05 15:35:23,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:23,567 INFO L225 Difference]: With dead ends: 1667 [2025-02-05 15:35:23,567 INFO L226 Difference]: Without dead ends: 1220 [2025-02-05 15:35:23,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:35:23,570 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 2280 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 3454 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2358 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 3921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 3454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:23,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2358 Valid, 1902 Invalid, 3921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 3454 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 15:35:23,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2025-02-05 15:35:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1109. [2025-02-05 15:35:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 875 states have (on average 1.68) internal successors, (1470), 914 states have internal predecessors, (1470), 189 states have call successors, (189), 39 states have call predecessors, (189), 44 states have return successors, (200), 181 states have call predecessors, (200), 184 states have call successors, (200) [2025-02-05 15:35:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1859 transitions. [2025-02-05 15:35:23,615 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1859 transitions. Word has length 107 [2025-02-05 15:35:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:23,616 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1859 transitions. [2025-02-05 15:35:23,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-05 15:35:23,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1859 transitions. [2025-02-05 15:35:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 15:35:23,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:23,619 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:23,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:35:23,620 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:23,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:23,620 INFO L85 PathProgramCache]: Analyzing trace with hash 233327493, now seen corresponding path program 1 times [2025-02-05 15:35:23,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:23,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201221100] [2025-02-05 15:35:23,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:23,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:23,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 15:35:23,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 15:35:23,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:23,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:23,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:23,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201221100] [2025-02-05 15:35:23,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201221100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:23,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:23,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:35:23,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571930091] [2025-02-05 15:35:23,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:23,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:35:23,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:23,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:35:23,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:35:23,719 INFO L87 Difference]: Start difference. First operand 1109 states and 1859 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:35:23,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:23,772 INFO L93 Difference]: Finished difference Result 2189 states and 3696 transitions. [2025-02-05 15:35:23,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:35:23,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-02-05 15:35:23,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:23,779 INFO L225 Difference]: With dead ends: 2189 [2025-02-05 15:35:23,779 INFO L226 Difference]: Without dead ends: 1125 [2025-02-05 15:35:23,782 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-02-05 15:35:23,783 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 0 mSDsluCounter, 2370 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3170 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-02-05 15:35:23,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3170 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:23,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-02-05 15:35:23,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1121. [2025-02-05 15:35:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 884 states have (on average 1.6730769230769231) internal successors, (1479), 923 states have internal predecessors, (1479), 189 states have call successors, (189), 39 states have call predecessors, (189), 47 states have return successors, (206), 184 states have call predecessors, (206), 184 states have call successors, (206) [2025-02-05 15:35:23,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1874 transitions. [2025-02-05 15:35:23,829 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1874 transitions. Word has length 112 [2025-02-05 15:35:23,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:23,829 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1874 transitions. [2025-02-05 15:35:23,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:35:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1874 transitions. [2025-02-05 15:35:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:35:23,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:23,832 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:35:23,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:35:23,832 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:23,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:23,832 INFO L85 PathProgramCache]: Analyzing trace with hash -300944661, now seen corresponding path program 1 times [2025-02-05 15:35:23,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:23,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10237069] [2025-02-05 15:35:23,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:23,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:23,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:35:23,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:35:23,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:23,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:23,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:23,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10237069] [2025-02-05 15:35:23,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10237069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:23,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:23,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:35:23,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923481456] [2025-02-05 15:35:23,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:23,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:35:23,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:23,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:35:23,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:35:23,996 INFO L87 Difference]: Start difference. First operand 1121 states and 1874 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 7 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-02-05 15:35:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:26,119 INFO L93 Difference]: Finished difference Result 3756 states and 6383 transitions. [2025-02-05 15:35:26,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:35:26,119 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 7 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 116 [2025-02-05 15:35:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:26,134 INFO L225 Difference]: With dead ends: 3756 [2025-02-05 15:35:26,135 INFO L226 Difference]: Without dead ends: 2680 [2025-02-05 15:35:26,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:35:26,140 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 4217 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 2703 mSolverCounterSat, 1031 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4359 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 3734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1031 IncrementalHoareTripleChecker+Valid, 2703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:26,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4359 Valid, 1548 Invalid, 3734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1031 Valid, 2703 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 15:35:26,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2025-02-05 15:35:26,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 2620. [2025-02-05 15:35:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2620 states, 2054 states have (on average 1.6577409931840312) internal successors, (3405), 2144 states have internal predecessors, (3405), 452 states have call successors, (452), 89 states have call predecessors, (452), 113 states have return successors, (541), 447 states have call predecessors, (541), 447 states have call successors, (541) [2025-02-05 15:35:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 4398 transitions. [2025-02-05 15:35:26,265 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 4398 transitions. Word has length 116 [2025-02-05 15:35:26,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:26,267 INFO L471 AbstractCegarLoop]: Abstraction has 2620 states and 4398 transitions. [2025-02-05 15:35:26,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 7 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-02-05 15:35:26,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 4398 transitions. [2025-02-05 15:35:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:35:26,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:26,270 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:26,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:35:26,271 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:26,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:26,271 INFO L85 PathProgramCache]: Analyzing trace with hash 273764920, now seen corresponding path program 1 times [2025-02-05 15:35:26,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:26,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718940556] [2025-02-05 15:35:26,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:26,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:26,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:35:26,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:35:26,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:26,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:26,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:26,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718940556] [2025-02-05 15:35:26,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718940556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:26,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:26,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:35:26,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334996330] [2025-02-05 15:35:26,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:26,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:35:26,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:26,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:35:26,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:35:26,440 INFO L87 Difference]: Start difference. First operand 2620 states and 4398 transitions. Second operand has 9 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 4 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-05 15:35:26,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:26,690 INFO L93 Difference]: Finished difference Result 5217 states and 8914 transitions. [2025-02-05 15:35:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:35:26,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 4 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 119 [2025-02-05 15:35:26,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:26,707 INFO L225 Difference]: With dead ends: 5217 [2025-02-05 15:35:26,707 INFO L226 Difference]: Without dead ends: 2668 [2025-02-05 15:35:26,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:35:26,742 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 242 mSDsluCounter, 5585 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 6423 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:26,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 6423 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2025-02-05 15:35:26,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2620. [2025-02-05 15:35:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2620 states, 2054 states have (on average 1.6353456669912365) internal successors, (3359), 2144 states have internal predecessors, (3359), 452 states have call successors, (452), 89 states have call predecessors, (452), 113 states have return successors, (541), 447 states have call predecessors, (541), 447 states have call successors, (541) [2025-02-05 15:35:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 4352 transitions. [2025-02-05 15:35:26,843 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 4352 transitions. Word has length 119 [2025-02-05 15:35:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:26,843 INFO L471 AbstractCegarLoop]: Abstraction has 2620 states and 4352 transitions. [2025-02-05 15:35:26,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 4 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-05 15:35:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 4352 transitions. [2025-02-05 15:35:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:35:26,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:26,846 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:35:26,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:35:26,847 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:26,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:26,849 INFO L85 PathProgramCache]: Analyzing trace with hash -461990012, now seen corresponding path program 1 times [2025-02-05 15:35:26,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:26,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113742860] [2025-02-05 15:35:26,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:26,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:26,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:35:26,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:35:26,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:26,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:27,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 15:35:27,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:27,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113742860] [2025-02-05 15:35:27,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113742860] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:35:27,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802708583] [2025-02-05 15:35:27,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:27,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:27,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:27,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:35:27,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:35:27,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:35:27,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:35:27,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:27,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:27,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:35:27,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:35:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:35:27,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:35:27,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802708583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:27,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:35:27,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-02-05 15:35:27,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976060586] [2025-02-05 15:35:27,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:27,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:27,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:27,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:27,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:35:27,303 INFO L87 Difference]: Start difference. First operand 2620 states and 4352 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:35:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:27,427 INFO L93 Difference]: Finished difference Result 5244 states and 8852 transitions. [2025-02-05 15:35:27,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:35:27,428 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), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2025-02-05 15:35:27,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:27,443 INFO L225 Difference]: With dead ends: 5244 [2025-02-05 15:35:27,444 INFO L226 Difference]: Without dead ends: 2668 [2025-02-05 15:35:27,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:35:27,454 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 14 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:27,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2300 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:27,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2025-02-05 15:35:27,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2668. [2025-02-05 15:35:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2096 states have (on average 1.6364503816793894) internal successors, (3430), 2186 states have internal predecessors, (3430), 452 states have call successors, (452), 95 states have call predecessors, (452), 119 states have return successors, (546), 447 states have call predecessors, (546), 447 states have call successors, (546) [2025-02-05 15:35:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 4428 transitions. [2025-02-05 15:35:27,538 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 4428 transitions. Word has length 123 [2025-02-05 15:35:27,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:27,539 INFO L471 AbstractCegarLoop]: Abstraction has 2668 states and 4428 transitions. [2025-02-05 15:35:27,539 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), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:35:27,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 4428 transitions. [2025-02-05 15:35:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:35:27,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:27,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-05 15:35:27,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:35:27,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:27,747 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:27,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:27,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1218047505, now seen corresponding path program 1 times [2025-02-05 15:35:27,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:27,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180011262] [2025-02-05 15:35:27,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:27,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:27,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:35:27,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:35:27,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:27,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:35:27,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:27,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180011262] [2025-02-05 15:35:27,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180011262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:27,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:27,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:35:27,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930906026] [2025-02-05 15:35:27,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:27,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:35:27,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:27,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:35:27,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:35:27,928 INFO L87 Difference]: Start difference. First operand 2668 states and 4428 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:35:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:29,819 INFO L93 Difference]: Finished difference Result 5264 states and 8759 transitions. [2025-02-05 15:35:29,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:35:29,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2025-02-05 15:35:29,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:29,837 INFO L225 Difference]: With dead ends: 5264 [2025-02-05 15:35:29,837 INFO L226 Difference]: Without dead ends: 3018 [2025-02-05 15:35:29,848 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-02-05 15:35:29,849 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1956 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2968 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2030 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 3401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 2968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:29,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2030 Valid, 1676 Invalid, 3401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 2968 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 15:35:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2025-02-05 15:35:29,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 2775. [2025-02-05 15:35:29,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2775 states, 2176 states have (on average 1.6245404411764706) internal successors, (3535), 2274 states have internal predecessors, (3535), 462 states have call successors, (462), 104 states have call predecessors, (462), 136 states have return successors, (578), 457 states have call predecessors, (578), 457 states have call successors, (578) [2025-02-05 15:35:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 4575 transitions. [2025-02-05 15:35:30,001 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 4575 transitions. Word has length 124 [2025-02-05 15:35:30,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:30,002 INFO L471 AbstractCegarLoop]: Abstraction has 2775 states and 4575 transitions. [2025-02-05 15:35:30,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:35:30,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 4575 transitions. [2025-02-05 15:35:30,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:35:30,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:30,005 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-02-05 15:35:30,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 15:35:30,005 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:30,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:30,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2045328254, now seen corresponding path program 1 times [2025-02-05 15:35:30,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:30,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127097980] [2025-02-05 15:35:30,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:30,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:30,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:35:30,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:35:30,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:30,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:35:30,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:30,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127097980] [2025-02-05 15:35:30,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127097980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:30,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:30,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:35:30,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453196331] [2025-02-05 15:35:30,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:30,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:35:30,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:30,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:35:30,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:35:30,143 INFO L87 Difference]: Start difference. First operand 2775 states and 4575 transitions. Second operand has 8 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:35:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:30,305 INFO L93 Difference]: Finished difference Result 5927 states and 9837 transitions. [2025-02-05 15:35:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:35:30,305 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 129 [2025-02-05 15:35:30,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:30,328 INFO L225 Difference]: With dead ends: 5927 [2025-02-05 15:35:30,328 INFO L226 Difference]: Without dead ends: 3574 [2025-02-05 15:35:30,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:35:30,336 INFO L435 NwaCegarLoop]: 1285 mSDtfsCounter, 750 mSDsluCounter, 7146 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 8431 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:30,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 8431 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:30,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2025-02-05 15:35:30,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 3338. [2025-02-05 15:35:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3338 states, 2627 states have (on average 1.629996193376475) internal successors, (4282), 2736 states have internal predecessors, (4282), 552 states have call successors, (552), 124 states have call predecessors, (552), 158 states have return successors, (678), 550 states have call predecessors, (678), 547 states have call successors, (678) [2025-02-05 15:35:30,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3338 states to 3338 states and 5512 transitions. [2025-02-05 15:35:30,485 INFO L78 Accepts]: Start accepts. Automaton has 3338 states and 5512 transitions. Word has length 129 [2025-02-05 15:35:30,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:30,486 INFO L471 AbstractCegarLoop]: Abstraction has 3338 states and 5512 transitions. [2025-02-05 15:35:30,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:35:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 5512 transitions. [2025-02-05 15:35:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 15:35:30,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:30,488 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-02-05 15:35:30,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 15:35:30,489 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:30,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:30,489 INFO L85 PathProgramCache]: Analyzing trace with hash 992460367, now seen corresponding path program 1 times [2025-02-05 15:35:30,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:30,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252997178] [2025-02-05 15:35:30,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:30,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:30,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:35:30,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:35:30,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:30,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:35:30,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:30,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252997178] [2025-02-05 15:35:30,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252997178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:30,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:30,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 15:35:30,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543634483] [2025-02-05 15:35:30,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:30,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 15:35:30,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:30,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 15:35:30,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:35:30,696 INFO L87 Difference]: Start difference. First operand 3338 states and 5512 transitions. Second operand has 13 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 7 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-05 15:35:34,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:34,148 INFO L93 Difference]: Finished difference Result 7447 states and 12262 transitions. [2025-02-05 15:35:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 15:35:34,148 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 7 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 131 [2025-02-05 15:35:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:34,169 INFO L225 Difference]: With dead ends: 7447 [2025-02-05 15:35:34,169 INFO L226 Difference]: Without dead ends: 4464 [2025-02-05 15:35:34,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2025-02-05 15:35:34,180 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 2676 mSDsluCounter, 4613 mSDsCounter, 0 mSdLazyCounter, 8154 mSolverCounterSat, 609 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2759 SdHoareTripleChecker+Valid, 5167 SdHoareTripleChecker+Invalid, 8763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 609 IncrementalHoareTripleChecker+Valid, 8154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:34,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2759 Valid, 5167 Invalid, 8763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [609 Valid, 8154 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 15:35:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4464 states. [2025-02-05 15:35:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4464 to 3941. [2025-02-05 15:35:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3941 states, 3103 states have (on average 1.6100547856912666) internal successors, (4996), 3236 states have internal predecessors, (4996), 628 states have call successors, (628), 155 states have call predecessors, (628), 209 states have return successors, (791), 622 states have call predecessors, (791), 623 states have call successors, (791) [2025-02-05 15:35:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 6415 transitions. [2025-02-05 15:35:34,351 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 6415 transitions. Word has length 131 [2025-02-05 15:35:34,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:34,351 INFO L471 AbstractCegarLoop]: Abstraction has 3941 states and 6415 transitions. [2025-02-05 15:35:34,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 7 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-05 15:35:34,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 6415 transitions. [2025-02-05 15:35:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:35:34,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:34,355 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-02-05 15:35:34,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 15:35:34,355 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:34,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1122644671, now seen corresponding path program 1 times [2025-02-05 15:35:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:34,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350477063] [2025-02-05 15:35:34,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:34,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:34,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:35:34,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:35:34,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:34,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:35:34,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:34,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350477063] [2025-02-05 15:35:34,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350477063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:34,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:34,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:35:34,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162188024] [2025-02-05 15:35:34,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:34,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:35:34,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:34,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:35:34,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:35:34,521 INFO L87 Difference]: Start difference. First operand 3941 states and 6415 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-02-05 15:35:35,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:35,712 INFO L93 Difference]: Finished difference Result 7892 states and 12940 transitions. [2025-02-05 15:35:35,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:35:35,713 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-02-05 15:35:35,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:35,756 INFO L225 Difference]: With dead ends: 7892 [2025-02-05 15:35:35,757 INFO L226 Difference]: Without dead ends: 3999 [2025-02-05 15:35:35,780 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-02-05 15:35:35,780 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 1191 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 2464 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 2464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:35,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 1574 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 2464 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 15:35:35,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2025-02-05 15:35:35,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3965. [2025-02-05 15:35:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 3121 states have (on average 1.606536366549183) internal successors, (5014), 3254 states have internal predecessors, (5014), 628 states have call successors, (628), 155 states have call predecessors, (628), 215 states have return successors, (801), 628 states have call predecessors, (801), 623 states have call successors, (801) [2025-02-05 15:35:36,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 6443 transitions. [2025-02-05 15:35:36,016 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 6443 transitions. Word has length 129 [2025-02-05 15:35:36,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:36,017 INFO L471 AbstractCegarLoop]: Abstraction has 3965 states and 6443 transitions. [2025-02-05 15:35:36,017 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-02-05 15:35:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 6443 transitions. [2025-02-05 15:35:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:35:36,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:36,021 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:36,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 15:35:36,021 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:36,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:36,021 INFO L85 PathProgramCache]: Analyzing trace with hash -360968389, now seen corresponding path program 1 times [2025-02-05 15:35:36,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:36,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765812495] [2025-02-05 15:35:36,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:36,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:36,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:35:36,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:35:36,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:36,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 15:35:36,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:36,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765812495] [2025-02-05 15:35:36,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765812495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:36,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:36,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:36,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773073880] [2025-02-05 15:35:36,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:36,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:36,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:36,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:36,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:36,091 INFO L87 Difference]: Start difference. First operand 3965 states and 6443 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-05 15:35:36,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:36,277 INFO L93 Difference]: Finished difference Result 7902 states and 12922 transitions. [2025-02-05 15:35:36,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:35:36,277 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), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2025-02-05 15:35:36,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:36,294 INFO L225 Difference]: With dead ends: 7902 [2025-02-05 15:35:36,294 INFO L226 Difference]: Without dead ends: 3913 [2025-02-05 15:35:36,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:35:36,303 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 12 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:36,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2275 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:36,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3913 states. [2025-02-05 15:35:36,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3913 to 3913. [2025-02-05 15:35:36,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3913 states, 3075 states have (on average 1.5960975609756098) internal successors, (4908), 3202 states have internal predecessors, (4908), 628 states have call successors, (628), 161 states have call predecessors, (628), 209 states have return successors, (791), 622 states have call predecessors, (791), 623 states have call successors, (791) [2025-02-05 15:35:36,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 6327 transitions. [2025-02-05 15:35:36,417 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 6327 transitions. Word has length 132 [2025-02-05 15:35:36,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:36,417 INFO L471 AbstractCegarLoop]: Abstraction has 3913 states and 6327 transitions. [2025-02-05 15:35:36,418 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), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-05 15:35:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 6327 transitions. [2025-02-05 15:35:36,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:35:36,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:36,420 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, 1] [2025-02-05 15:35:36,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 15:35:36,420 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:36,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:36,422 INFO L85 PathProgramCache]: Analyzing trace with hash 173681308, now seen corresponding path program 1 times [2025-02-05 15:35:36,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:36,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170849033] [2025-02-05 15:35:36,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:36,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:36,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:35:36,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:35:36,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:36,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:36,508 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:35:36,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:36,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170849033] [2025-02-05 15:35:36,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170849033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:36,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:36,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:35:36,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851808301] [2025-02-05 15:35:36,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:36,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:35:36,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:36,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:35:36,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:35:36,511 INFO L87 Difference]: Start difference. First operand 3913 states and 6327 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:35:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:38,152 INFO L93 Difference]: Finished difference Result 13985 states and 23104 transitions. [2025-02-05 15:35:38,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:38,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 132 [2025-02-05 15:35:38,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:38,204 INFO L225 Difference]: With dead ends: 13985 [2025-02-05 15:35:38,205 INFO L226 Difference]: Without dead ends: 10120 [2025-02-05 15:35:38,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:35:38,221 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 2102 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 2120 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2195 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 2592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 2120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:38,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2195 Valid, 1332 Invalid, 2592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 2120 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 15:35:38,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10120 states. [2025-02-05 15:35:38,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10120 to 9818. [2025-02-05 15:35:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9818 states, 7499 states have (on average 1.5872783037738365) internal successors, (11903), 7882 states have internal predecessors, (11903), 1823 states have call successors, (1823), 357 states have call predecessors, (1823), 495 states have return successors, (2471), 1820 states have call predecessors, (2471), 1818 states have call successors, (2471) [2025-02-05 15:35:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9818 states to 9818 states and 16197 transitions. [2025-02-05 15:35:38,799 INFO L78 Accepts]: Start accepts. Automaton has 9818 states and 16197 transitions. Word has length 132 [2025-02-05 15:35:38,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:38,800 INFO L471 AbstractCegarLoop]: Abstraction has 9818 states and 16197 transitions. [2025-02-05 15:35:38,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:35:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 9818 states and 16197 transitions. [2025-02-05 15:35:38,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 15:35:38,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:38,804 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] [2025-02-05 15:35:38,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 15:35:38,805 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:38,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:38,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2020082816, now seen corresponding path program 1 times [2025-02-05 15:35:38,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:38,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821328267] [2025-02-05 15:35:38,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:38,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:38,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:35:38,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:35:38,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:38,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:35:38,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:38,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821328267] [2025-02-05 15:35:38,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821328267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:38,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:38,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:38,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591095206] [2025-02-05 15:35:38,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:38,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:38,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:38,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:38,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:38,919 INFO L87 Difference]: Start difference. First operand 9818 states and 16197 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-02-05 15:35:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:40,861 INFO L93 Difference]: Finished difference Result 32076 states and 54668 transitions. [2025-02-05 15:35:40,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:35:40,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 140 [2025-02-05 15:35:40,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:40,998 INFO L225 Difference]: With dead ends: 32076 [2025-02-05 15:35:40,998 INFO L226 Difference]: Without dead ends: 22303 [2025-02-05 15:35:41,044 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-02-05 15:35:41,045 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 1770 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1838 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:41,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1838 Valid, 919 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 15:35:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22303 states. [2025-02-05 15:35:42,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22303 to 21471. [2025-02-05 15:35:42,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21471 states, 16074 states have (on average 1.580689311932313) internal successors, (25408), 17001 states have internal predecessors, (25408), 4341 states have call successors, (4341), 709 states have call predecessors, (4341), 1055 states have return successors, (6856), 4364 states have call predecessors, (6856), 4336 states have call successors, (6856) [2025-02-05 15:35:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21471 states to 21471 states and 36605 transitions. [2025-02-05 15:35:42,347 INFO L78 Accepts]: Start accepts. Automaton has 21471 states and 36605 transitions. Word has length 140 [2025-02-05 15:35:42,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:42,348 INFO L471 AbstractCegarLoop]: Abstraction has 21471 states and 36605 transitions. [2025-02-05 15:35:42,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-02-05 15:35:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 21471 states and 36605 transitions. [2025-02-05 15:35:42,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:35:42,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:42,353 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-02-05 15:35:42,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 15:35:42,354 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:42,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:42,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1261158604, now seen corresponding path program 1 times [2025-02-05 15:35:42,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:42,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156683026] [2025-02-05 15:35:42,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:42,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:42,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:35:42,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:35:42,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:42,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:35:42,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:42,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156683026] [2025-02-05 15:35:42,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156683026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:42,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:42,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:42,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850694166] [2025-02-05 15:35:42,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:42,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:42,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:42,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:42,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:42,485 INFO L87 Difference]: Start difference. First operand 21471 states and 36605 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-02-05 15:35:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:45,955 INFO L93 Difference]: Finished difference Result 71512 states and 128092 transitions. [2025-02-05 15:35:45,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:35:45,956 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-02-05 15:35:45,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:46,264 INFO L225 Difference]: With dead ends: 71512 [2025-02-05 15:35:46,264 INFO L226 Difference]: Without dead ends: 50086 [2025-02-05 15:35:46,357 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-02-05 15:35:46,357 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 1778 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1847 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:46,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1847 Valid, 877 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 15:35:46,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50086 states. [2025-02-05 15:35:49,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50086 to 48231. [2025-02-05 15:35:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48231 states, 35281 states have (on average 1.572801224455089) internal successors, (55490), 37556 states have internal predecessors, (55490), 10682 states have call successors, (10682), 1413 states have call predecessors, (10682), 2267 states have return successors, (20103), 10805 states have call predecessors, (20103), 10677 states have call successors, (20103) [2025-02-05 15:35:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48231 states to 48231 states and 86275 transitions. [2025-02-05 15:35:49,475 INFO L78 Accepts]: Start accepts. Automaton has 48231 states and 86275 transitions. Word has length 139 [2025-02-05 15:35:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:49,477 INFO L471 AbstractCegarLoop]: Abstraction has 48231 states and 86275 transitions. [2025-02-05 15:35:49,477 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-02-05 15:35:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 48231 states and 86275 transitions. [2025-02-05 15:35:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 15:35:49,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:49,483 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-02-05 15:35:49,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 15:35:49,484 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:49,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:49,484 INFO L85 PathProgramCache]: Analyzing trace with hash 20408602, now seen corresponding path program 1 times [2025-02-05 15:35:49,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:49,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418615236] [2025-02-05 15:35:49,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:49,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:49,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:35:49,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:35:49,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:49,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:49,575 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:35:49,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:49,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418615236] [2025-02-05 15:35:49,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418615236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:49,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:49,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:49,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438846943] [2025-02-05 15:35:49,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:49,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:49,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:49,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:49,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:49,577 INFO L87 Difference]: Start difference. First operand 48231 states and 86275 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-02-05 15:35:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:57,569 INFO L93 Difference]: Finished difference Result 163624 states and 314759 transitions. [2025-02-05 15:35:57,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:35:57,569 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-02-05 15:35:57,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:58,732 INFO L225 Difference]: With dead ends: 163624 [2025-02-05 15:35:58,732 INFO L226 Difference]: Without dead ends: 115438 [2025-02-05 15:35:59,133 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-02-05 15:35:59,133 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 1760 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1826 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:59,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1826 Valid, 880 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 15:35:59,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115438 states.