./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product19.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product19.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d96f41c83679efe744540e7fde7918287d6cc79be28bb1ad9b63bf8e0d07ce19 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:15:48,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:15:48,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:15:48,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:15:48,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:15:48,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:15:48,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:15:48,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:15:48,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:15:48,891 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:15:48,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:15:48,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:15:48,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:15:48,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:15:48,891 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:15:48,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:15:48,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:15:48,891 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:15:48,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:15:48,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:15:48,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:15:48,892 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:15:48,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:15:48,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:15:48,892 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:15:48,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:15:48,892 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:15:48,892 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:15:48,892 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:15:48,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:15:48,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:15:48,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:15:48,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:15:48,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:15:48,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:15:48,892 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:15:48,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:15:48,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:15:48,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:15:48,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:15:48,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:15:48,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:15:48,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:15:48,893 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/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 -> d96f41c83679efe744540e7fde7918287d6cc79be28bb1ad9b63bf8e0d07ce19 [2025-03-03 14:15:49,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:15:49,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:15:49,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:15:49,141 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:15:49,141 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:15:49,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product19.cil.c [2025-03-03 14:15:50,286 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7615ca873/442a6a885b5b49839dfb770c4a3eb2a1/FLAG474cea9c8 [2025-03-03 14:15:50,599 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:15:50,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product19.cil.c [2025-03-03 14:15:50,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7615ca873/442a6a885b5b49839dfb770c4a3eb2a1/FLAG474cea9c8 [2025-03-03 14:15:50,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7615ca873/442a6a885b5b49839dfb770c4a3eb2a1 [2025-03-03 14:15:50,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:15:50,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:15:50,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:15:50,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:15:50,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:15:50,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:15:50" (1/1) ... [2025-03-03 14:15:50,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15f8cb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:50, skipping insertion in model container [2025-03-03 14:15:50,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:15:50" (1/1) ... [2025-03-03 14:15:50,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:15:51,228 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product19.cil.c[34453,34466] [2025-03-03 14:15:51,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:15:51,384 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:15:51,391 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [48] [2025-03-03 14:15:51,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1596] [2025-03-03 14:15:51,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1605] [2025-03-03 14:15:51,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2267] [2025-03-03 14:15:51,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [2281] [2025-03-03 14:15:51,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2462] [2025-03-03 14:15:51,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2581] [2025-03-03 14:15:51,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2673] [2025-03-03 14:15:51,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3026] [2025-03-03 14:15:51,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3392] [2025-03-03 14:15:51,430 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product19.cil.c[34453,34466] [2025-03-03 14:15:51,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:15:51,507 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:15:51,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:51 WrapperNode [2025-03-03 14:15:51,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:15:51,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:15:51,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:15:51,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:15:51,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:51" (1/1) ... [2025-03-03 14:15:51,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:51" (1/1) ... [2025-03-03 14:15:51,576 INFO L138 Inliner]: procedures = 94, calls = 340, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 1115 [2025-03-03 14:15:51,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:15:51,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:15:51,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:15:51,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:15:51,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:51" (1/1) ... [2025-03-03 14:15:51,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:51" (1/1) ... [2025-03-03 14:15:51,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:51" (1/1) ... [2025-03-03 14:15:51,614 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-03-03 14:15:51,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:51" (1/1) ... [2025-03-03 14:15:51,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:51" (1/1) ... [2025-03-03 14:15:51,627 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:51" (1/1) ... [2025-03-03 14:15:51,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:51" (1/1) ... [2025-03-03 14:15:51,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:51" (1/1) ... [2025-03-03 14:15:51,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:51" (1/1) ... [2025-03-03 14:15:51,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:15:51,642 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:15:51,643 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:15:51,643 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:15:51,643 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:51" (1/1) ... [2025-03-03 14:15:51,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:15:51,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:15:51,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:15:51,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:15:51,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:15:51,701 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:15:51,701 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:15:51,701 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-03 14:15:51,701 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-03 14:15:51,701 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2025-03-03 14:15:51,701 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2025-03-03 14:15:51,701 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:15:51,701 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:15:51,701 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-03 14:15:51,701 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-03 14:15:51,701 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:15:51,701 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:15:51,702 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:15:51,702 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:15:51,702 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:15:51,702 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:15:51,702 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:15:51,702 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:15:51,702 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-03 14:15:51,703 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-03 14:15:51,703 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:15:51,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:15:51,703 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:15:51,703 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:15:51,704 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:15:51,704 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:15:51,704 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:15:51,704 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:15:51,704 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-03 14:15:51,704 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-03 14:15:51,704 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:15:51,704 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:15:51,704 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:15:51,704 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:15:51,704 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:15:51,706 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:15:51,706 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:15:51,706 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:15:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:15:51,707 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:15:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:15:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:15:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:15:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:15:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:15:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:15:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:15:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:15:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:15:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:15:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:15:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:15:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:15:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:15:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:15:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:15:51,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:15:51,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:15:51,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:15:51,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:15:51,708 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:15:51,708 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:15:51,708 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:15:51,708 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:15:51,708 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:15:51,708 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:15:51,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:15:51,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:15:51,708 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:15:51,708 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:15:51,882 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:15:51,886 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:15:51,932 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2578: #res := ~retValue_acc~22; [2025-03-03 14:15:51,951 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2500: #res := ~retValue_acc~20; [2025-03-03 14:15:51,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~0; [2025-03-03 14:15:51,970 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L299: #res := ~retValue_acc~1; [2025-03-03 14:15:52,021 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: #res#1 := ~retValue_acc~11#1; [2025-03-03 14:15:52,021 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L342-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~3#1; [2025-03-03 14:15:52,053 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1584: #res := ~retValue_acc~15; [2025-03-03 14:15:52,354 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L865: #res#1 := ~retValue_acc~9#1; [2025-03-03 14:15:52,355 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L836-1: stopRequestedInDirection__wrappee__weight_#res#1 := stopRequestedInDirection__wrappee__weight_~retValue_acc~8#1; [2025-03-03 14:15:52,412 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000: #res := ~retValue_acc~13; [2025-03-03 14:15:52,423 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2539: #res := ~retValue_acc~21; [2025-03-03 14:15:52,544 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L471-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~6#1; [2025-03-03 14:15:52,544 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L484-1: isIdle_#res#1 := isIdle_~retValue_acc~7#1; [2025-03-03 14:15:52,683 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~12#1; [2025-03-03 14:15:52,734 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1953: #res := ~retValue_acc~18; [2025-03-03 14:15:52,793 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3023-1: main_#res#1 := main_~retValue_acc~24#1; [2025-03-03 14:15:52,793 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3424-1: valid_product_#res#1 := valid_product_~retValue_acc~29#1; [2025-03-03 14:15:52,803 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1717: #res := ~retValue_acc~17; [2025-03-03 14:15:52,805 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: #res := ~retValue_acc~2; [2025-03-03 14:15:52,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2264: #res := ~retValue_acc~19; [2025-03-03 14:15:52,981 INFO L? ?]: Removed 449 outVars from TransFormulas that were not future-live. [2025-03-03 14:15:52,982 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:15:53,001 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:15:53,002 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:15:53,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:15:53 BoogieIcfgContainer [2025-03-03 14:15:53,002 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:15:53,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:15:53,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:15:53,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:15:53,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:15:50" (1/3) ... [2025-03-03 14:15:53,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205c83a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:15:53, skipping insertion in model container [2025-03-03 14:15:53,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:51" (2/3) ... [2025-03-03 14:15:53,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205c83a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:15:53, skipping insertion in model container [2025-03-03 14:15:53,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:15:53" (3/3) ... [2025-03-03 14:15:53,011 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product19.cil.c [2025-03-03 14:15:53,025 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:15:53,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product19.cil.c that has 25 procedures, 559 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:15:53,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:15:53,120 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;@62669217, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:15:53,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:15:53,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 559 states, 437 states have (on average 1.688787185354691) internal successors, (738), 458 states have internal predecessors, (738), 96 states have call successors, (96), 24 states have call predecessors, (96), 24 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-03 14:15:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:15:53,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:53,161 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:53,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:53,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:53,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1213586472, now seen corresponding path program 1 times [2025-03-03 14:15:53,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:53,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065306653] [2025-03-03 14:15:53,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:53,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:53,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:15:53,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:15:53,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:53,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:53,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:53,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065306653] [2025-03-03 14:15:53,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065306653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:53,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:53,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:53,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614749761] [2025-03-03 14:15:53,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:53,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:53,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:53,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:53,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:53,690 INFO L87 Difference]: Start difference. First operand has 559 states, 437 states have (on average 1.688787185354691) internal successors, (738), 458 states have internal predecessors, (738), 96 states have call successors, (96), 24 states have call predecessors, (96), 24 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (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-03-03 14:15:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:53,848 INFO L93 Difference]: Finished difference Result 1098 states and 1835 transitions. [2025-03-03 14:15:53,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:53,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (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 102 [2025-03-03 14:15:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:53,870 INFO L225 Difference]: With dead ends: 1098 [2025-03-03 14:15:53,870 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 14:15:53,876 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-03-03 14:15:53,879 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 5 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2726 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-03-03 14:15:53,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2726 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 14:15:53,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-03 14:15:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 431 states have (on average 1.6867749419953597) internal successors, (727), 450 states have internal predecessors, (727), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:15:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 914 transitions. [2025-03-03 14:15:53,966 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 914 transitions. Word has length 102 [2025-03-03 14:15:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:53,967 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 914 transitions. [2025-03-03 14:15:53,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (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-03-03 14:15:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 914 transitions. [2025-03-03 14:15:53,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:15:53,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:53,975 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:53,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:15:53,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:53,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:53,976 INFO L85 PathProgramCache]: Analyzing trace with hash 660994759, now seen corresponding path program 1 times [2025-03-03 14:15:53,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:53,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276213958] [2025-03-03 14:15:53,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:54,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:15:54,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:15:54,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:54,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:54,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:54,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276213958] [2025-03-03 14:15:54,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276213958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:54,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:54,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:54,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344615853] [2025-03-03 14:15:54,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:54,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:54,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:54,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:54,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:54,198 INFO L87 Difference]: Start difference. First operand 551 states and 914 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, (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-03-03 14:15:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:54,276 INFO L93 Difference]: Finished difference Result 1084 states and 1805 transitions. [2025-03-03 14:15:54,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:54,277 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, (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 105 [2025-03-03 14:15:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:54,282 INFO L225 Difference]: With dead ends: 1084 [2025-03-03 14:15:54,282 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 14:15:54,284 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-03-03 14:15:54,285 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 4 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2705 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-03-03 14:15:54,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2705 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:54,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 14:15:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-03 14:15:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 431 states have (on average 1.6844547563805103) internal successors, (726), 450 states have internal predecessors, (726), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:15:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 913 transitions. [2025-03-03 14:15:54,321 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 913 transitions. Word has length 105 [2025-03-03 14:15:54,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:54,322 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 913 transitions. [2025-03-03 14:15:54,322 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, (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-03-03 14:15:54,322 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 913 transitions. [2025-03-03 14:15:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 14:15:54,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:54,326 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:54,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:15:54,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:54,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:54,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1971115278, now seen corresponding path program 1 times [2025-03-03 14:15:54,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:54,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169582008] [2025-03-03 14:15:54,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:54,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:54,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 14:15:54,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 14:15:54,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:54,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:54,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:54,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169582008] [2025-03-03 14:15:54,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169582008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:54,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:54,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:54,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534976633] [2025-03-03 14:15:54,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:54,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:54,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:54,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:54,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:54,509 INFO L87 Difference]: Start difference. First operand 551 states and 913 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, (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-03-03 14:15:54,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:54,560 INFO L93 Difference]: Finished difference Result 1084 states and 1804 transitions. [2025-03-03 14:15:54,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:54,561 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, (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 106 [2025-03-03 14:15:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:54,564 INFO L225 Difference]: With dead ends: 1084 [2025-03-03 14:15:54,565 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 14:15:54,567 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-03-03 14:15:54,569 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 3 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2705 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-03-03 14:15:54,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2705 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:54,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 14:15:54,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-03 14:15:54,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 431 states have (on average 1.6821345707656612) internal successors, (725), 450 states have internal predecessors, (725), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:15:54,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 912 transitions. [2025-03-03 14:15:54,593 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 912 transitions. Word has length 106 [2025-03-03 14:15:54,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:54,593 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 912 transitions. [2025-03-03 14:15:54,593 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, (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-03-03 14:15:54,594 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 912 transitions. [2025-03-03 14:15:54,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 14:15:54,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:54,597 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:54,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:15:54,597 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:54,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:54,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1092888956, now seen corresponding path program 1 times [2025-03-03 14:15:54,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:54,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243078141] [2025-03-03 14:15:54,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:54,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:54,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:15:54,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:15:54,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:54,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:54,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:54,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243078141] [2025-03-03 14:15:54,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243078141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:54,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:54,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:54,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480125641] [2025-03-03 14:15:54,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:54,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:54,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:54,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:54,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:54,779 INFO L87 Difference]: Start difference. First operand 551 states and 912 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, (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-03-03 14:15:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:54,827 INFO L93 Difference]: Finished difference Result 1084 states and 1803 transitions. [2025-03-03 14:15:54,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:54,827 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, (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 107 [2025-03-03 14:15:54,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:54,832 INFO L225 Difference]: With dead ends: 1084 [2025-03-03 14:15:54,832 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 14:15:54,839 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-03-03 14:15:54,841 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 2 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2705 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-03-03 14:15:54,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2705 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 14:15:54,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-03 14:15:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 431 states have (on average 1.679814385150812) internal successors, (724), 450 states have internal predecessors, (724), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:15:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 911 transitions. [2025-03-03 14:15:54,872 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 911 transitions. Word has length 107 [2025-03-03 14:15:54,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:54,872 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 911 transitions. [2025-03-03 14:15:54,873 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, (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-03-03 14:15:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 911 transitions. [2025-03-03 14:15:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:15:54,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:54,877 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:54,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:15:54,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:54,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:54,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1231582095, now seen corresponding path program 1 times [2025-03-03 14:15:54,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:54,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915019733] [2025-03-03 14:15:54,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:54,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:54,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:15:54,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:15:54,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:54,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:55,006 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:55,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:55,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915019733] [2025-03-03 14:15:55,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915019733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:55,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:55,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:55,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635664360] [2025-03-03 14:15:55,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:55,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:55,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:55,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:55,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:55,007 INFO L87 Difference]: Start difference. First operand 551 states and 911 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, (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-03-03 14:15:55,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:55,049 INFO L93 Difference]: Finished difference Result 1084 states and 1802 transitions. [2025-03-03 14:15:55,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:55,049 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, (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 108 [2025-03-03 14:15:55,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:55,054 INFO L225 Difference]: With dead ends: 1084 [2025-03-03 14:15:55,054 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 14:15:55,056 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-03-03 14:15:55,057 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 1 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2705 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-03-03 14:15:55,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2705 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:55,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 14:15:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-03 14:15:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 431 states have (on average 1.677494199535963) internal successors, (723), 450 states have internal predecessors, (723), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:15:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 910 transitions. [2025-03-03 14:15:55,080 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 910 transitions. Word has length 108 [2025-03-03 14:15:55,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:55,080 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 910 transitions. [2025-03-03 14:15:55,080 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, (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-03-03 14:15:55,080 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 910 transitions. [2025-03-03 14:15:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:15:55,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:55,083 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:55,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:15:55,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:55,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1144999489, now seen corresponding path program 1 times [2025-03-03 14:15:55,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:55,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053377087] [2025-03-03 14:15:55,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:55,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:55,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:15:55,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:15:55,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:55,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:55,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:55,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053377087] [2025-03-03 14:15:55,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053377087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:55,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:55,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:15:55,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334483888] [2025-03-03 14:15:55,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:55,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:15:55,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:55,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:15:55,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:55,305 INFO L87 Difference]: Start difference. First operand 551 states and 910 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:15:55,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:55,396 INFO L93 Difference]: Finished difference Result 1050 states and 1734 transitions. [2025-03-03 14:15:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:15:55,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-03-03 14:15:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:55,401 INFO L225 Difference]: With dead ends: 1050 [2025-03-03 14:15:55,401 INFO L226 Difference]: Without dead ends: 566 [2025-03-03 14:15:55,404 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-03-03 14:15:55,405 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 91 mSDsluCounter, 4419 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5319 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-03-03 14:15:55,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5319 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-03 14:15:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 564. [2025-03-03 14:15:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 441 states have (on average 1.6734693877551021) internal successors, (738), 462 states have internal predecessors, (738), 97 states have call successors, (97), 24 states have call predecessors, (97), 25 states have return successors, (94), 90 states have call predecessors, (94), 92 states have call successors, (94) [2025-03-03 14:15:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 929 transitions. [2025-03-03 14:15:55,428 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 929 transitions. Word has length 109 [2025-03-03 14:15:55,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:55,429 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 929 transitions. [2025-03-03 14:15:55,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:15:55,429 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 929 transitions. [2025-03-03 14:15:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:15:55,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:55,435 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:55,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:15:55,435 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:55,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:55,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1130749344, now seen corresponding path program 1 times [2025-03-03 14:15:55,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:55,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613701212] [2025-03-03 14:15:55,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:55,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:55,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:15:55,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:15:55,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:55,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:55,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:55,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613701212] [2025-03-03 14:15:55,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613701212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:55,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:55,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:55,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061856507] [2025-03-03 14:15:55,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:55,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:55,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:55,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:55,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:55,529 INFO L87 Difference]: Start difference. First operand 564 states and 929 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (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-03-03 14:15:55,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:55,561 INFO L93 Difference]: Finished difference Result 1102 states and 1828 transitions. [2025-03-03 14:15:55,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:55,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (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 109 [2025-03-03 14:15:55,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:55,565 INFO L225 Difference]: With dead ends: 1102 [2025-03-03 14:15:55,566 INFO L226 Difference]: Without dead ends: 545 [2025-03-03 14:15:55,567 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-03-03 14:15:55,568 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 0 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2707 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-03-03 14:15:55,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2707 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:55,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-03 14:15:55,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-03 14:15:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 425 states have (on average 1.668235294117647) internal successors, (709), 444 states have internal predecessors, (709), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:15:55,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 896 transitions. [2025-03-03 14:15:55,584 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 896 transitions. Word has length 109 [2025-03-03 14:15:55,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:55,585 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 896 transitions. [2025-03-03 14:15:55,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (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-03-03 14:15:55,585 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 896 transitions. [2025-03-03 14:15:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:15:55,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:55,588 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:55,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:15:55,588 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:55,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2114991783, now seen corresponding path program 1 times [2025-03-03 14:15:55,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:55,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095047950] [2025-03-03 14:15:55,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:55,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:55,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:15:55,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:15:55,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:55,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:55,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:55,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:55,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095047950] [2025-03-03 14:15:55,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095047950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:55,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:55,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:55,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643930860] [2025-03-03 14:15:55,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:55,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:55,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:55,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:55,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:55,724 INFO L87 Difference]: Start difference. First operand 545 states and 896 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, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:55,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:55,875 INFO L93 Difference]: Finished difference Result 1047 states and 1726 transitions. [2025-03-03 14:15:55,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:55,875 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, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2025-03-03 14:15:55,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:55,879 INFO L225 Difference]: With dead ends: 1047 [2025-03-03 14:15:55,879 INFO L226 Difference]: Without dead ends: 554 [2025-03-03 14:15:55,881 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-03-03 14:15:55,882 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 55 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4236 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-03-03 14:15:55,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4236 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:15:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-03 14:15:55,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 545. [2025-03-03 14:15:55,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 425 states have (on average 1.6588235294117648) internal successors, (705), 444 states have internal predecessors, (705), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:15:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 892 transitions. [2025-03-03 14:15:55,901 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 892 transitions. Word has length 110 [2025-03-03 14:15:55,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:55,901 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 892 transitions. [2025-03-03 14:15:55,901 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, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:55,902 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 892 transitions. [2025-03-03 14:15:55,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:15:55,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:55,904 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:55,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:15:55,904 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:55,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:55,905 INFO L85 PathProgramCache]: Analyzing trace with hash -769890536, now seen corresponding path program 1 times [2025-03-03 14:15:55,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:55,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304426746] [2025-03-03 14:15:55,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:55,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:55,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:15:55,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:15:55,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:55,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:56,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:56,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304426746] [2025-03-03 14:15:56,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304426746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:56,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:56,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:56,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482066401] [2025-03-03 14:15:56,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:56,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:56,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:56,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:56,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:56,022 INFO L87 Difference]: Start difference. First operand 545 states and 892 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, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:56,163 INFO L93 Difference]: Finished difference Result 1047 states and 1722 transitions. [2025-03-03 14:15:56,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:56,163 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, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2025-03-03 14:15:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:56,168 INFO L225 Difference]: With dead ends: 1047 [2025-03-03 14:15:56,168 INFO L226 Difference]: Without dead ends: 554 [2025-03-03 14:15:56,170 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-03-03 14:15:56,172 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 54 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4236 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-03-03 14:15:56,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4236 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:15:56,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-03 14:15:56,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 545. [2025-03-03 14:15:56,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 425 states have (on average 1.6494117647058824) internal successors, (701), 444 states have internal predecessors, (701), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:15:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 888 transitions. [2025-03-03 14:15:56,190 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 888 transitions. Word has length 111 [2025-03-03 14:15:56,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:56,190 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 888 transitions. [2025-03-03 14:15:56,191 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, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 888 transitions. [2025-03-03 14:15:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:15:56,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:56,194 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:56,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:15:56,194 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:56,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:56,197 INFO L85 PathProgramCache]: Analyzing trace with hash 742403338, now seen corresponding path program 1 times [2025-03-03 14:15:56,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:56,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812491910] [2025-03-03 14:15:56,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:56,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:56,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:15:56,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:15:56,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:56,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:56,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:56,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:56,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812491910] [2025-03-03 14:15:56,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812491910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:56,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:56,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:56,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466396109] [2025-03-03 14:15:56,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:56,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:56,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:56,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:56,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:56,330 INFO L87 Difference]: Start difference. First operand 545 states and 888 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, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:56,481 INFO L93 Difference]: Finished difference Result 1047 states and 1718 transitions. [2025-03-03 14:15:56,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:56,483 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, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2025-03-03 14:15:56,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:56,487 INFO L225 Difference]: With dead ends: 1047 [2025-03-03 14:15:56,487 INFO L226 Difference]: Without dead ends: 554 [2025-03-03 14:15:56,489 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-03-03 14:15:56,489 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 53 mSDsluCounter, 3366 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4218 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-03-03 14:15:56,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4218 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:15:56,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-03 14:15:56,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 545. [2025-03-03 14:15:56,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 425 states have (on average 1.64) internal successors, (697), 444 states have internal predecessors, (697), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:15:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 884 transitions. [2025-03-03 14:15:56,524 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 884 transitions. Word has length 112 [2025-03-03 14:15:56,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:56,524 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 884 transitions. [2025-03-03 14:15:56,525 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, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 884 transitions. [2025-03-03 14:15:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:15:56,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:56,527 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:56,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:15:56,527 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:56,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1677730119, now seen corresponding path program 1 times [2025-03-03 14:15:56,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:56,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399271420] [2025-03-03 14:15:56,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:56,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:56,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:15:56,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:15:56,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:56,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:56,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:56,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399271420] [2025-03-03 14:15:56,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399271420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:56,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:56,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:15:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169999567] [2025-03-03 14:15:56,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:56,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:15:56,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:56,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:15:56,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:56,661 INFO L87 Difference]: Start difference. First operand 545 states and 884 transitions. Second operand has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:15:56,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:56,722 INFO L93 Difference]: Finished difference Result 1038 states and 1700 transitions. [2025-03-03 14:15:56,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:15:56,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2025-03-03 14:15:56,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:56,728 INFO L225 Difference]: With dead ends: 1038 [2025-03-03 14:15:56,728 INFO L226 Difference]: Without dead ends: 524 [2025-03-03 14:15:56,730 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-03-03 14:15:56,732 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 84 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5165 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-03-03 14:15:56,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5165 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:56,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-03 14:15:56,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-03-03 14:15:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 404 states have (on average 1.641089108910891) internal successors, (663), 423 states have internal predecessors, (663), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:15:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 850 transitions. [2025-03-03 14:15:56,751 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 850 transitions. Word has length 112 [2025-03-03 14:15:56,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:56,751 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 850 transitions. [2025-03-03 14:15:56,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:15:56,751 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 850 transitions. [2025-03-03 14:15:56,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:15:56,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:56,754 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:56,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:15:56,754 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:56,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:56,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1128205723, now seen corresponding path program 1 times [2025-03-03 14:15:56,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:56,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634201070] [2025-03-03 14:15:56,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:56,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:56,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:15:56,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:15:56,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:56,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:56,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:56,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634201070] [2025-03-03 14:15:56,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634201070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:56,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:56,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:56,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432619431] [2025-03-03 14:15:56,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:56,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:56,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:56,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:56,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:56,863 INFO L87 Difference]: Start difference. First operand 524 states and 850 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, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:56,921 INFO L93 Difference]: Finished difference Result 1017 states and 1666 transitions. [2025-03-03 14:15:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:56,921 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, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2025-03-03 14:15:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:56,925 INFO L225 Difference]: With dead ends: 1017 [2025-03-03 14:15:56,925 INFO L226 Difference]: Without dead ends: 524 [2025-03-03 14:15:56,927 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-03-03 14:15:56,928 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 17 mSDsluCounter, 3323 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4156 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-03-03 14:15:56,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4156 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:56,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-03 14:15:56,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-03-03 14:15:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 404 states have (on average 1.6386138613861385) internal successors, (662), 423 states have internal predecessors, (662), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:15:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 849 transitions. [2025-03-03 14:15:56,945 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 849 transitions. Word has length 113 [2025-03-03 14:15:56,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:56,945 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 849 transitions. [2025-03-03 14:15:56,945 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, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:56,946 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 849 transitions. [2025-03-03 14:15:56,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:15:56,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:56,948 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:56,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:15:56,948 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:56,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:56,949 INFO L85 PathProgramCache]: Analyzing trace with hash 952510317, now seen corresponding path program 1 times [2025-03-03 14:15:56,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:56,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256251895] [2025-03-03 14:15:56,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:56,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:56,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:15:56,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:15:56,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:56,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:57,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:57,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256251895] [2025-03-03 14:15:57,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256251895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:57,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:57,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:57,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52285563] [2025-03-03 14:15:57,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:57,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:57,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:57,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:57,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:57,062 INFO L87 Difference]: Start difference. First operand 524 states and 849 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:57,120 INFO L93 Difference]: Finished difference Result 1017 states and 1665 transitions. [2025-03-03 14:15:57,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:57,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-03-03 14:15:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:57,125 INFO L225 Difference]: With dead ends: 1017 [2025-03-03 14:15:57,125 INFO L226 Difference]: Without dead ends: 524 [2025-03-03 14:15:57,127 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-03-03 14:15:57,128 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 16 mSDsluCounter, 3323 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4156 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-03-03 14:15:57,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4156 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-03 14:15:57,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-03-03 14:15:57,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 404 states have (on average 1.636138613861386) internal successors, (661), 423 states have internal predecessors, (661), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:15:57,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 848 transitions. [2025-03-03 14:15:57,144 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 848 transitions. Word has length 114 [2025-03-03 14:15:57,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:57,144 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 848 transitions. [2025-03-03 14:15:57,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:57,145 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 848 transitions. [2025-03-03 14:15:57,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:15:57,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:57,147 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:57,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:15:57,148 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:57,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:57,148 INFO L85 PathProgramCache]: Analyzing trace with hash 550252574, now seen corresponding path program 1 times [2025-03-03 14:15:57,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:57,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727228083] [2025-03-03 14:15:57,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:57,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:57,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:15:57,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:15:57,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:57,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:57,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:57,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727228083] [2025-03-03 14:15:57,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727228083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:57,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:57,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:57,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606438128] [2025-03-03 14:15:57,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:57,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:57,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:57,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:57,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:57,251 INFO L87 Difference]: Start difference. First operand 524 states and 848 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:57,282 INFO L93 Difference]: Finished difference Result 1011 states and 1653 transitions. [2025-03-03 14:15:57,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:57,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-03-03 14:15:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:57,286 INFO L225 Difference]: With dead ends: 1011 [2025-03-03 14:15:57,287 INFO L226 Difference]: Without dead ends: 524 [2025-03-03 14:15:57,288 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-03-03 14:15:57,289 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 5 mSDsluCounter, 1662 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:57,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2498 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:57,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-03 14:15:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-03-03 14:15:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 404 states have (on average 1.6336633663366336) internal successors, (660), 423 states have internal predecessors, (660), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:15:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 847 transitions. [2025-03-03 14:15:57,305 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 847 transitions. Word has length 115 [2025-03-03 14:15:57,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:57,305 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 847 transitions. [2025-03-03 14:15:57,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:57,306 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 847 transitions. [2025-03-03 14:15:57,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:15:57,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:57,309 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:57,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:15:57,309 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:57,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:57,310 INFO L85 PathProgramCache]: Analyzing trace with hash -645906944, now seen corresponding path program 1 times [2025-03-03 14:15:57,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:57,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656291630] [2025-03-03 14:15:57,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:57,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:57,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:15:57,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:15:57,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:57,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:15:57,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:57,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656291630] [2025-03-03 14:15:57,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656291630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:15:57,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753999437] [2025-03-03 14:15:57,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:57,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:15:57,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:15:57,432 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:15:57,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:15:57,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:15:57,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:15:57,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:57,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:57,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 1444 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:15:57,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:15:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:15:57,833 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:15:57,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753999437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:57,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:15:57,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:15:57,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749219052] [2025-03-03 14:15:57,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:57,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:15:57,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:57,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:15:57,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:15:57,834 INFO L87 Difference]: Start difference. First operand 524 states and 847 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:15:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:58,262 INFO L93 Difference]: Finished difference Result 1011 states and 1675 transitions. [2025-03-03 14:15:58,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:58,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2025-03-03 14:15:58,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:58,267 INFO L225 Difference]: With dead ends: 1011 [2025-03-03 14:15:58,267 INFO L226 Difference]: Without dead ends: 532 [2025-03-03 14:15:58,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:15:58,270 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 807 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:58,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 2119 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:15:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-03 14:15:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-03-03 14:15:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 411 states have (on average 1.635036496350365) internal successors, (672), 430 states have internal predecessors, (672), 96 states have call successors, (96), 25 states have call predecessors, (96), 24 states have return successors, (92), 89 states have call predecessors, (92), 91 states have call successors, (92) [2025-03-03 14:15:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 860 transitions. [2025-03-03 14:15:58,289 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 860 transitions. Word has length 116 [2025-03-03 14:15:58,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:58,290 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 860 transitions. [2025-03-03 14:15:58,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:15:58,291 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 860 transitions. [2025-03-03 14:15:58,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:15:58,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:58,293 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:58,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:15:58,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 14:15:58,497 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:58,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:58,497 INFO L85 PathProgramCache]: Analyzing trace with hash 891316808, now seen corresponding path program 1 times [2025-03-03 14:15:58,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:58,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311306630] [2025-03-03 14:15:58,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:58,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:58,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:15:58,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:15:58,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:58,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:15:58,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:58,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311306630] [2025-03-03 14:15:58,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311306630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:15:58,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130167319] [2025-03-03 14:15:58,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:58,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:15:58,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:15:58,614 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:15:58,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:15:58,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:15:58,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:15:58,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:58,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:58,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:15:58,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:15:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:15:59,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:15:59,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130167319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:59,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:15:59,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:15:59,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398223642] [2025-03-03 14:15:59,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:59,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:15:59,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:59,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:15:59,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:15:59,003 INFO L87 Difference]: Start difference. First operand 532 states and 860 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:15:59,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:59,443 INFO L93 Difference]: Finished difference Result 1027 states and 1698 transitions. [2025-03-03 14:15:59,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:59,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2025-03-03 14:15:59,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:59,447 INFO L225 Difference]: With dead ends: 1027 [2025-03-03 14:15:59,447 INFO L226 Difference]: Without dead ends: 540 [2025-03-03 14:15:59,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:15:59,450 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 801 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:59,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 2116 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:15:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-03 14:15:59,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-03-03 14:15:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 418 states have (on average 1.6363636363636365) internal successors, (684), 437 states have internal predecessors, (684), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2025-03-03 14:15:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 873 transitions. [2025-03-03 14:15:59,467 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 873 transitions. Word has length 118 [2025-03-03 14:15:59,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:59,467 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 873 transitions. [2025-03-03 14:15:59,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:15:59,467 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 873 transitions. [2025-03-03 14:15:59,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:15:59,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:59,470 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:59,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:15:59,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 14:15:59,671 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:59,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:59,671 INFO L85 PathProgramCache]: Analyzing trace with hash -811934560, now seen corresponding path program 1 times [2025-03-03 14:15:59,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:59,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101287949] [2025-03-03 14:15:59,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:59,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:59,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:15:59,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:15:59,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:59,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:15:59,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:59,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101287949] [2025-03-03 14:15:59,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101287949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:15:59,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210802064] [2025-03-03 14:15:59,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:59,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:15:59,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:15:59,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:15:59,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:15:59,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:16:00,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:16:00,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:00,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:00,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:16:00,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:16:00,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:00,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210802064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:00,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:00,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:16:00,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229964382] [2025-03-03 14:16:00,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:00,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:00,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:00,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:00,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:00,150 INFO L87 Difference]: Start difference. First operand 540 states and 873 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:00,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:00,623 INFO L93 Difference]: Finished difference Result 1043 states and 1721 transitions. [2025-03-03 14:16:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:00,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2025-03-03 14:16:00,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:00,628 INFO L225 Difference]: With dead ends: 1043 [2025-03-03 14:16:00,628 INFO L226 Difference]: Without dead ends: 548 [2025-03-03 14:16:00,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:16:00,631 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 785 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:00,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 2113 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:16:00,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-03 14:16:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-03 14:16:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 425 states have (on average 1.6376470588235295) internal successors, (696), 444 states have internal predecessors, (696), 96 states have call successors, (96), 27 states have call predecessors, (96), 26 states have return successors, (94), 89 states have call predecessors, (94), 91 states have call successors, (94) [2025-03-03 14:16:00,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 886 transitions. [2025-03-03 14:16:00,650 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 886 transitions. Word has length 120 [2025-03-03 14:16:00,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:00,651 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 886 transitions. [2025-03-03 14:16:00,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 886 transitions. [2025-03-03 14:16:00,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:16:00,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:00,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:00,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:00,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:00,858 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:00,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:00,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2130531202, now seen corresponding path program 1 times [2025-03-03 14:16:00,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:00,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039789309] [2025-03-03 14:16:00,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:00,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:00,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:16:00,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:16:00,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:00,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:16:00,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:00,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039789309] [2025-03-03 14:16:00,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039789309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:00,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154589195] [2025-03-03 14:16:00,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:00,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:00,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:00,953 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:00,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:16:01,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:16:01,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:16:01,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:01,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:01,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:16:01,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:16:01,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:01,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154589195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:01,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:01,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:16:01,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737987418] [2025-03-03 14:16:01,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:01,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:01,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:01,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:01,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:01,261 INFO L87 Difference]: Start difference. First operand 548 states and 886 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:01,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:01,666 INFO L93 Difference]: Finished difference Result 1059 states and 1744 transitions. [2025-03-03 14:16:01,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:01,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2025-03-03 14:16:01,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:01,672 INFO L225 Difference]: With dead ends: 1059 [2025-03-03 14:16:01,672 INFO L226 Difference]: Without dead ends: 556 [2025-03-03 14:16:01,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:16:01,675 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 792 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:01,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 2110 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:16:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-03 14:16:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-03 14:16:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 432 states have (on average 1.6388888888888888) internal successors, (708), 451 states have internal predecessors, (708), 96 states have call successors, (96), 28 states have call predecessors, (96), 27 states have return successors, (95), 89 states have call predecessors, (95), 91 states have call successors, (95) [2025-03-03 14:16:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 899 transitions. [2025-03-03 14:16:01,699 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 899 transitions. Word has length 122 [2025-03-03 14:16:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:01,699 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 899 transitions. [2025-03-03 14:16:01,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 899 transitions. [2025-03-03 14:16:01,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:16:01,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:01,702 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:01,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:01,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 14:16:01,903 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:01,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:01,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2131530176, now seen corresponding path program 1 times [2025-03-03 14:16:01,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:01,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842839510] [2025-03-03 14:16:01,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:01,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:01,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:16:01,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:16:01,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:01,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:16:02,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:02,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842839510] [2025-03-03 14:16:02,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842839510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:02,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122658448] [2025-03-03 14:16:02,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:02,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:02,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:02,118 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:02,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:16:02,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:16:02,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:16:02,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:02,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:02,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:16:02,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:02,517 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:16:02,517 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:02,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122658448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:02,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:02,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2025-03-03 14:16:02,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647754196] [2025-03-03 14:16:02,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:02,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:02,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:02,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:02,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:02,519 INFO L87 Difference]: Start difference. First operand 556 states and 899 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 14:16:02,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:02,894 INFO L93 Difference]: Finished difference Result 604 states and 970 transitions. [2025-03-03 14:16:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:02,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2025-03-03 14:16:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:02,899 INFO L225 Difference]: With dead ends: 604 [2025-03-03 14:16:02,899 INFO L226 Difference]: Without dead ends: 589 [2025-03-03 14:16:02,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:02,900 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 822 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:02,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 2143 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:16:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-03 14:16:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 559. [2025-03-03 14:16:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 435 states have (on average 1.6344827586206896) internal successors, (711), 454 states have internal predecessors, (711), 96 states have call successors, (96), 28 states have call predecessors, (96), 27 states have return successors, (95), 89 states have call predecessors, (95), 91 states have call successors, (95) [2025-03-03 14:16:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 902 transitions. [2025-03-03 14:16:02,920 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 902 transitions. Word has length 124 [2025-03-03 14:16:02,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:02,920 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 902 transitions. [2025-03-03 14:16:02,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 14:16:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 902 transitions. [2025-03-03 14:16:02,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:16:02,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:02,923 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:02,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:16:03,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:03,124 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:03,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:03,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1816701054, now seen corresponding path program 1 times [2025-03-03 14:16:03,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:03,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440860655] [2025-03-03 14:16:03,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:03,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:03,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:16:03,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:16:03,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:03,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:03,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:16:03,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:03,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440860655] [2025-03-03 14:16:03,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440860655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:03,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500582405] [2025-03-03 14:16:03,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:03,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:03,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:03,383 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:03,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:16:03,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:16:03,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:16:03,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:03,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:03,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 1468 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:16:03,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:03,671 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:16:03,671 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:03,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500582405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:03,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:03,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2025-03-03 14:16:03,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124464887] [2025-03-03 14:16:03,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:03,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:03,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:03,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:03,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:03,672 INFO L87 Difference]: Start difference. First operand 559 states and 902 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:16:03,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:03,694 INFO L93 Difference]: Finished difference Result 574 states and 920 transitions. [2025-03-03 14:16:03,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:03,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) Word has length 130 [2025-03-03 14:16:03,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:03,698 INFO L225 Difference]: With dead ends: 574 [2025-03-03 14:16:03,698 INFO L226 Difference]: Without dead ends: 559 [2025-03-03 14:16:03,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:03,699 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 0 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3372 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:03,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3372 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-03 14:16:03,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2025-03-03 14:16:03,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 435 states have (on average 1.632183908045977) internal successors, (710), 454 states have internal predecessors, (710), 96 states have call successors, (96), 28 states have call predecessors, (96), 27 states have return successors, (95), 89 states have call predecessors, (95), 91 states have call successors, (95) [2025-03-03 14:16:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 901 transitions. [2025-03-03 14:16:03,716 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 901 transitions. Word has length 130 [2025-03-03 14:16:03,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:03,717 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 901 transitions. [2025-03-03 14:16:03,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:16:03,717 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 901 transitions. [2025-03-03 14:16:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:16:03,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:03,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:03,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:16:03,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:03,924 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:03,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:03,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1732783110, now seen corresponding path program 1 times [2025-03-03 14:16:03,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:03,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531427860] [2025-03-03 14:16:03,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:03,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:03,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:16:03,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:16:03,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:03,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:04,211 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 14:16:04,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:04,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531427860] [2025-03-03 14:16:04,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531427860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:04,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832557051] [2025-03-03 14:16:04,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:04,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:04,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:04,214 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:04,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:16:04,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:16:04,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:16:04,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:04,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:04,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 14:16:04,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:16:04,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:04,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832557051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:04,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:04,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2025-03-03 14:16:04,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417690883] [2025-03-03 14:16:04,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:04,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:16:04,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:04,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:16:04,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:16:04,635 INFO L87 Difference]: Start difference. First operand 559 states and 901 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 6 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-03 14:16:07,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:07,147 INFO L93 Difference]: Finished difference Result 1921 states and 3167 transitions. [2025-03-03 14:16:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 14:16:07,148 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 6 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 140 [2025-03-03 14:16:07,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:07,156 INFO L225 Difference]: With dead ends: 1921 [2025-03-03 14:16:07,156 INFO L226 Difference]: Without dead ends: 1407 [2025-03-03 14:16:07,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:16:07,159 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 2332 mSDsluCounter, 2255 mSDsCounter, 0 mSdLazyCounter, 4641 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2417 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 5155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 4641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:07,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2417 Valid, 2762 Invalid, 5155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 4641 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 14:16:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2025-03-03 14:16:07,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1293. [2025-03-03 14:16:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1012 states have (on average 1.6551383399209487) internal successors, (1675), 1051 states have internal predecessors, (1675), 214 states have call successors, (214), 61 states have call predecessors, (214), 66 states have return successors, (233), 206 states have call predecessors, (233), 209 states have call successors, (233) [2025-03-03 14:16:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 2122 transitions. [2025-03-03 14:16:07,221 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 2122 transitions. Word has length 140 [2025-03-03 14:16:07,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:07,222 INFO L471 AbstractCegarLoop]: Abstraction has 1293 states and 2122 transitions. [2025-03-03 14:16:07,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 6 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-03 14:16:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 2122 transitions. [2025-03-03 14:16:07,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 14:16:07,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:07,225 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:07,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:07,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:07,426 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:07,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:07,426 INFO L85 PathProgramCache]: Analyzing trace with hash 323187084, now seen corresponding path program 1 times [2025-03-03 14:16:07,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:07,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351516286] [2025-03-03 14:16:07,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:07,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:07,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 14:16:07,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 14:16:07,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:07,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:07,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:07,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351516286] [2025-03-03 14:16:07,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351516286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:07,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233593458] [2025-03-03 14:16:07,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:07,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:07,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:07,662 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:07,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:16:07,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 14:16:07,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 14:16:07,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:07,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:07,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 1500 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 14:16:07,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:08,007 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:08,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233593458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:08,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:08,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-03-03 14:16:08,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692970303] [2025-03-03 14:16:08,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:08,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:16:08,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:08,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:16:08,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:16:08,010 INFO L87 Difference]: Start difference. First operand 1293 states and 2122 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:16:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:09,746 INFO L93 Difference]: Finished difference Result 2799 states and 4618 transitions. [2025-03-03 14:16:09,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:16:09,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 142 [2025-03-03 14:16:09,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:09,754 INFO L225 Difference]: With dead ends: 2799 [2025-03-03 14:16:09,755 INFO L226 Difference]: Without dead ends: 1551 [2025-03-03 14:16:09,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:16:09,761 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 2082 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 3312 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 3788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 3312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:09,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 2035 Invalid, 3788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 3312 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 14:16:09,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2025-03-03 14:16:09,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1364. [2025-03-03 14:16:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1064 states have (on average 1.6419172932330828) internal successors, (1747), 1109 states have internal predecessors, (1747), 222 states have call successors, (222), 66 states have call predecessors, (222), 77 states have return successors, (259), 214 states have call predecessors, (259), 217 states have call successors, (259) [2025-03-03 14:16:09,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2228 transitions. [2025-03-03 14:16:09,820 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2228 transitions. Word has length 142 [2025-03-03 14:16:09,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:09,821 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 2228 transitions. [2025-03-03 14:16:09,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:16:09,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2228 transitions. [2025-03-03 14:16:09,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 14:16:09,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:09,824 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:09,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:10,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 14:16:10,025 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:10,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:10,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2044437495, now seen corresponding path program 1 times [2025-03-03 14:16:10,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:10,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073136284] [2025-03-03 14:16:10,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:10,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:10,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:16:10,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:16:10,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:10,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:10,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:10,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073136284] [2025-03-03 14:16:10,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073136284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:10,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989698650] [2025-03-03 14:16:10,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:10,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:10,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:10,235 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:10,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:16:10,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:16:10,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:16:10,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:10,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:10,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:16:10,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:16:10,473 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:10,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989698650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:10,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:10,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2025-03-03 14:16:10,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968975911] [2025-03-03 14:16:10,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:10,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:16:10,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:10,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:16:10,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:16:10,475 INFO L87 Difference]: Start difference. First operand 1364 states and 2228 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:16:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:10,537 INFO L93 Difference]: Finished difference Result 3379 states and 5589 transitions. [2025-03-03 14:16:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:16:10,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2025-03-03 14:16:10,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:10,546 INFO L225 Difference]: With dead ends: 3379 [2025-03-03 14:16:10,546 INFO L226 Difference]: Without dead ends: 2064 [2025-03-03 14:16:10,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:16:10,550 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 787 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 2339 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:10,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 2339 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2025-03-03 14:16:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1360. [2025-03-03 14:16:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1062 states have (on average 1.6412429378531073) internal successors, (1743), 1105 states have internal predecessors, (1743), 222 states have call successors, (222), 66 states have call predecessors, (222), 75 states have return successors, (250), 214 states have call predecessors, (250), 217 states have call successors, (250) [2025-03-03 14:16:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2215 transitions. [2025-03-03 14:16:10,610 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 2215 transitions. Word has length 147 [2025-03-03 14:16:10,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:10,610 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 2215 transitions. [2025-03-03 14:16:10,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:16:10,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2215 transitions. [2025-03-03 14:16:10,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 14:16:10,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:10,613 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:10,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:10,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:10,814 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:10,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:10,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1595740856, now seen corresponding path program 1 times [2025-03-03 14:16:10,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:10,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679496774] [2025-03-03 14:16:10,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:10,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:10,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:16:10,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:16:10,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:10,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:11,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:11,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679496774] [2025-03-03 14:16:11,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679496774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:11,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398501845] [2025-03-03 14:16:11,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:11,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:11,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:11,031 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:11,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 14:16:11,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:16:11,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:16:11,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:11,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:11,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 1516 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:16:11,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:11,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:11,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398501845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:11,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:11,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:11,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191477158] [2025-03-03 14:16:11,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:11,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:11,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:11,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:11,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:11,335 INFO L87 Difference]: Start difference. First operand 1360 states and 2215 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:12,572 INFO L93 Difference]: Finished difference Result 4254 states and 7051 transitions. [2025-03-03 14:16:12,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:12,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 147 [2025-03-03 14:16:12,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:12,589 INFO L225 Difference]: With dead ends: 4254 [2025-03-03 14:16:12,589 INFO L226 Difference]: Without dead ends: 2939 [2025-03-03 14:16:12,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:12,596 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 1865 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1943 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:12,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1943 Valid, 916 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:16:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2025-03-03 14:16:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2827. [2025-03-03 14:16:12,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2178 states have (on average 1.6441689623507805) internal successors, (3581), 2274 states have internal predecessors, (3581), 495 states have call successors, (495), 127 states have call predecessors, (495), 153 states have return successors, (603), 487 states have call predecessors, (603), 490 states have call successors, (603) [2025-03-03 14:16:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 4679 transitions. [2025-03-03 14:16:12,768 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 4679 transitions. Word has length 147 [2025-03-03 14:16:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:12,769 INFO L471 AbstractCegarLoop]: Abstraction has 2827 states and 4679 transitions. [2025-03-03 14:16:12,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:12,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 4679 transitions. [2025-03-03 14:16:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 14:16:12,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:12,777 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:12,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 14:16:12,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-03 14:16:12,978 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:12,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:12,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2071822664, now seen corresponding path program 1 times [2025-03-03 14:16:12,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:12,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295239122] [2025-03-03 14:16:12,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:12,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:12,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:16:13,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:16:13,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:13,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:13,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:13,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295239122] [2025-03-03 14:16:13,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295239122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:13,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584152235] [2025-03-03 14:16:13,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:13,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:13,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:13,197 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:13,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 14:16:13,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:16:13,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:16:13,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:13,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:13,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:16:13,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:13,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:13,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584152235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:13,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:13,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:13,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072306436] [2025-03-03 14:16:13,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:13,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:13,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:13,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:13,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:13,501 INFO L87 Difference]: Start difference. First operand 2827 states and 4679 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:14,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:14,702 INFO L93 Difference]: Finished difference Result 9082 states and 15349 transitions. [2025-03-03 14:16:14,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:14,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 148 [2025-03-03 14:16:14,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:14,743 INFO L225 Difference]: With dead ends: 9082 [2025-03-03 14:16:14,744 INFO L226 Difference]: Without dead ends: 6300 [2025-03-03 14:16:14,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:14,759 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 1872 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:14,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 876 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 14:16:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6300 states. [2025-03-03 14:16:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6300 to 6061. [2025-03-03 14:16:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6061 states, 4589 states have (on average 1.6402266288951841) internal successors, (7527), 4813 states have internal predecessors, (7527), 1154 states have call successors, (1154), 249 states have call predecessors, (1154), 317 states have return successors, (1548), 1150 states have call predecessors, (1548), 1149 states have call successors, (1548) [2025-03-03 14:16:15,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6061 states to 6061 states and 10229 transitions. [2025-03-03 14:16:15,038 INFO L78 Accepts]: Start accepts. Automaton has 6061 states and 10229 transitions. Word has length 148 [2025-03-03 14:16:15,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:15,038 INFO L471 AbstractCegarLoop]: Abstraction has 6061 states and 10229 transitions. [2025-03-03 14:16:15,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:15,040 INFO L276 IsEmpty]: Start isEmpty. Operand 6061 states and 10229 transitions. [2025-03-03 14:16:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 14:16:15,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:15,044 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:15,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:15,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-03 14:16:15,245 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:15,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:15,246 INFO L85 PathProgramCache]: Analyzing trace with hash 197821426, now seen corresponding path program 1 times [2025-03-03 14:16:15,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:15,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246011935] [2025-03-03 14:16:15,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:15,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:15,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:16:15,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:16:15,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:15,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:15,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:15,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246011935] [2025-03-03 14:16:15,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246011935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:15,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838558062] [2025-03-03 14:16:15,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:15,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:15,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:15,416 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:15,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 14:16:15,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:16:15,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:16:15,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:15,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:15,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:16:15,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:15,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:15,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838558062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:15,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:15,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:15,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509638781] [2025-03-03 14:16:15,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:15,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:15,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:15,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:15,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:15,723 INFO L87 Difference]: Start difference. First operand 6061 states and 10229 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:17,426 INFO L93 Difference]: Finished difference Result 19880 states and 34604 transitions. [2025-03-03 14:16:17,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:17,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), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 149 [2025-03-03 14:16:17,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:17,516 INFO L225 Difference]: With dead ends: 19880 [2025-03-03 14:16:17,516 INFO L226 Difference]: Without dead ends: 13864 [2025-03-03 14:16:17,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:17,550 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 1857 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1933 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:17,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1933 Valid, 873 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:16:17,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13864 states. [2025-03-03 14:16:18,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13864 to 13370. [2025-03-03 14:16:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13370 states, 9914 states have (on average 1.6317329029655032) internal successors, (16177), 10452 states have internal predecessors, (16177), 2790 states have call successors, (2790), 493 states have call predecessors, (2790), 665 states have return successors, (4214), 2806 states have call predecessors, (4214), 2785 states have call successors, (4214) [2025-03-03 14:16:18,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13370 states to 13370 states and 23181 transitions. [2025-03-03 14:16:18,226 INFO L78 Accepts]: Start accepts. Automaton has 13370 states and 23181 transitions. Word has length 149 [2025-03-03 14:16:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:18,229 INFO L471 AbstractCegarLoop]: Abstraction has 13370 states and 23181 transitions. [2025-03-03 14:16:18,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 13370 states and 23181 transitions. [2025-03-03 14:16:18,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 14:16:18,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:18,234 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:18,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:18,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 14:16:18,436 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:18,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:18,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1837307698, now seen corresponding path program 1 times [2025-03-03 14:16:18,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:18,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9713680] [2025-03-03 14:16:18,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:18,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:18,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:16:18,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:16:18,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:18,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:18,618 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:18,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:18,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9713680] [2025-03-03 14:16:18,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9713680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:18,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126981232] [2025-03-03 14:16:18,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:18,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:18,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:18,620 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:18,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 14:16:18,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:16:18,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:16:18,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:18,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:18,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1522 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:16:18,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:18,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:18,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126981232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:18,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:18,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:18,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336054857] [2025-03-03 14:16:18,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:18,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:18,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:18,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:18,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:18,961 INFO L87 Difference]: Start difference. First operand 13370 states and 23181 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, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:21,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:21,575 INFO L93 Difference]: Finished difference Result 44625 states and 81355 transitions. [2025-03-03 14:16:21,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:21,576 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, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 150 [2025-03-03 14:16:21,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:21,792 INFO L225 Difference]: With dead ends: 44625 [2025-03-03 14:16:21,792 INFO L226 Difference]: Without dead ends: 31300 [2025-03-03 14:16:21,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:21,859 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 1845 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1920 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:21,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1920 Valid, 867 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 14:16:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31300 states. [2025-03-03 14:16:23,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31300 to 30351. [2025-03-03 14:16:23,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30351 states, 21987 states have (on average 1.6200027288852503) internal successors, (35619), 23307 states have internal predecessors, (35619), 6950 states have call successors, (6950), 981 states have call predecessors, (6950), 1413 states have return successors, (12120), 7042 states have call predecessors, (12120), 6945 states have call successors, (12120) [2025-03-03 14:16:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30351 states to 30351 states and 54689 transitions. [2025-03-03 14:16:23,545 INFO L78 Accepts]: Start accepts. Automaton has 30351 states and 54689 transitions. Word has length 150 [2025-03-03 14:16:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:23,546 INFO L471 AbstractCegarLoop]: Abstraction has 30351 states and 54689 transitions. [2025-03-03 14:16:23,546 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, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 30351 states and 54689 transitions. [2025-03-03 14:16:23,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 14:16:23,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:23,551 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:23,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:23,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 14:16:23,755 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:23,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:23,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1121770796, now seen corresponding path program 1 times [2025-03-03 14:16:23,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:23,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528146814] [2025-03-03 14:16:23,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:23,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:23,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:16:23,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:16:23,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:23,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:23,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:23,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528146814] [2025-03-03 14:16:23,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528146814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:23,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186471218] [2025-03-03 14:16:23,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:23,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:23,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:23,940 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:23,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 14:16:24,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:16:24,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:16:24,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:24,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:24,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 1524 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:16:24,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:24,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:24,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186471218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:24,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:24,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:24,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872276733] [2025-03-03 14:16:24,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:24,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:24,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:24,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:24,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:24,241 INFO L87 Difference]: Start difference. First operand 30351 states and 54689 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, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:29,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:29,385 INFO L93 Difference]: Finished difference Result 102797 states and 201607 transitions. [2025-03-03 14:16:29,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:29,386 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, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 151 [2025-03-03 14:16:29,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:29,988 INFO L225 Difference]: With dead ends: 102797 [2025-03-03 14:16:29,988 INFO L226 Difference]: Without dead ends: 72481 [2025-03-03 14:16:30,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:30,172 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 1819 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1893 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:30,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1893 Valid, 965 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 14:16:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72481 states. [2025-03-03 14:16:34,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72481 to 70868. [2025-03-03 14:16:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70868 states, 50092 states have (on average 1.6061446937634751) internal successors, (80455), 53386 states have internal predecessors, (80455), 17730 states have call successors, (17730), 1954 states have call predecessors, (17730), 3045 states have return successors, (36793), 18081 states have call predecessors, (36793), 17725 states have call successors, (36793) [2025-03-03 14:16:35,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70868 states to 70868 states and 134978 transitions. [2025-03-03 14:16:35,421 INFO L78 Accepts]: Start accepts. Automaton has 70868 states and 134978 transitions. Word has length 151 [2025-03-03 14:16:35,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:35,422 INFO L471 AbstractCegarLoop]: Abstraction has 70868 states and 134978 transitions. [2025-03-03 14:16:35,422 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, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 70868 states and 134978 transitions. [2025-03-03 14:16:35,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 14:16:35,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:35,440 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:16:35,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 14:16:35,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:35,641 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:35,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:35,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1356358080, now seen corresponding path program 1 times [2025-03-03 14:16:35,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:35,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139606888] [2025-03-03 14:16:35,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:35,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:35,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 14:16:35,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 14:16:35,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:35,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 14:16:35,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:35,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139606888] [2025-03-03 14:16:35,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139606888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:35,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609984364] [2025-03-03 14:16:35,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:35,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:35,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:35,956 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:35,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 14:16:36,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 14:16:36,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 14:16:36,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:36,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:36,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 1937 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:16:36,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:16:36,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:36,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609984364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:36,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:36,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:36,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253492432] [2025-03-03 14:16:36,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:36,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:36,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:36,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:36,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:36,278 INFO L87 Difference]: Start difference. First operand 70868 states and 134978 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:16:41,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:41,441 INFO L93 Difference]: Finished difference Result 144570 states and 285230 transitions. [2025-03-03 14:16:41,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:41,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 206 [2025-03-03 14:16:41,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:42,091 INFO L225 Difference]: With dead ends: 144570 [2025-03-03 14:16:42,092 INFO L226 Difference]: Without dead ends: 73748 [2025-03-03 14:16:42,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:42,632 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 144 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2332 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:42,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2332 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:42,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73748 states. [2025-03-03 14:16:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73748 to 73364. [2025-03-03 14:16:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73364 states, 52524 states have (on average 1.6207257634605132) internal successors, (85127), 55818 states have internal predecessors, (85127), 17730 states have call successors, (17730), 2018 states have call predecessors, (17730), 3109 states have return successors, (36793), 18081 states have call predecessors, (36793), 17725 states have call successors, (36793) [2025-03-03 14:16:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73364 states to 73364 states and 139650 transitions. [2025-03-03 14:16:48,018 INFO L78 Accepts]: Start accepts. Automaton has 73364 states and 139650 transitions. Word has length 206 [2025-03-03 14:16:48,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:48,018 INFO L471 AbstractCegarLoop]: Abstraction has 73364 states and 139650 transitions. [2025-03-03 14:16:48,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:16:48,018 INFO L276 IsEmpty]: Start isEmpty. Operand 73364 states and 139650 transitions. [2025-03-03 14:16:48,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-03 14:16:48,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:48,036 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:16:48,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-03 14:16:48,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 14:16:48,237 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:48,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:48,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1041383493, now seen corresponding path program 1 times [2025-03-03 14:16:48,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:48,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597634343] [2025-03-03 14:16:48,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:48,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:48,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-03 14:16:48,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-03 14:16:48,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:48,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-03-03 14:16:48,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:48,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597634343] [2025-03-03 14:16:48,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597634343] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:48,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490692301] [2025-03-03 14:16:48,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:48,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:48,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:48,617 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:48,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 14:16:48,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-03 14:16:48,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-03 14:16:48,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:48,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:48,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 2403 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 14:16:48,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 26 proven. 11 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-03 14:16:49,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:16:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-03 14:16:50,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490692301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:16:50,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:16:50,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 25 [2025-03-03 14:16:50,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293224365] [2025-03-03 14:16:50,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:16:50,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 14:16:50,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:50,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 14:16:50,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:16:50,380 INFO L87 Difference]: Start difference. First operand 73364 states and 139650 transitions. Second operand has 25 states, 25 states have (on average 16.84) internal successors, (421), 23 states have internal predecessors, (421), 14 states have call successors, (92), 8 states have call predecessors, (92), 15 states have return successors, (94), 18 states have call predecessors, (94), 13 states have call successors, (94)