./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product31.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_product31.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 a8dba55a6053d72f9111ac5cd147f9f45da0f79494b1facfa57c6480910007fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:26:46,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:26:46,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:26:47,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:26:47,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:26:47,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:26:47,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:26:47,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:26:47,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:26:47,024 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:26:47,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:26:47,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:26:47,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:26:47,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:26:47,026 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:26:47,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:26:47,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:26:47,026 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:26:47,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:26:47,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:26:47,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:26:47,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:26:47,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:26:47,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:26:47,027 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:26:47,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:26:47,027 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:26:47,027 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:26:47,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:26:47,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:26:47,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:26:47,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:26:47,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:26:47,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:26:47,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:26:47,028 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:26:47,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:26:47,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:26:47,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:26:47,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:26:47,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:26:47,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:26:47,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:26:47,028 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 -> a8dba55a6053d72f9111ac5cd147f9f45da0f79494b1facfa57c6480910007fb [2025-03-08 05:26:47,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:26:47,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:26:47,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:26:47,234 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:26:47,234 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:26:47,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product31.cil.c [2025-03-08 05:26:48,363 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f76c0e97/a69559dfe7c1486ebc54d4b090fe4fb9/FLAG23cdd7725 [2025-03-08 05:26:48,648 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:26:48,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product31.cil.c [2025-03-08 05:26:48,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f76c0e97/a69559dfe7c1486ebc54d4b090fe4fb9/FLAG23cdd7725 [2025-03-08 05:26:48,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f76c0e97/a69559dfe7c1486ebc54d4b090fe4fb9 [2025-03-08 05:26:48,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:26:48,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:26:48,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:26:48,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:26:48,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:26:48,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:26:48" (1/1) ... [2025-03-08 05:26:48,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb14783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:48, skipping insertion in model container [2025-03-08 05:26:48,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:26:48" (1/1) ... [2025-03-08 05:26:48,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:26:49,317 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_product31.cil.c[64450,64463] [2025-03-08 05:26:49,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:26:49,362 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:26:49,368 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2025-03-08 05:26:49,369 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [716] [2025-03-08 05:26:49,369 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [837] [2025-03-08 05:26:49,369 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1024] [2025-03-08 05:26:49,369 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1121] [2025-03-08 05:26:49,369 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1476] [2025-03-08 05:26:49,369 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3091] [2025-03-08 05:26:49,369 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3126] [2025-03-08 05:26:49,369 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3135] [2025-03-08 05:26:49,369 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3501] [2025-03-08 05:26:49,447 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_product31.cil.c[64450,64463] [2025-03-08 05:26:49,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:26:49,483 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:26:49,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:49 WrapperNode [2025-03-08 05:26:49,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:26:49,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:26:49,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:26:49,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:26:49,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:49" (1/1) ... [2025-03-08 05:26:49,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:49" (1/1) ... [2025-03-08 05:26:49,531 INFO L138 Inliner]: procedures = 97, calls = 349, calls flagged for inlining = 28, calls inlined = 25, statements flattened = 962 [2025-03-08 05:26:49,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:26:49,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:26:49,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:26:49,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:26:49,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:49" (1/1) ... [2025-03-08 05:26:49,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:49" (1/1) ... [2025-03-08 05:26:49,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:49" (1/1) ... [2025-03-08 05:26:49,574 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-08 05:26:49,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:49" (1/1) ... [2025-03-08 05:26:49,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:49" (1/1) ... [2025-03-08 05:26:49,594 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:49" (1/1) ... [2025-03-08 05:26:49,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:49" (1/1) ... [2025-03-08 05:26:49,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:49" (1/1) ... [2025-03-08 05:26:49,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:49" (1/1) ... [2025-03-08 05:26:49,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:26:49,611 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:26:49,611 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:26:49,611 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:26:49,612 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:49" (1/1) ... [2025-03-08 05:26:49,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:26:49,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:26:49,638 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-08 05:26:49,641 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-08 05:26:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-08 05:26:49,659 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-08 05:26:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:26:49,659 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:26:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:26:49,659 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:26:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-03-08 05:26:49,660 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-03-08 05:26:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:26:49,660 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:26:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:26:49,660 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:26:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:26:49,660 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:26:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-08 05:26:49,660 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-08 05:26:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-08 05:26:49,660 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-08 05:26:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:26:49,660 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:26:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:26:49,660 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:26:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:26:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-08 05:26:49,660 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-08 05:26:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-08 05:26:49,660 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-08 05:26:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-08 05:26:49,660 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-08 05:26:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:26:49,660 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:26:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:26:49,660 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:26:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-08 05:26:49,660 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-08 05:26:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:26:49,660 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:26:49,661 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:26:49,661 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:26:49,661 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:26:49,661 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:26:49,661 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:26:49,661 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:26:49,661 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:26:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:26:49,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:26:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:26:49,662 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:26:49,803 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:26:49,805 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:26:49,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2423-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~20#1; [2025-03-08 05:26:49,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2451: #res#1 := ~retValue_acc~21#1; [2025-03-08 05:26:49,882 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L834: #res := ~retValue_acc~5; [2025-03-08 05:26:49,900 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L756: #res := ~retValue_acc~3; [2025-03-08 05:26:49,902 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1550: #res := ~retValue_acc~8; [2025-03-08 05:26:49,910 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1727: #res := ~retValue_acc~9; [2025-03-08 05:26:49,939 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3079: #res := ~retValue_acc~25; [2025-03-08 05:26:50,114 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2304-1: stopRequestedInDirection__wrappee__twothirdsfull_#res#1 := stopRequestedInDirection__wrappee__twothirdsfull_~retValue_acc~17#1; [2025-03-08 05:26:50,115 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2333: #res#1 := ~retValue_acc~18#1; [2025-03-08 05:26:50,115 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2367-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~19#1; [2025-03-08 05:26:50,181 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2496: #res := ~retValue_acc~23; [2025-03-08 05:26:50,196 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L795: #res := ~retValue_acc~4; [2025-03-08 05:26:50,330 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2264: #res := ~retValue_acc~16; [2025-03-08 05:26:50,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1770: #res := ~retValue_acc~11; [2025-03-08 05:26:50,379 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-1: isEmpty_#res#1 := isEmpty_~retValue_acc~13#1; [2025-03-08 05:26:50,496 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2482-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~22#1; [2025-03-08 05:26:50,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~14#1; [2025-03-08 05:26:50,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1912-1: isIdle_#res#1 := isIdle_~retValue_acc~15#1; [2025-03-08 05:26:50,602 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L402: #res := ~retValue_acc~1; [2025-03-08 05:26:50,670 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1473-1: main_#res#1 := main_~retValue_acc~7#1; [2025-03-08 05:26:50,671 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3123-1: valid_product_#res#1 := valid_product_~retValue_acc~28#1; [2025-03-08 05:26:50,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: #res := ~retValue_acc~0; [2025-03-08 05:26:50,703 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1736: #res := ~retValue_acc~10; [2025-03-08 05:26:50,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: #res := ~retValue_acc~2; [2025-03-08 05:26:50,823 INFO L? ?]: Removed 483 outVars from TransFormulas that were not future-live. [2025-03-08 05:26:50,823 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:26:50,842 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:26:50,843 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:26:50,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:26:50 BoogieIcfgContainer [2025-03-08 05:26:50,843 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:26:50,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:26:50,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:26:50,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:26:50,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:26:48" (1/3) ... [2025-03-08 05:26:50,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2149bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:26:50, skipping insertion in model container [2025-03-08 05:26:50,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:49" (2/3) ... [2025-03-08 05:26:50,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2149bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:26:50, skipping insertion in model container [2025-03-08 05:26:50,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:26:50" (3/3) ... [2025-03-08 05:26:50,849 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product31.cil.c [2025-03-08 05:26:50,859 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:26:50,863 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product31.cil.c that has 27 procedures, 594 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:26:50,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:26:50,925 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;@55a9b8b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:26:50,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:26:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 594 states, 464 states have (on average 1.6810344827586208) internal successors, (780), 485 states have internal predecessors, (780), 102 states have call successors, (102), 26 states have call predecessors, (102), 26 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 05:26:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:26:50,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:50,949 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 05:26:50,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:50,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:50,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1105195127, now seen corresponding path program 1 times [2025-03-08 05:26:50,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:50,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058544731] [2025-03-08 05:26:50,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:50,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:51,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:26:51,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:26:51,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:51,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:26:51,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:51,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058544731] [2025-03-08 05:26:51,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058544731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:51,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:51,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:51,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262797507] [2025-03-08 05:26:51,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:51,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:51,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:51,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:51,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:51,399 INFO L87 Difference]: Start difference. First operand has 594 states, 464 states have (on average 1.6810344827586208) internal successors, (780), 485 states have internal predecessors, (780), 102 states have call successors, (102), 26 states have call predecessors, (102), 26 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-08 05:26:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:51,525 INFO L93 Difference]: Finished difference Result 1168 states and 1943 transitions. [2025-03-08 05:26:51,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:26:51,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 104 [2025-03-08 05:26:51,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:51,544 INFO L225 Difference]: With dead ends: 1168 [2025-03-08 05:26:51,544 INFO L226 Difference]: Without dead ends: 586 [2025-03-08 05:26:51,551 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-08 05:26:51,553 INFO L435 NwaCegarLoop]: 964 mSDtfsCounter, 5 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2888 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-08 05:26:51,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2888 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:51,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-08 05:26:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2025-03-08 05:26:51,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 458 states have (on average 1.6790393013100438) internal successors, (769), 477 states have internal predecessors, (769), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 05:26:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 968 transitions. [2025-03-08 05:26:51,648 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 968 transitions. Word has length 104 [2025-03-08 05:26:51,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:51,649 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 968 transitions. [2025-03-08 05:26:51,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-08 05:26:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 968 transitions. [2025-03-08 05:26:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 05:26:51,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:51,657 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:26:51,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:26:51,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:51,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:51,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1407518552, now seen corresponding path program 1 times [2025-03-08 05:26:51,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:51,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186091470] [2025-03-08 05:26:51,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:51,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:51,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 05:26:51,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:26:51,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:51,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:26:51,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:51,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186091470] [2025-03-08 05:26:51,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186091470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:51,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:51,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:51,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408558755] [2025-03-08 05:26:51,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:51,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:51,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:51,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:51,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:51,873 INFO L87 Difference]: Start difference. First operand 586 states and 968 transitions. 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, (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-08 05:26:51,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:51,940 INFO L93 Difference]: Finished difference Result 1154 states and 1913 transitions. [2025-03-08 05:26:51,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:26:51,941 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, (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 106 [2025-03-08 05:26:51,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:51,946 INFO L225 Difference]: With dead ends: 1154 [2025-03-08 05:26:51,946 INFO L226 Difference]: Without dead ends: 586 [2025-03-08 05:26:51,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:51,950 INFO L435 NwaCegarLoop]: 957 mSDtfsCounter, 4 mSDsluCounter, 1910 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2867 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-08 05:26:51,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2867 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:51,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-08 05:26:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2025-03-08 05:26:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 458 states have (on average 1.6768558951965065) internal successors, (768), 477 states have internal predecessors, (768), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 05:26:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 967 transitions. [2025-03-08 05:26:51,984 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 967 transitions. Word has length 106 [2025-03-08 05:26:51,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:51,985 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 967 transitions. [2025-03-08 05:26:51,985 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, (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-08 05:26:51,985 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 967 transitions. [2025-03-08 05:26:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 05:26:51,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:51,990 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 05:26:51,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:26:51,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:51,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:51,991 INFO L85 PathProgramCache]: Analyzing trace with hash 514334696, now seen corresponding path program 1 times [2025-03-08 05:26:51,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:51,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369303862] [2025-03-08 05:26:51,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:51,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:52,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 05:26:52,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 05:26:52,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:52,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:26:52,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:52,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369303862] [2025-03-08 05:26:52,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369303862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:52,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:52,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:52,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558014224] [2025-03-08 05:26:52,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:52,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:52,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:52,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:52,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:52,164 INFO L87 Difference]: Start difference. First operand 586 states and 967 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (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-08 05:26:52,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:52,214 INFO L93 Difference]: Finished difference Result 1154 states and 1912 transitions. [2025-03-08 05:26:52,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:26:52,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (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 107 [2025-03-08 05:26:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:52,220 INFO L225 Difference]: With dead ends: 1154 [2025-03-08 05:26:52,220 INFO L226 Difference]: Without dead ends: 586 [2025-03-08 05:26:52,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:52,225 INFO L435 NwaCegarLoop]: 957 mSDtfsCounter, 3 mSDsluCounter, 1910 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2867 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-08 05:26:52,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2867 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:52,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-08 05:26:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2025-03-08 05:26:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 458 states have (on average 1.6746724890829694) internal successors, (767), 477 states have internal predecessors, (767), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 05:26:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 966 transitions. [2025-03-08 05:26:52,255 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 966 transitions. Word has length 107 [2025-03-08 05:26:52,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:52,256 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 966 transitions. [2025-03-08 05:26:52,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (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-08 05:26:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 966 transitions. [2025-03-08 05:26:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:26:52,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:52,259 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 05:26:52,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:26:52,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:52,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:52,260 INFO L85 PathProgramCache]: Analyzing trace with hash -227340645, now seen corresponding path program 1 times [2025-03-08 05:26:52,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:52,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141489611] [2025-03-08 05:26:52,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:52,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:52,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:26:52,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:26:52,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:52,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:26:52,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:52,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141489611] [2025-03-08 05:26:52,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141489611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:52,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:52,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:52,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711373937] [2025-03-08 05:26:52,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:52,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:52,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:52,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:52,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:52,459 INFO L87 Difference]: Start difference. First operand 586 states and 966 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (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-08 05:26:52,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:52,497 INFO L93 Difference]: Finished difference Result 1154 states and 1911 transitions. [2025-03-08 05:26:52,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:26:52,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (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 108 [2025-03-08 05:26:52,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:52,501 INFO L225 Difference]: With dead ends: 1154 [2025-03-08 05:26:52,502 INFO L226 Difference]: Without dead ends: 586 [2025-03-08 05:26:52,504 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-08 05:26:52,505 INFO L435 NwaCegarLoop]: 957 mSDtfsCounter, 2 mSDsluCounter, 1910 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2867 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-08 05:26:52,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2867 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:52,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-08 05:26:52,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2025-03-08 05:26:52,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 458 states have (on average 1.6724890829694323) internal successors, (766), 477 states have internal predecessors, (766), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 05:26:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 965 transitions. [2025-03-08 05:26:52,527 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 965 transitions. Word has length 108 [2025-03-08 05:26:52,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:52,528 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 965 transitions. [2025-03-08 05:26:52,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (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-08 05:26:52,528 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 965 transitions. [2025-03-08 05:26:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:26:52,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:52,531 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 05:26:52,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:26:52,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:52,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:52,532 INFO L85 PathProgramCache]: Analyzing trace with hash -567219317, now seen corresponding path program 1 times [2025-03-08 05:26:52,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:52,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002837153] [2025-03-08 05:26:52,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:52,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:26:52,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:26:52,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:52,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:26:52,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002837153] [2025-03-08 05:26:52,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002837153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:52,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:52,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:52,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844559405] [2025-03-08 05:26:52,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:52,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:52,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:52,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:52,659 INFO L87 Difference]: Start difference. First operand 586 states and 965 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, (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-08 05:26:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:52,698 INFO L93 Difference]: Finished difference Result 1154 states and 1910 transitions. [2025-03-08 05:26:52,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:26:52,699 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, (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 109 [2025-03-08 05:26:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:52,704 INFO L225 Difference]: With dead ends: 1154 [2025-03-08 05:26:52,704 INFO L226 Difference]: Without dead ends: 586 [2025-03-08 05:26:52,706 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-08 05:26:52,707 INFO L435 NwaCegarLoop]: 957 mSDtfsCounter, 1 mSDsluCounter, 1910 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2867 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-08 05:26:52,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2867 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-08 05:26:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2025-03-08 05:26:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 458 states have (on average 1.6703056768558953) internal successors, (765), 477 states have internal predecessors, (765), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 05:26:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 964 transitions. [2025-03-08 05:26:52,724 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 964 transitions. Word has length 109 [2025-03-08 05:26:52,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:52,724 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 964 transitions. [2025-03-08 05:26:52,724 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, (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-08 05:26:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 964 transitions. [2025-03-08 05:26:52,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:26:52,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:52,727 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 05:26:52,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:26:52,727 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:52,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:52,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1336303138, now seen corresponding path program 1 times [2025-03-08 05:26:52,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:52,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705372932] [2025-03-08 05:26:52,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:52,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:52,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:26:52,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:26:52,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:52,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:26:52,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:52,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705372932] [2025-03-08 05:26:52,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705372932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:52,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:52,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:26:52,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564105987] [2025-03-08 05:26:52,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:52,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:26:52,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:52,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:26:52,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:26:52,956 INFO L87 Difference]: Start difference. First operand 586 states and 964 transitions. Second operand has 9 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:26:53,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:53,063 INFO L93 Difference]: Finished difference Result 1120 states and 1842 transitions. [2025-03-08 05:26:53,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:26:53,064 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-03-08 05:26:53,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:53,068 INFO L225 Difference]: With dead ends: 1120 [2025-03-08 05:26:53,068 INFO L226 Difference]: Without dead ends: 601 [2025-03-08 05:26:53,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:26:53,072 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 91 mSDsluCounter, 6581 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7533 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:53,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7533 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:26:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-08 05:26:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 599. [2025-03-08 05:26:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 468 states have (on average 1.6666666666666667) internal successors, (780), 489 states have internal predecessors, (780), 103 states have call successors, (103), 26 states have call predecessors, (103), 27 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2025-03-08 05:26:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 983 transitions. [2025-03-08 05:26:53,095 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 983 transitions. Word has length 110 [2025-03-08 05:26:53,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:53,096 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 983 transitions. [2025-03-08 05:26:53,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:26:53,096 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 983 transitions. [2025-03-08 05:26:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:26:53,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:53,100 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 05:26:53,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:26:53,100 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:53,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:53,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1778057633, now seen corresponding path program 1 times [2025-03-08 05:26:53,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:53,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041040353] [2025-03-08 05:26:53,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:53,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:53,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:26:53,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:26:53,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:53,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:26:53,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:53,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041040353] [2025-03-08 05:26:53,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041040353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:53,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:53,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:53,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454781904] [2025-03-08 05:26:53,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:53,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:53,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:53,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:53,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:53,205 INFO L87 Difference]: Start difference. First operand 599 states and 983 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, (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-08 05:26:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:53,239 INFO L93 Difference]: Finished difference Result 1172 states and 1936 transitions. [2025-03-08 05:26:53,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:26:53,239 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, (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 110 [2025-03-08 05:26:53,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:53,243 INFO L225 Difference]: With dead ends: 1172 [2025-03-08 05:26:53,243 INFO L226 Difference]: Without dead ends: 580 [2025-03-08 05:26:53,245 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-08 05:26:53,246 INFO L435 NwaCegarLoop]: 958 mSDtfsCounter, 0 mSDsluCounter, 1911 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2869 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-08 05:26:53,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2869 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:53,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-08 05:26:53,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-03-08 05:26:53,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 452 states have (on average 1.6615044247787611) internal successors, (751), 471 states have internal predecessors, (751), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 05:26:53,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 950 transitions. [2025-03-08 05:26:53,267 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 950 transitions. Word has length 110 [2025-03-08 05:26:53,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:53,267 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 950 transitions. [2025-03-08 05:26:53,267 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, (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-08 05:26:53,267 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 950 transitions. [2025-03-08 05:26:53,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 05:26:53,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:53,270 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 05:26:53,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:26:53,270 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:53,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:53,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1431446277, now seen corresponding path program 1 times [2025-03-08 05:26:53,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:53,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764633109] [2025-03-08 05:26:53,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:53,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:53,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 05:26:53,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 05:26:53,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:53,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:53,435 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:26:53,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:53,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764633109] [2025-03-08 05:26:53,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764633109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:53,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:53,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:53,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624596094] [2025-03-08 05:26:53,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:53,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:53,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:53,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:53,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:53,436 INFO L87 Difference]: Start difference. First operand 580 states and 950 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:26:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:53,613 INFO L93 Difference]: Finished difference Result 1117 states and 1834 transitions. [2025-03-08 05:26:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:26:53,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2025-03-08 05:26:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:53,618 INFO L225 Difference]: With dead ends: 1117 [2025-03-08 05:26:53,618 INFO L226 Difference]: Without dead ends: 589 [2025-03-08 05:26:53,620 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-08 05:26:53,621 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 55 mSDsluCounter, 3599 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4506 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-08 05:26:53,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4506 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:26:53,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-08 05:26:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 580. [2025-03-08 05:26:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 452 states have (on average 1.6526548672566372) internal successors, (747), 471 states have internal predecessors, (747), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 05:26:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 946 transitions. [2025-03-08 05:26:53,637 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 946 transitions. Word has length 111 [2025-03-08 05:26:53,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:53,638 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 946 transitions. [2025-03-08 05:26:53,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:26:53,638 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 946 transitions. [2025-03-08 05:26:53,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:26:53,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:53,641 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 05:26:53,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:26:53,641 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:53,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:53,642 INFO L85 PathProgramCache]: Analyzing trace with hash 522353735, now seen corresponding path program 1 times [2025-03-08 05:26:53,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:53,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457037243] [2025-03-08 05:26:53,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:53,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:53,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:26:53,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:26:53,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:53,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:26:53,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:53,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457037243] [2025-03-08 05:26:53,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457037243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:53,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:53,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:53,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918520381] [2025-03-08 05:26:53,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:53,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:53,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:53,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:53,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:53,761 INFO L87 Difference]: Start difference. First operand 580 states and 946 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:26:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:53,906 INFO L93 Difference]: Finished difference Result 1117 states and 1830 transitions. [2025-03-08 05:26:53,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:26:53,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 112 [2025-03-08 05:26:53,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:53,911 INFO L225 Difference]: With dead ends: 1117 [2025-03-08 05:26:53,911 INFO L226 Difference]: Without dead ends: 589 [2025-03-08 05:26:53,914 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-08 05:26:53,915 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 54 mSDsluCounter, 3599 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4506 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-08 05:26:53,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4506 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:26:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-08 05:26:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 580. [2025-03-08 05:26:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 452 states have (on average 1.6438053097345133) internal successors, (743), 471 states have internal predecessors, (743), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 05:26:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 942 transitions. [2025-03-08 05:26:53,931 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 942 transitions. Word has length 112 [2025-03-08 05:26:53,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:53,931 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 942 transitions. [2025-03-08 05:26:53,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:26:53,931 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 942 transitions. [2025-03-08 05:26:53,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 05:26:53,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:53,934 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 05:26:53,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:26:53,934 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:53,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:53,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1579882856, now seen corresponding path program 1 times [2025-03-08 05:26:53,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:53,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704173483] [2025-03-08 05:26:53,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:53,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:53,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:26:53,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:26:53,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:53,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:26:54,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:54,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704173483] [2025-03-08 05:26:54,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704173483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:54,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:54,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:54,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266188720] [2025-03-08 05:26:54,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:54,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:54,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:54,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:54,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:54,033 INFO L87 Difference]: Start difference. First operand 580 states and 942 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:26:54,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:54,180 INFO L93 Difference]: Finished difference Result 1117 states and 1826 transitions. [2025-03-08 05:26:54,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:26:54,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2025-03-08 05:26:54,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:54,184 INFO L225 Difference]: With dead ends: 1117 [2025-03-08 05:26:54,184 INFO L226 Difference]: Without dead ends: 589 [2025-03-08 05:26:54,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:54,186 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 53 mSDsluCounter, 3582 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4488 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-08 05:26:54,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4488 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:26:54,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-08 05:26:54,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 580. [2025-03-08 05:26:54,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 452 states have (on average 1.6349557522123894) internal successors, (739), 471 states have internal predecessors, (739), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 05:26:54,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 938 transitions. [2025-03-08 05:26:54,200 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 938 transitions. Word has length 113 [2025-03-08 05:26:54,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:54,201 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 938 transitions. [2025-03-08 05:26:54,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:26:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 938 transitions. [2025-03-08 05:26:54,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 05:26:54,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:54,203 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 05:26:54,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:26:54,203 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:54,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:54,204 INFO L85 PathProgramCache]: Analyzing trace with hash 705391305, now seen corresponding path program 1 times [2025-03-08 05:26:54,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:54,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785799179] [2025-03-08 05:26:54,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:54,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:54,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:26:54,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:26:54,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:54,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:26:54,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:54,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785799179] [2025-03-08 05:26:54,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785799179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:54,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:54,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:26:54,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555158136] [2025-03-08 05:26:54,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:54,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:26:54,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:54,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:26:54,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:54,345 INFO L87 Difference]: Start difference. First operand 580 states and 938 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:26:54,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:54,408 INFO L93 Difference]: Finished difference Result 1108 states and 1808 transitions. [2025-03-08 05:26:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:26:54,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2025-03-08 05:26:54,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:54,412 INFO L225 Difference]: With dead ends: 1108 [2025-03-08 05:26:54,412 INFO L226 Difference]: Without dead ends: 559 [2025-03-08 05:26:54,415 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-08 05:26:54,415 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 84 mSDsluCounter, 4562 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5489 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-08 05:26:54,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5489 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:54,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-08 05:26:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2025-03-08 05:26:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 431 states have (on average 1.6357308584686774) internal successors, (705), 450 states have internal predecessors, (705), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 05:26:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 904 transitions. [2025-03-08 05:26:54,431 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 904 transitions. Word has length 113 [2025-03-08 05:26:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:54,431 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 904 transitions. [2025-03-08 05:26:54,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:26:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 904 transitions. [2025-03-08 05:26:54,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:26:54,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:54,434 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 05:26:54,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:26:54,435 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:54,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:54,436 INFO L85 PathProgramCache]: Analyzing trace with hash -570235260, now seen corresponding path program 1 times [2025-03-08 05:26:54,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:54,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153128045] [2025-03-08 05:26:54,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:54,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:54,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:26:54,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:26:54,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:54,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:26:54,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:54,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153128045] [2025-03-08 05:26:54,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153128045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:54,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:54,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:54,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084212152] [2025-03-08 05:26:54,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:54,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:54,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:54,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:54,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:54,536 INFO L87 Difference]: Start difference. First operand 559 states and 904 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:26:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:54,603 INFO L93 Difference]: Finished difference Result 1087 states and 1774 transitions. [2025-03-08 05:26:54,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:26:54,604 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2025-03-08 05:26:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:54,607 INFO L225 Difference]: With dead ends: 1087 [2025-03-08 05:26:54,607 INFO L226 Difference]: Without dead ends: 559 [2025-03-08 05:26:54,609 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-08 05:26:54,610 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 17 mSDsluCounter, 3539 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4426 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-08 05:26:54,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4426 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-08 05:26:54,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2025-03-08 05:26:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 431 states have (on average 1.6334106728538282) internal successors, (704), 450 states have internal predecessors, (704), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 05:26:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 903 transitions. [2025-03-08 05:26:54,626 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 903 transitions. Word has length 114 [2025-03-08 05:26:54,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:54,626 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 903 transitions. [2025-03-08 05:26:54,626 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:26:54,626 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 903 transitions. [2025-03-08 05:26:54,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:26:54,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:54,629 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 05:26:54,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:26:54,629 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:54,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:54,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1876425675, now seen corresponding path program 1 times [2025-03-08 05:26:54,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:54,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110716490] [2025-03-08 05:26:54,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:54,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:54,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:26:54,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:26:54,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:54,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:54,745 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:26:54,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:54,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110716490] [2025-03-08 05:26:54,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110716490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:54,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:54,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:54,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192657823] [2025-03-08 05:26:54,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:54,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:54,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:54,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:54,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:54,746 INFO L87 Difference]: Start difference. First operand 559 states and 903 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:26:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:54,806 INFO L93 Difference]: Finished difference Result 1087 states and 1773 transitions. [2025-03-08 05:26:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:26:54,807 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2025-03-08 05:26:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:54,811 INFO L225 Difference]: With dead ends: 1087 [2025-03-08 05:26:54,811 INFO L226 Difference]: Without dead ends: 559 [2025-03-08 05:26:54,814 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-08 05:26:54,814 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 16 mSDsluCounter, 3539 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4426 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-08 05:26:54,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4426 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-08 05:26:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2025-03-08 05:26:54,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 431 states have (on average 1.631090487238979) internal successors, (703), 450 states have internal predecessors, (703), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 05:26:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 902 transitions. [2025-03-08 05:26:54,830 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 902 transitions. Word has length 115 [2025-03-08 05:26:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:54,830 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 902 transitions. [2025-03-08 05:26:54,830 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:26:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 902 transitions. [2025-03-08 05:26:54,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:26:54,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:54,833 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 05:26:54,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:26:54,833 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:54,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1959150399, now seen corresponding path program 1 times [2025-03-08 05:26:54,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:54,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667580731] [2025-03-08 05:26:54,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:54,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:54,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:26:54,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:26:54,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:54,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:55,019 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:26:55,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:55,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667580731] [2025-03-08 05:26:55,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667580731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:55,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:55,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:26:55,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426567990] [2025-03-08 05:26:55,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:55,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:26:55,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:55,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:26:55,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:26:55,020 INFO L87 Difference]: Start difference. First operand 559 states and 902 transitions. Second operand has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:26:55,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:55,110 INFO L93 Difference]: Finished difference Result 1081 states and 1761 transitions. [2025-03-08 05:26:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:26:55,111 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2025-03-08 05:26:55,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:55,114 INFO L225 Difference]: With dead ends: 1081 [2025-03-08 05:26:55,115 INFO L226 Difference]: Without dead ends: 559 [2025-03-08 05:26:55,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:26:55,117 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 6 mSDsluCounter, 7066 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7952 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:55,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7952 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:26:55,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-08 05:26:55,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2025-03-08 05:26:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 431 states have (on average 1.62877030162413) internal successors, (702), 450 states have internal predecessors, (702), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-08 05:26:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 901 transitions. [2025-03-08 05:26:55,134 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 901 transitions. Word has length 116 [2025-03-08 05:26:55,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:55,134 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 901 transitions. [2025-03-08 05:26:55,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:26:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 901 transitions. [2025-03-08 05:26:55,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:26:55,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:55,138 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 05:26:55,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:26:55,138 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:55,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:55,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1367745442, now seen corresponding path program 1 times [2025-03-08 05:26:55,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:55,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175658142] [2025-03-08 05:26:55,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:55,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:55,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:26:55,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:26:55,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:55,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:26:55,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:55,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175658142] [2025-03-08 05:26:55,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175658142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:26:55,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563980176] [2025-03-08 05:26:55,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:55,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:26:55,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:26:55,273 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-08 05:26:55,275 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-08 05:26:55,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:26:55,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:26:55,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:55,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:55,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:26:55,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:26:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:26:55,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:26:55,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563980176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:55,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:26:55,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 05:26:55,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157794423] [2025-03-08 05:26:55,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:55,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:26:55,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:55,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:26:55,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:26:55,670 INFO L87 Difference]: Start difference. First operand 559 states and 901 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:26:56,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:56,151 INFO L93 Difference]: Finished difference Result 1081 states and 1786 transitions. [2025-03-08 05:26:56,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:26:56,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2025-03-08 05:26:56,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:56,156 INFO L225 Difference]: With dead ends: 1081 [2025-03-08 05:26:56,156 INFO L226 Difference]: Without dead ends: 567 [2025-03-08 05:26:56,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:26:56,160 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 864 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:56,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 2257 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:26:56,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-08 05:26:56,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-03-08 05:26:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 438 states have (on average 1.63013698630137) internal successors, (714), 457 states have internal predecessors, (714), 102 states have call successors, (102), 27 states have call predecessors, (102), 26 states have return successors, (98), 95 states have call predecessors, (98), 97 states have call successors, (98) [2025-03-08 05:26:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 914 transitions. [2025-03-08 05:26:56,180 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 914 transitions. Word has length 117 [2025-03-08 05:26:56,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:56,181 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 914 transitions. [2025-03-08 05:26:56,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:26:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 914 transitions. [2025-03-08 05:26:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:26:56,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:56,184 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-08 05:26:56,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:26:56,389 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-08 05:26:56,389 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:56,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:56,390 INFO L85 PathProgramCache]: Analyzing trace with hash 647746638, now seen corresponding path program 1 times [2025-03-08 05:26:56,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:56,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69785729] [2025-03-08 05:26:56,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:56,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:56,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:26:56,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:26:56,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:56,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:26:56,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:56,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69785729] [2025-03-08 05:26:56,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69785729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:26:56,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791546051] [2025-03-08 05:26:56,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:56,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:26:56,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:26:56,535 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-08 05:26:56,536 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-08 05:26:56,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:26:56,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:26:56,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:56,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:56,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:26:56,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:26:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:26:56,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:26:56,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791546051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:56,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:26:56,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 05:26:56,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861857680] [2025-03-08 05:26:56,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:56,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:26:56,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:56,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:26:56,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:26:56,870 INFO L87 Difference]: Start difference. First operand 567 states and 914 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:26:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:57,320 INFO L93 Difference]: Finished difference Result 1097 states and 1809 transitions. [2025-03-08 05:26:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:26:57,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-03-08 05:26:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:57,325 INFO L225 Difference]: With dead ends: 1097 [2025-03-08 05:26:57,325 INFO L226 Difference]: Without dead ends: 575 [2025-03-08 05:26:57,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 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-08 05:26:57,328 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 858 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:57,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 2254 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:26:57,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-08 05:26:57,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2025-03-08 05:26:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 445 states have (on average 1.6314606741573034) internal successors, (726), 464 states have internal predecessors, (726), 102 states have call successors, (102), 28 states have call predecessors, (102), 27 states have return successors, (99), 95 states have call predecessors, (99), 97 states have call successors, (99) [2025-03-08 05:26:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 927 transitions. [2025-03-08 05:26:57,344 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 927 transitions. Word has length 119 [2025-03-08 05:26:57,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:57,344 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 927 transitions. [2025-03-08 05:26:57,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:26:57,345 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 927 transitions. [2025-03-08 05:26:57,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:26:57,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:57,347 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:26:57,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:26:57,547 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-08 05:26:57,548 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:57,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1150431998, now seen corresponding path program 1 times [2025-03-08 05:26:57,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:57,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80106180] [2025-03-08 05:26:57,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:57,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:57,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:26:57,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:26:57,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:57,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:57,671 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:26:57,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:57,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80106180] [2025-03-08 05:26:57,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80106180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:26:57,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169016438] [2025-03-08 05:26:57,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:57,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:26:57,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:26:57,676 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-08 05:26:57,677 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-08 05:26:57,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:26:57,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:26:57,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:57,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:57,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 1443 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:26:57,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:26:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:26:58,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:26:58,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169016438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:58,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:26:58,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 05:26:58,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380118876] [2025-03-08 05:26:58,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:58,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:26:58,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:58,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:26:58,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:26:58,001 INFO L87 Difference]: Start difference. First operand 575 states and 927 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:26:58,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:58,453 INFO L93 Difference]: Finished difference Result 1113 states and 1832 transitions. [2025-03-08 05:26:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:26:58,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2025-03-08 05:26:58,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:58,458 INFO L225 Difference]: With dead ends: 1113 [2025-03-08 05:26:58,458 INFO L226 Difference]: Without dead ends: 583 [2025-03-08 05:26:58,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 119 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-08 05:26:58,460 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 852 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 2251 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:58,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 2251 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:26:58,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-08 05:26:58,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2025-03-08 05:26:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 452 states have (on average 1.6327433628318584) internal successors, (738), 471 states have internal predecessors, (738), 102 states have call successors, (102), 29 states have call predecessors, (102), 28 states have return successors, (100), 95 states have call predecessors, (100), 97 states have call successors, (100) [2025-03-08 05:26:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 940 transitions. [2025-03-08 05:26:58,481 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 940 transitions. Word has length 121 [2025-03-08 05:26:58,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:58,482 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 940 transitions. [2025-03-08 05:26:58,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:26:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 940 transitions. [2025-03-08 05:26:58,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 05:26:58,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:58,485 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:26:58,495 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-08 05:26:58,689 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-08 05:26:58,689 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:58,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:58,690 INFO L85 PathProgramCache]: Analyzing trace with hash 94153044, now seen corresponding path program 1 times [2025-03-08 05:26:58,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:58,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526667889] [2025-03-08 05:26:58,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:58,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:58,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:26:58,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:26:58,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:58,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:26:58,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:58,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526667889] [2025-03-08 05:26:58,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526667889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:26:58,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465527201] [2025-03-08 05:26:58,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:58,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:26:58,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:26:58,835 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-08 05:26:58,837 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-08 05:26:58,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:26:59,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:26:59,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:59,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:59,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:26:59,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:26:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:26:59,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:26:59,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465527201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:59,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:26:59,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 05:26:59,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975773531] [2025-03-08 05:26:59,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:59,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:26:59,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:59,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:26:59,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:26:59,214 INFO L87 Difference]: Start difference. First operand 583 states and 940 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:26:59,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:59,627 INFO L93 Difference]: Finished difference Result 1129 states and 1855 transitions. [2025-03-08 05:26:59,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:26:59,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2025-03-08 05:26:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:59,632 INFO L225 Difference]: With dead ends: 1129 [2025-03-08 05:26:59,632 INFO L226 Difference]: Without dead ends: 591 [2025-03-08 05:26:59,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 121 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-08 05:26:59,634 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 846 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 2248 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:59,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 2248 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:26:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-08 05:26:59,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-03-08 05:26:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 459 states have (on average 1.6339869281045751) internal successors, (750), 478 states have internal predecessors, (750), 102 states have call successors, (102), 30 states have call predecessors, (102), 29 states have return successors, (101), 95 states have call predecessors, (101), 97 states have call successors, (101) [2025-03-08 05:26:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 953 transitions. [2025-03-08 05:26:59,650 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 953 transitions. Word has length 123 [2025-03-08 05:26:59,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:59,650 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 953 transitions. [2025-03-08 05:26:59,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:26:59,651 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 953 transitions. [2025-03-08 05:26:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 05:26:59,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:59,653 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] [2025-03-08 05:26:59,661 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-08 05:26:59,857 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-08 05:26:59,857 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:59,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:59,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2102293470, now seen corresponding path program 1 times [2025-03-08 05:26:59,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:59,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761415033] [2025-03-08 05:26:59,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:59,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:59,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:26:59,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:26:59,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:59,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:59,935 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:26:59,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:59,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761415033] [2025-03-08 05:26:59,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761415033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:26:59,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114638940] [2025-03-08 05:26:59,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:59,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:26:59,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:26:59,938 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-08 05:26:59,940 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-08 05:27:00,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:27:00,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:27:00,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:00,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:00,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:27:00,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:27:00,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:00,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114638940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:00,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:00,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 05:27:00,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727639568] [2025-03-08 05:27:00,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:00,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:27:00,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:00,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:27:00,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:27:00,309 INFO L87 Difference]: Start difference. First operand 591 states and 953 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:27:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:00,714 INFO L93 Difference]: Finished difference Result 638 states and 1023 transitions. [2025-03-08 05:27:00,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:00,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 125 [2025-03-08 05:27:00,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:00,720 INFO L225 Difference]: With dead ends: 638 [2025-03-08 05:27:00,720 INFO L226 Difference]: Without dead ends: 623 [2025-03-08 05:27:00,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:27:00,721 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 876 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:00,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 2281 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:27:00,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-03-08 05:27:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 593. [2025-03-08 05:27:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 461 states have (on average 1.6312364425162689) internal successors, (752), 480 states have internal predecessors, (752), 102 states have call successors, (102), 30 states have call predecessors, (102), 29 states have return successors, (101), 95 states have call predecessors, (101), 97 states have call successors, (101) [2025-03-08 05:27:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 955 transitions. [2025-03-08 05:27:00,740 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 955 transitions. Word has length 125 [2025-03-08 05:27:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:00,740 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 955 transitions. [2025-03-08 05:27:00,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:27:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 955 transitions. [2025-03-08 05:27:00,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:27:00,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:00,743 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] [2025-03-08 05:27:00,751 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-08 05:27:00,947 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-08 05:27:00,947 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:00,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:00,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1357930080, now seen corresponding path program 1 times [2025-03-08 05:27:00,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:00,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115085033] [2025-03-08 05:27:00,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:00,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:00,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:27:00,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:27:00,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:00,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:27:01,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:01,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115085033] [2025-03-08 05:27:01,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115085033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:01,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909661899] [2025-03-08 05:27:01,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:01,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:01,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:01,036 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-08 05:27:01,038 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-08 05:27:01,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:27:01,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:27:01,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:01,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:01,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 1461 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 05:27:01,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:27:01,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:01,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909661899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:01,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:01,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-08 05:27:01,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129973094] [2025-03-08 05:27:01,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:01,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:27:01,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:01,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:27:01,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:27:01,324 INFO L87 Difference]: Start difference. First operand 593 states and 955 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 05:27:01,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:01,352 INFO L93 Difference]: Finished difference Result 608 states and 973 transitions. [2025-03-08 05:27:01,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:01,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) Word has length 131 [2025-03-08 05:27:01,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:01,358 INFO L225 Difference]: With dead ends: 608 [2025-03-08 05:27:01,359 INFO L226 Difference]: Without dead ends: 593 [2025-03-08 05:27:01,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:27:01,360 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 0 mSDsluCounter, 2690 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3588 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-08 05:27:01,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3588 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-08 05:27:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2025-03-08 05:27:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 461 states have (on average 1.6290672451193058) internal successors, (751), 480 states have internal predecessors, (751), 102 states have call successors, (102), 30 states have call predecessors, (102), 29 states have return successors, (101), 95 states have call predecessors, (101), 97 states have call successors, (101) [2025-03-08 05:27:01,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 954 transitions. [2025-03-08 05:27:01,384 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 954 transitions. Word has length 131 [2025-03-08 05:27:01,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:01,385 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 954 transitions. [2025-03-08 05:27:01,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 05:27:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 954 transitions. [2025-03-08 05:27:01,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 05:27:01,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:01,388 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] [2025-03-08 05:27:01,398 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-08 05:27:01,593 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-08 05:27:01,593 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:01,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2114091437, now seen corresponding path program 1 times [2025-03-08 05:27:01,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:01,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691698342] [2025-03-08 05:27:01,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:01,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:01,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:27:01,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:27:01,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:01,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:27:01,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:01,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691698342] [2025-03-08 05:27:01,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691698342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:01,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897341152] [2025-03-08 05:27:01,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:01,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:01,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:01,682 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-08 05:27:01,684 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-08 05:27:01,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:27:01,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:27:01,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:01,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:01,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 1497 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:27:01,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:02,004 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-08 05:27:02,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:02,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897341152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:02,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:02,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-08 05:27:02,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116884065] [2025-03-08 05:27:02,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:02,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:27:02,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:02,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:27:02,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:27:02,007 INFO L87 Difference]: Start difference. First operand 593 states and 954 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:27:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:02,402 INFO L93 Difference]: Finished difference Result 1143 states and 1884 transitions. [2025-03-08 05:27:02,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:27:02,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2025-03-08 05:27:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:02,406 INFO L225 Difference]: With dead ends: 1143 [2025-03-08 05:27:02,407 INFO L226 Difference]: Without dead ends: 595 [2025-03-08 05:27:02,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:27:02,409 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 841 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:02,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 2245 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:27:02,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-08 05:27:02,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-03-08 05:27:02,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 462 states have (on average 1.619047619047619) internal successors, (748), 482 states have internal predecessors, (748), 102 states have call successors, (102), 30 states have call predecessors, (102), 30 states have return successors, (102), 95 states have call predecessors, (102), 97 states have call successors, (102) [2025-03-08 05:27:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 952 transitions. [2025-03-08 05:27:02,431 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 952 transitions. Word has length 141 [2025-03-08 05:27:02,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:02,431 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 952 transitions. [2025-03-08 05:27:02,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:27:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 952 transitions. [2025-03-08 05:27:02,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 05:27:02,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:02,434 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] [2025-03-08 05:27:02,443 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-08 05:27:02,639 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-08 05:27:02,639 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:02,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:02,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2030058861, now seen corresponding path program 1 times [2025-03-08 05:27:02,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:02,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704371399] [2025-03-08 05:27:02,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:02,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:02,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:27:02,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:27:02,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:02,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:02,848 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-08 05:27:02,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:02,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704371399] [2025-03-08 05:27:02,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704371399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:02,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565983955] [2025-03-08 05:27:02,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:02,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:02,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:02,851 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-08 05:27:02,853 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-08 05:27:02,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:27:03,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:27:03,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:03,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:03,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 1499 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 05:27:03,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:03,202 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-08 05:27:03,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:03,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565983955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:03,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:03,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-03-08 05:27:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219626954] [2025-03-08 05:27:03,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:03,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:03,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:03,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:03,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:27:03,203 INFO L87 Difference]: Start difference. First operand 595 states and 952 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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-08 05:27:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:05,197 INFO L93 Difference]: Finished difference Result 1877 states and 3071 transitions. [2025-03-08 05:27:05,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:27:05,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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 141 [2025-03-08 05:27:05,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:05,206 INFO L225 Difference]: With dead ends: 1877 [2025-03-08 05:27:05,206 INFO L226 Difference]: Without dead ends: 1327 [2025-03-08 05:27:05,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 147 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-08 05:27:05,210 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 2215 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 3579 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2305 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 4082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 3579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:05,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2305 Valid, 2026 Invalid, 4082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 3579 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 05:27:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2025-03-08 05:27:05,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1240. [2025-03-08 05:27:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 962 states have (on average 1.62993762993763) internal successors, (1568), 1001 states have internal predecessors, (1568), 212 states have call successors, (212), 58 states have call predecessors, (212), 65 states have return successors, (240), 205 states have call predecessors, (240), 207 states have call successors, (240) [2025-03-08 05:27:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 2020 transitions. [2025-03-08 05:27:05,279 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 2020 transitions. Word has length 141 [2025-03-08 05:27:05,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:05,279 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 2020 transitions. [2025-03-08 05:27:05,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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-08 05:27:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 2020 transitions. [2025-03-08 05:27:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 05:27:05,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:05,284 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] [2025-03-08 05:27:05,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 05:27:05,484 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-08 05:27:05,485 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:05,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:05,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1876176903, now seen corresponding path program 1 times [2025-03-08 05:27:05,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:05,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073291753] [2025-03-08 05:27:05,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:05,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:05,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 05:27:05,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 05:27:05,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:05,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:05,704 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-08 05:27:05,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:05,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073291753] [2025-03-08 05:27:05,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073291753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:05,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128851038] [2025-03-08 05:27:05,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:05,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:05,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:05,707 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-08 05:27:05,709 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-08 05:27:05,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 05:27:05,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 05:27:05,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:05,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:05,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 1516 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:27:05,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:05,952 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-08 05:27:05,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:05,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128851038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:05,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:05,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2025-03-08 05:27:05,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595615936] [2025-03-08 05:27:05,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:05,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:27:05,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:05,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:27:05,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:27:05,954 INFO L87 Difference]: Start difference. First operand 1240 states and 2020 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-08 05:27:06,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:06,019 INFO L93 Difference]: Finished difference Result 3004 states and 4948 transitions. [2025-03-08 05:27:06,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:27:06,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 146 [2025-03-08 05:27:06,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:06,031 INFO L225 Difference]: With dead ends: 3004 [2025-03-08 05:27:06,031 INFO L226 Difference]: Without dead ends: 1812 [2025-03-08 05:27:06,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 152 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-08 05:27:06,036 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 840 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 2503 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-08 05:27:06,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 2503 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2025-03-08 05:27:06,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1238. [2025-03-08 05:27:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 961 states have (on average 1.6295525494276795) internal successors, (1566), 999 states have internal predecessors, (1566), 212 states have call successors, (212), 58 states have call predecessors, (212), 64 states have return successors, (234), 205 states have call predecessors, (234), 207 states have call successors, (234) [2025-03-08 05:27:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 2012 transitions. [2025-03-08 05:27:06,085 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 2012 transitions. Word has length 146 [2025-03-08 05:27:06,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:06,085 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 2012 transitions. [2025-03-08 05:27:06,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-08 05:27:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 2012 transitions. [2025-03-08 05:27:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 05:27:06,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:06,088 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] [2025-03-08 05:27:06,096 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-08 05:27:06,292 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-08 05:27:06,292 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:06,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:06,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2000250150, now seen corresponding path program 1 times [2025-03-08 05:27:06,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:06,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967630275] [2025-03-08 05:27:06,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:06,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:06,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 05:27:06,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 05:27:06,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:06,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:06,517 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-08 05:27:06,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:06,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967630275] [2025-03-08 05:27:06,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967630275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:06,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533406017] [2025-03-08 05:27:06,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:06,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:06,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:06,520 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-08 05:27:06,521 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-08 05:27:06,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 05:27:06,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 05:27:06,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:06,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:06,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 1515 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:27:06,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:06,843 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-08 05:27:06,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:06,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533406017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:06,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:06,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-08 05:27:06,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372295549] [2025-03-08 05:27:06,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:06,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:06,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:06,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:06,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:27:06,845 INFO L87 Difference]: Start difference. First operand 1238 states and 2012 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-08 05:27:08,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:08,202 INFO L93 Difference]: Finished difference Result 3887 states and 6446 transitions. [2025-03-08 05:27:08,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:08,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 146 [2025-03-08 05:27:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:08,220 INFO L225 Difference]: With dead ends: 3887 [2025-03-08 05:27:08,220 INFO L226 Difference]: Without dead ends: 2694 [2025-03-08 05:27:08,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 152 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-08 05:27:08,227 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 1998 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2082 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:08,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2082 Valid, 912 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 05:27:08,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2025-03-08 05:27:08,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2607. [2025-03-08 05:27:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2607 states, 1995 states have (on average 1.6330827067669174) internal successors, (3258), 2082 states have internal predecessors, (3258), 479 states have call successors, (479), 111 states have call predecessors, (479), 132 states have return successors, (580), 473 states have call predecessors, (580), 474 states have call successors, (580) [2025-03-08 05:27:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 4317 transitions. [2025-03-08 05:27:08,344 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 4317 transitions. Word has length 146 [2025-03-08 05:27:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:08,345 INFO L471 AbstractCegarLoop]: Abstraction has 2607 states and 4317 transitions. [2025-03-08 05:27:08,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-08 05:27:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 4317 transitions. [2025-03-08 05:27:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 05:27:08,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:08,349 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-08 05:27:08,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 05:27:08,549 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-08 05:27:08,549 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:08,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:08,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1878019740, now seen corresponding path program 1 times [2025-03-08 05:27:08,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:08,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46689443] [2025-03-08 05:27:08,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:08,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:08,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 05:27:08,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 05:27:08,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:08,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:08,791 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-08 05:27:08,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:08,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46689443] [2025-03-08 05:27:08,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46689443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:08,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30878406] [2025-03-08 05:27:08,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:08,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:08,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:08,794 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-08 05:27:08,796 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-08 05:27:08,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 05:27:09,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 05:27:09,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:09,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:09,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:27:09,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:09,120 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-08 05:27:09,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:09,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30878406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:09,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:09,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-08 05:27:09,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163360699] [2025-03-08 05:27:09,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:09,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:09,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:09,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:09,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:27:09,121 INFO L87 Difference]: Start difference. First operand 2607 states and 4317 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-08 05:27:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:10,497 INFO L93 Difference]: Finished difference Result 8457 states and 14359 transitions. [2025-03-08 05:27:10,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:10,497 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-08 05:27:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:10,538 INFO L225 Difference]: With dead ends: 8457 [2025-03-08 05:27:10,538 INFO L226 Difference]: Without dead ends: 5895 [2025-03-08 05:27:10,552 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-08 05:27:10,552 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 2005 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2088 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:10,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2088 Valid, 872 Invalid, 1793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 05:27:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5895 states. [2025-03-08 05:27:10,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5895 to 5678. [2025-03-08 05:27:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5678 states, 4268 states have (on average 1.6293345829428303) internal successors, (6954), 4477 states have internal predecessors, (6954), 1131 states have call successors, (1131), 217 states have call predecessors, (1131), 278 states have return successors, (1530), 1131 states have call predecessors, (1530), 1126 states have call successors, (1530) [2025-03-08 05:27:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5678 states to 5678 states and 9615 transitions. [2025-03-08 05:27:10,853 INFO L78 Accepts]: Start accepts. Automaton has 5678 states and 9615 transitions. Word has length 147 [2025-03-08 05:27:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:10,854 INFO L471 AbstractCegarLoop]: Abstraction has 5678 states and 9615 transitions. [2025-03-08 05:27:10,854 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-08 05:27:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 5678 states and 9615 transitions. [2025-03-08 05:27:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 05:27:10,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:10,857 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-08 05:27:10,865 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-08 05:27:11,057 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-08 05:27:11,058 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:11,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:11,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1911126752, now seen corresponding path program 1 times [2025-03-08 05:27:11,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:11,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871320603] [2025-03-08 05:27:11,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:11,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:11,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 05:27:11,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 05:27:11,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:11,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:11,258 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-08 05:27:11,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:11,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871320603] [2025-03-08 05:27:11,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871320603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:11,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718770544] [2025-03-08 05:27:11,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:11,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:11,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:11,262 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-08 05:27:11,263 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-08 05:27:11,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 05:27:11,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 05:27:11,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:11,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:11,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:27:11,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:11,612 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-08 05:27:11,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:11,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718770544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:11,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:11,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-08 05:27:11,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129557538] [2025-03-08 05:27:11,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:11,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:11,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:11,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:11,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:27:11,613 INFO L87 Difference]: Start difference. First operand 5678 states and 9615 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-08 05:27:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:13,400 INFO L93 Difference]: Finished difference Result 18876 states and 33209 transitions. [2025-03-08 05:27:13,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:13,400 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-08 05:27:13,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:13,513 INFO L225 Difference]: With dead ends: 18876 [2025-03-08 05:27:13,514 INFO L226 Difference]: Without dead ends: 13243 [2025-03-08 05:27:13,551 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-08 05:27:13,552 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 1990 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2072 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:13,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2072 Valid, 869 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 05:27:13,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13243 states. [2025-03-08 05:27:14,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13243 to 12690. [2025-03-08 05:27:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12690 states, 9341 states have (on average 1.6207044213681618) internal successors, (15139), 9855 states have internal predecessors, (15139), 2755 states have call successors, (2755), 429 states have call predecessors, (2755), 593 states have return successors, (4247), 2779 states have call predecessors, (4247), 2750 states have call successors, (4247) [2025-03-08 05:27:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12690 states to 12690 states and 22141 transitions. [2025-03-08 05:27:14,303 INFO L78 Accepts]: Start accepts. Automaton has 12690 states and 22141 transitions. Word has length 148 [2025-03-08 05:27:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:14,306 INFO L471 AbstractCegarLoop]: Abstraction has 12690 states and 22141 transitions. [2025-03-08 05:27:14,306 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-08 05:27:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 12690 states and 22141 transitions. [2025-03-08 05:27:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 05:27:14,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:14,310 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-08 05:27:14,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 05:27:14,510 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-08 05:27:14,512 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:14,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:14,513 INFO L85 PathProgramCache]: Analyzing trace with hash 884412502, now seen corresponding path program 1 times [2025-03-08 05:27:14,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:14,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844570187] [2025-03-08 05:27:14,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:14,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:14,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 05:27:14,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 05:27:14,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:14,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:14,700 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-08 05:27:14,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:14,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844570187] [2025-03-08 05:27:14,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844570187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:14,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624345878] [2025-03-08 05:27:14,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:14,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:14,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:14,702 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-08 05:27:14,705 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-08 05:27:14,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 05:27:14,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 05:27:14,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:14,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:14,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:27:14,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:15,028 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-08 05:27:15,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:15,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624345878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:15,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:15,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-08 05:27:15,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669564244] [2025-03-08 05:27:15,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:15,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:15,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:15,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:15,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:27:15,029 INFO L87 Difference]: Start difference. First operand 12690 states and 22141 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-08 05:27:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:18,044 INFO L93 Difference]: Finished difference Result 42939 states and 79675 transitions. [2025-03-08 05:27:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:18,044 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-08 05:27:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:18,291 INFO L225 Difference]: With dead ends: 42939 [2025-03-08 05:27:18,292 INFO L226 Difference]: Without dead ends: 30294 [2025-03-08 05:27:18,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:27:18,365 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 1978 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2059 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:18,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2059 Valid, 863 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 05:27:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30294 states. [2025-03-08 05:27:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30294 to 29102. [2025-03-08 05:27:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29102 states, 20934 states have (on average 1.6087704213241616) internal successors, (33678), 22217 states have internal predecessors, (33678), 6887 states have call successors, (6887), 853 states have call predecessors, (6887), 1280 states have return successors, (12384), 6995 states have call predecessors, (12384), 6882 states have call successors, (12384) [2025-03-08 05:27:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29102 states to 29102 states and 52949 transitions. [2025-03-08 05:27:20,182 INFO L78 Accepts]: Start accepts. Automaton has 29102 states and 52949 transitions. Word has length 149 [2025-03-08 05:27:20,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:20,182 INFO L471 AbstractCegarLoop]: Abstraction has 29102 states and 52949 transitions. [2025-03-08 05:27:20,182 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-08 05:27:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 29102 states and 52949 transitions. [2025-03-08 05:27:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 05:27:20,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:20,187 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-08 05:27:20,195 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-08 05:27:20,387 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-08 05:27:20,388 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:20,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:20,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1646779674, now seen corresponding path program 1 times [2025-03-08 05:27:20,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:20,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672606230] [2025-03-08 05:27:20,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:20,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:20,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 05:27:20,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 05:27:20,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:20,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:20,586 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-08 05:27:20,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:20,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672606230] [2025-03-08 05:27:20,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672606230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:20,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255118826] [2025-03-08 05:27:20,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:20,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:20,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:20,589 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-08 05:27:20,591 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-08 05:27:20,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 05:27:20,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 05:27:20,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:20,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:20,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 1523 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:27:20,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:20,920 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-08 05:27:20,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:20,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255118826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:20,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:20,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-08 05:27:20,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745922674] [2025-03-08 05:27:20,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:20,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:20,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:20,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:20,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:27:20,922 INFO L87 Difference]: Start difference. First operand 29102 states and 52949 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-08 05:27:26,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:26,355 INFO L93 Difference]: Finished difference Result 99707 states and 200652 transitions. [2025-03-08 05:27:26,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:26,355 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-08 05:27:26,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:27,063 INFO L225 Difference]: With dead ends: 99707 [2025-03-08 05:27:27,063 INFO L226 Difference]: Without dead ends: 70640 [2025-03-08 05:27:27,249 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-08 05:27:27,249 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 1952 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2032 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:27,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2032 Valid, 960 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 05:27:27,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70640 states. [2025-03-08 05:27:31,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70640 to 68498. [2025-03-08 05:27:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68498 states, 48105 states have (on average 1.5948238228874336) internal successors, (76719), 51345 states have internal predecessors, (76719), 17593 states have call successors, (17593), 1698 states have call predecessors, (17593), 2799 states have return successors, (37934), 17976 states have call predecessors, (37934), 17588 states have call successors, (37934) [2025-03-08 05:27:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68498 states to 68498 states and 132246 transitions. [2025-03-08 05:27:32,536 INFO L78 Accepts]: Start accepts. Automaton has 68498 states and 132246 transitions. Word has length 150 [2025-03-08 05:27:32,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:32,536 INFO L471 AbstractCegarLoop]: Abstraction has 68498 states and 132246 transitions. [2025-03-08 05:27:32,537 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-08 05:27:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 68498 states and 132246 transitions. [2025-03-08 05:27:32,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 05:27:32,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:32,558 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] [2025-03-08 05:27:32,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 05:27:32,758 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-08 05:27:32,759 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:32,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:32,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1825054238, now seen corresponding path program 1 times [2025-03-08 05:27:32,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:32,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782256252] [2025-03-08 05:27:32,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:32,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:32,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 05:27:32,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 05:27:32,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:32,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:32,969 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-08 05:27:32,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:32,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782256252] [2025-03-08 05:27:32,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782256252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:32,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409254431] [2025-03-08 05:27:32,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:32,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:32,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:32,972 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-08 05:27:32,972 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-08 05:27:33,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 05:27:33,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 05:27:33,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:33,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:33,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 1936 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:27:33,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:33,241 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-08 05:27:33,241 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:33,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409254431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:33,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:33,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-08 05:27:33,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377130619] [2025-03-08 05:27:33,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:33,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:33,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:33,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:33,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:27:33,242 INFO L87 Difference]: Start difference. First operand 68498 states and 132246 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-08 05:27:38,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:38,179 INFO L93 Difference]: Finished difference Result 139830 states and 280808 transitions. [2025-03-08 05:27:38,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:38,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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 205 [2025-03-08 05:27:38,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:38,885 INFO L225 Difference]: With dead ends: 139830 [2025-03-08 05:27:38,885 INFO L226 Difference]: Without dead ends: 71378 [2025-03-08 05:27:39,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 211 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-08 05:27:39,438 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 144 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2494 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-08 05:27:39,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2494 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:27:39,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71378 states. [2025-03-08 05:27:43,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71378 to 70994. [2025-03-08 05:27:43,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70994 states, 50537 states have (on average 1.6105229831608525) internal successors, (81391), 53777 states have internal predecessors, (81391), 17593 states have call successors, (17593), 1762 states have call predecessors, (17593), 2863 states have return successors, (37934), 17976 states have call predecessors, (37934), 17588 states have call successors, (37934) [2025-03-08 05:27:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70994 states to 70994 states and 136918 transitions. [2025-03-08 05:27:44,411 INFO L78 Accepts]: Start accepts. Automaton has 70994 states and 136918 transitions. Word has length 205 [2025-03-08 05:27:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:44,412 INFO L471 AbstractCegarLoop]: Abstraction has 70994 states and 136918 transitions. [2025-03-08 05:27:44,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-08 05:27:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 70994 states and 136918 transitions. [2025-03-08 05:27:44,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-08 05:27:44,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:44,427 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:27:44,438 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-08 05:27:44,632 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-08 05:27:44,632 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:44,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:44,632 INFO L85 PathProgramCache]: Analyzing trace with hash 592238455, now seen corresponding path program 1 times [2025-03-08 05:27:44,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:44,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664044743] [2025-03-08 05:27:44,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:44,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:44,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-08 05:27:44,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-08 05:27:44,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:44,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-08 05:27:45,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:45,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664044743] [2025-03-08 05:27:45,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664044743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:45,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914872360] [2025-03-08 05:27:45,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:45,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:45,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:45,721 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-08 05:27:45,721 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-08 05:27:45,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-08 05:27:46,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-08 05:27:46,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:46,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:46,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 2411 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 05:27:46,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-08 05:27:46,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:27:47,880 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-08 05:27:47,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914872360] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:27:47,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:27:47,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 25 [2025-03-08 05:27:47,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293824834] [2025-03-08 05:27:47,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:27:47,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 05:27:47,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:47,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 05:27:47,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:27:47,882 INFO L87 Difference]: Start difference. First operand 70994 states and 136918 transitions. Second operand has 25 states, 25 states have (on average 16.76) internal successors, (419), 23 states have internal predecessors, (419), 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)