./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product32.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 256d604ca5845ed70fae4c0c59880096896900821991ad09252cbc35739a584c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:16:52,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:16:52,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:16:52,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:16:52,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:16:52,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:16:52,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:16:52,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:16:52,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:16:52,141 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:16:52,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:16:52,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:16:52,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:16:52,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:16:52,141 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:16:52,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:16:52,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:16:52,142 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:16:52,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:16:52,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:16:52,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:16:52,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:16:52,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:16:52,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:16:52,142 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:16:52,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:16:52,142 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:16:52,142 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:16:52,142 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:16:52,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:16:52,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:16:52,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:16:52,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:16:52,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:16:52,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:16:52,143 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:16:52,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:16:52,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:16:52,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:16:52,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:16:52,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:16:52,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:16:52,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:16:52,143 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 -> 256d604ca5845ed70fae4c0c59880096896900821991ad09252cbc35739a584c [2025-03-03 14:16:52,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:16:52,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:16:52,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:16:52,413 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:16:52,414 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:16:52,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product32.cil.c [2025-03-03 14:16:53,587 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe85b8a0/e810a7722040456b850d3412dc3739b5/FLAG1d40439fd [2025-03-03 14:16:53,963 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:16:53,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product32.cil.c [2025-03-03 14:16:53,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe85b8a0/e810a7722040456b850d3412dc3739b5/FLAG1d40439fd [2025-03-03 14:16:54,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe85b8a0/e810a7722040456b850d3412dc3739b5 [2025-03-03 14:16:54,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:16:54,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:16:54,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:16:54,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:16:54,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:16:54,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:16:54" (1/1) ... [2025-03-03 14:16:54,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ab0e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:54, skipping insertion in model container [2025-03-03 14:16:54,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:16:54" (1/1) ... [2025-03-03 14:16:54,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:16:54,391 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_product32.cil.c[40079,40092] [2025-03-03 14:16:54,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:16:54,503 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:16:54,509 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [48] [2025-03-03 14:16:54,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [236] [2025-03-03 14:16:54,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [904] [2025-03-03 14:16:54,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1270] [2025-03-03 14:16:54,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1308] [2025-03-03 14:16:54,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1406] [2025-03-03 14:16:54,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1420] [2025-03-03 14:16:54,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1540] [2025-03-03 14:16:54,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1891] [2025-03-03 14:16:54,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1900] [2025-03-03 14:16:54,570 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_product32.cil.c[40079,40092] [2025-03-03 14:16:54,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:16:54,651 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:16:54,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:54 WrapperNode [2025-03-03 14:16:54,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:16:54,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:16:54,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:16:54,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:16:54,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:54" (1/1) ... [2025-03-03 14:16:54,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:54" (1/1) ... [2025-03-03 14:16:54,734 INFO L138 Inliner]: procedures = 99, calls = 355, calls flagged for inlining = 29, calls inlined = 25, statements flattened = 977 [2025-03-03 14:16:54,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:16:54,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:16:54,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:16:54,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:16:54,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:54" (1/1) ... [2025-03-03 14:16:54,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:54" (1/1) ... [2025-03-03 14:16:54,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:54" (1/1) ... [2025-03-03 14:16:54,767 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-03 14:16:54,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:54" (1/1) ... [2025-03-03 14:16:54,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:54" (1/1) ... [2025-03-03 14:16:54,780 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:54" (1/1) ... [2025-03-03 14:16:54,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:54" (1/1) ... [2025-03-03 14:16:54,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:54" (1/1) ... [2025-03-03 14:16:54,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:54" (1/1) ... [2025-03-03 14:16:54,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:16:54,799 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:16:54,799 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:16:54,799 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:16:54,800 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:54" (1/1) ... [2025-03-03 14:16:54,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:16:54,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:54,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:16:54,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:16:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-03 14:16:54,851 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-03 14:16:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:16:54,852 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:16:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:16:54,852 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:16:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-03-03 14:16:54,852 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-03-03 14:16:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:16:54,852 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:16:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:16:54,852 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:16:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:16:54,852 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:16:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-03 14:16:54,852 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-03 14:16:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-03 14:16:54,853 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-03 14:16:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:16:54,853 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:16:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:16:54,853 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:16:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:16:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-03 14:16:54,853 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-03 14:16:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:16:54,853 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:16:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-03 14:16:54,853 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-03 14:16:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:16:54,854 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:16:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:16:54,854 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:16:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-03 14:16:54,854 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-03 14:16:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:16:54,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:16:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:16:54,854 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:16:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:16:54,854 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:16:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:16:54,854 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:16:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:16:54,854 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:16:54,855 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:16:54,855 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:16:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:16:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:16:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:16:54,856 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:16:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:16:54,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:16:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:16:54,856 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:16:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2025-03-03 14:16:54,856 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2025-03-03 14:16:55,019 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:16:55,021 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:16:55,095 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2847-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~25#1; [2025-03-03 14:16:55,095 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2875: #res#1 := ~retValue_acc~26#1; [2025-03-03 14:16:55,120 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1459: #res := ~retValue_acc~8; [2025-03-03 14:16:55,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3550: #res := ~retValue_acc~30; [2025-03-03 14:16:55,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2728-1: stopRequestedInDirection__wrappee__twothirdsfull_#res#1 := stopRequestedInDirection__wrappee__twothirdsfull_~retValue_acc~22#1; [2025-03-03 14:16:55,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2757: #res#1 := ~retValue_acc~23#1; [2025-03-03 14:16:55,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~24#1; [2025-03-03 14:16:55,211 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2920: #res := ~retValue_acc~28; [2025-03-03 14:16:55,334 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2688: #res := ~retValue_acc~21; [2025-03-03 14:16:55,449 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2323-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~19#1; [2025-03-03 14:16:55,449 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2336-1: isIdle_#res#1 := isIdle_~retValue_acc~20#1; [2025-03-03 14:16:55,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2160: #res := ~retValue_acc~15; [2025-03-03 14:16:55,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L901: #res := ~retValue_acc~2; [2025-03-03 14:16:55,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1537: #res := ~retValue_acc~10; [2025-03-03 14:16:55,470 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1974: #res := ~retValue_acc~13; [2025-03-03 14:16:55,473 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2151: #res := ~retValue_acc~14; [2025-03-03 14:16:55,594 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1498: #res := ~retValue_acc~9; [2025-03-03 14:16:55,609 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2194: #res := ~retValue_acc~16; [2025-03-03 14:16:55,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2243-1: isEmpty_#res#1 := isEmpty_~retValue_acc~18#1; [2025-03-03 14:16:55,700 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L590: #res := ~retValue_acc~1; [2025-03-03 14:16:55,765 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1305-1: valid_product_#res#1 := valid_product_~retValue_acc~7#1; [2025-03-03 14:16:55,765 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-1: main_#res#1 := main_~retValue_acc~12#1; [2025-03-03 14:16:55,773 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L354: #res := ~retValue_acc~0; [2025-03-03 14:16:55,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2906-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~27#1; [2025-03-03 14:16:55,992 INFO L? ?]: Removed 485 outVars from TransFormulas that were not future-live. [2025-03-03 14:16:55,993 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:16:56,019 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:16:56,019 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:16:56,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:16:56 BoogieIcfgContainer [2025-03-03 14:16:56,019 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:16:56,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:16:56,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:16:56,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:16:56,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:16:54" (1/3) ... [2025-03-03 14:16:56,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2904de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:16:56, skipping insertion in model container [2025-03-03 14:16:56,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:54" (2/3) ... [2025-03-03 14:16:56,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2904de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:16:56, skipping insertion in model container [2025-03-03 14:16:56,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:16:56" (3/3) ... [2025-03-03 14:16:56,030 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product32.cil.c [2025-03-03 14:16:56,042 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:16:56,044 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product32.cil.c that has 28 procedures, 604 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:16:56,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:16:56,110 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;@65b4b148, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:16:56,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:16:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 604 states, 470 states have (on average 1.676595744680851) internal successors, (788), 493 states have internal predecessors, (788), 105 states have call successors, (105), 27 states have call predecessors, (105), 27 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 14:16:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 14:16:56,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:56,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:56,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:56,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:56,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1872359015, now seen corresponding path program 1 times [2025-03-03 14:16:56,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:56,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797827893] [2025-03-03 14:16:56,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:56,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:56,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 14:16:56,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 14:16:56,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:56,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:56,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:56,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:56,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797827893] [2025-03-03 14:16:56,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797827893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:56,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:56,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713174523] [2025-03-03 14:16:56,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:56,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:56,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:56,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:56,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:56,575 INFO L87 Difference]: Start difference. First operand has 604 states, 470 states have (on average 1.676595744680851) internal successors, (788), 493 states have internal predecessors, (788), 105 states have call successors, (105), 27 states have call predecessors, (105), 27 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:56,724 INFO L93 Difference]: Finished difference Result 1188 states and 1971 transitions. [2025-03-03 14:16:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:56,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2025-03-03 14:16:56,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:56,741 INFO L225 Difference]: With dead ends: 1188 [2025-03-03 14:16:56,742 INFO L226 Difference]: Without dead ends: 596 [2025-03-03 14:16:56,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:56,751 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 5 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2930 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:56,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2930 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:56,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-03 14:16:56,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-03 14:16:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 464 states have (on average 1.6745689655172413) internal successors, (777), 485 states have internal predecessors, (777), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 14:16:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 982 transitions. [2025-03-03 14:16:56,823 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 982 transitions. Word has length 60 [2025-03-03 14:16:56,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:56,824 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 982 transitions. [2025-03-03 14:16:56,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:56,824 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 982 transitions. [2025-03-03 14:16:56,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 14:16:56,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:56,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:56,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:16:56,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:56,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:56,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1478541827, now seen corresponding path program 1 times [2025-03-03 14:16:56,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:56,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028504614] [2025-03-03 14:16:56,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:56,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:56,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 14:16:56,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 14:16:56,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:56,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:57,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:57,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028504614] [2025-03-03 14:16:57,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028504614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:57,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:57,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:57,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715770062] [2025-03-03 14:16:57,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:57,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:57,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:57,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:57,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:57,014 INFO L87 Difference]: Start difference. First operand 596 states and 982 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:57,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:57,086 INFO L93 Difference]: Finished difference Result 1174 states and 1941 transitions. [2025-03-03 14:16:57,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:57,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-03-03 14:16:57,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:57,094 INFO L225 Difference]: With dead ends: 1174 [2025-03-03 14:16:57,094 INFO L226 Difference]: Without dead ends: 596 [2025-03-03 14:16:57,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:57,097 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 4 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2909 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:57,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2909 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-03 14:16:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-03 14:16:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 464 states have (on average 1.6724137931034482) internal successors, (776), 485 states have internal predecessors, (776), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 14:16:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 981 transitions. [2025-03-03 14:16:57,132 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 981 transitions. Word has length 63 [2025-03-03 14:16:57,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:57,132 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 981 transitions. [2025-03-03 14:16:57,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:57,133 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 981 transitions. [2025-03-03 14:16:57,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:16:57,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:57,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:57,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:16:57,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:57,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:57,137 INFO L85 PathProgramCache]: Analyzing trace with hash -392401293, now seen corresponding path program 1 times [2025-03-03 14:16:57,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:57,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766485437] [2025-03-03 14:16:57,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:57,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:57,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:16:57,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:16:57,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:57,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:57,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:57,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766485437] [2025-03-03 14:16:57,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766485437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:57,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:57,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:57,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642841708] [2025-03-03 14:16:57,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:57,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:57,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:57,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:57,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:57,309 INFO L87 Difference]: Start difference. First operand 596 states and 981 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:57,381 INFO L93 Difference]: Finished difference Result 1174 states and 1940 transitions. [2025-03-03 14:16:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:57,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-03-03 14:16:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:57,390 INFO L225 Difference]: With dead ends: 1174 [2025-03-03 14:16:57,390 INFO L226 Difference]: Without dead ends: 596 [2025-03-03 14:16:57,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:57,394 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 3 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2909 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:57,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2909 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-03 14:16:57,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-03 14:16:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 464 states have (on average 1.6702586206896552) internal successors, (775), 485 states have internal predecessors, (775), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 14:16:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 980 transitions. [2025-03-03 14:16:57,427 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 980 transitions. Word has length 64 [2025-03-03 14:16:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:57,427 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 980 transitions. [2025-03-03 14:16:57,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 980 transitions. [2025-03-03 14:16:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 14:16:57,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:57,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:57,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:16:57,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:57,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:57,432 INFO L85 PathProgramCache]: Analyzing trace with hash 706262874, now seen corresponding path program 1 times [2025-03-03 14:16:57,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:57,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929659081] [2025-03-03 14:16:57,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:57,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:57,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 14:16:57,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 14:16:57,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:57,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:57,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:57,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929659081] [2025-03-03 14:16:57,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929659081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:57,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:57,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:57,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190864511] [2025-03-03 14:16:57,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:57,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:57,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:57,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:57,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:57,578 INFO L87 Difference]: Start difference. First operand 596 states and 980 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:57,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:57,633 INFO L93 Difference]: Finished difference Result 1174 states and 1939 transitions. [2025-03-03 14:16:57,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:57,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-03-03 14:16:57,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:57,638 INFO L225 Difference]: With dead ends: 1174 [2025-03-03 14:16:57,638 INFO L226 Difference]: Without dead ends: 596 [2025-03-03 14:16:57,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:57,642 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 2 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2909 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:57,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2909 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:57,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-03 14:16:57,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-03 14:16:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 464 states have (on average 1.668103448275862) internal successors, (774), 485 states have internal predecessors, (774), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 14:16:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 979 transitions. [2025-03-03 14:16:57,677 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 979 transitions. Word has length 65 [2025-03-03 14:16:57,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:57,682 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 979 transitions. [2025-03-03 14:16:57,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 979 transitions. [2025-03-03 14:16:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:16:57,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:57,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:57,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:16:57,683 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:57,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:57,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2101807632, now seen corresponding path program 1 times [2025-03-03 14:16:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:57,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880348919] [2025-03-03 14:16:57,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:57,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:16:57,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:16:57,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:57,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:57,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:57,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880348919] [2025-03-03 14:16:57,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880348919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:57,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:57,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:57,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611616679] [2025-03-03 14:16:57,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:57,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:57,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:57,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:57,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:57,814 INFO L87 Difference]: Start difference. First operand 596 states and 979 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:57,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:57,865 INFO L93 Difference]: Finished difference Result 1174 states and 1938 transitions. [2025-03-03 14:16:57,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:57,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-03-03 14:16:57,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:57,872 INFO L225 Difference]: With dead ends: 1174 [2025-03-03 14:16:57,872 INFO L226 Difference]: Without dead ends: 596 [2025-03-03 14:16:57,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:57,876 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 1 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2909 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:57,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2909 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-03 14:16:57,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-03 14:16:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 464 states have (on average 1.665948275862069) internal successors, (773), 485 states have internal predecessors, (773), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 14:16:57,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 978 transitions. [2025-03-03 14:16:57,905 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 978 transitions. Word has length 66 [2025-03-03 14:16:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:57,906 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 978 transitions. [2025-03-03 14:16:57,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:57,906 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 978 transitions. [2025-03-03 14:16:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:16:57,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:57,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:57,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:16:57,908 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:57,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:57,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1464601417, now seen corresponding path program 1 times [2025-03-03 14:16:57,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:57,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124344820] [2025-03-03 14:16:57,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:57,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:57,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:16:57,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:16:57,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:57,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:58,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:58,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124344820] [2025-03-03 14:16:58,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124344820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:58,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:58,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:16:58,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75962829] [2025-03-03 14:16:58,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:58,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:16:58,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:58,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:16:58,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:58,127 INFO L87 Difference]: Start difference. First operand 596 states and 978 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:58,242 INFO L93 Difference]: Finished difference Result 1140 states and 1870 transitions. [2025-03-03 14:16:58,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:16:58,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2025-03-03 14:16:58,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:58,247 INFO L225 Difference]: With dead ends: 1140 [2025-03-03 14:16:58,248 INFO L226 Difference]: Without dead ends: 611 [2025-03-03 14:16:58,250 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-03 14:16:58,252 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 91 mSDsluCounter, 6679 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7645 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-03 14:16:58,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7645 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:58,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-03 14:16:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 609. [2025-03-03 14:16:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 474 states have (on average 1.6624472573839661) internal successors, (788), 497 states have internal predecessors, (788), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2025-03-03 14:16:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 997 transitions. [2025-03-03 14:16:58,277 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 997 transitions. Word has length 67 [2025-03-03 14:16:58,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:58,278 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 997 transitions. [2025-03-03 14:16:58,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 997 transitions. [2025-03-03 14:16:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:16:58,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:58,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:58,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:16:58,281 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:58,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:58,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1705141546, now seen corresponding path program 1 times [2025-03-03 14:16:58,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:58,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204613667] [2025-03-03 14:16:58,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:58,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:58,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:16:58,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:16:58,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:58,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:58,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:58,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204613667] [2025-03-03 14:16:58,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204613667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:58,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:58,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:58,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281202258] [2025-03-03 14:16:58,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:58,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:58,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:58,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:58,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:58,363 INFO L87 Difference]: Start difference. First operand 609 states and 997 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:58,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:58,400 INFO L93 Difference]: Finished difference Result 1192 states and 1964 transitions. [2025-03-03 14:16:58,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:58,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-03-03 14:16:58,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:58,405 INFO L225 Difference]: With dead ends: 1192 [2025-03-03 14:16:58,405 INFO L226 Difference]: Without dead ends: 590 [2025-03-03 14:16:58,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:58,409 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 0 mSDsluCounter, 1939 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2911 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:58,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2911 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:58,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-03-03 14:16:58,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-03-03 14:16:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 458 states have (on average 1.6572052401746724) internal successors, (759), 479 states have internal predecessors, (759), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 14:16:58,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 964 transitions. [2025-03-03 14:16:58,430 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 964 transitions. Word has length 67 [2025-03-03 14:16:58,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:58,430 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 964 transitions. [2025-03-03 14:16:58,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 964 transitions. [2025-03-03 14:16:58,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:16:58,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:58,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:58,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:16:58,432 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:58,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:58,432 INFO L85 PathProgramCache]: Analyzing trace with hash 420666923, now seen corresponding path program 1 times [2025-03-03 14:16:58,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:58,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508405464] [2025-03-03 14:16:58,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:58,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:58,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:16:58,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:16:58,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:58,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:58,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:58,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508405464] [2025-03-03 14:16:58,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508405464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:58,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:58,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:58,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142625839] [2025-03-03 14:16:58,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:58,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:58,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:58,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:58,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:58,567 INFO L87 Difference]: Start difference. First operand 590 states and 964 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:58,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:58,726 INFO L93 Difference]: Finished difference Result 1137 states and 1862 transitions. [2025-03-03 14:16:58,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:58,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2025-03-03 14:16:58,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:58,731 INFO L225 Difference]: With dead ends: 1137 [2025-03-03 14:16:58,731 INFO L226 Difference]: Without dead ends: 599 [2025-03-03 14:16:58,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:58,734 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 55 mSDsluCounter, 3655 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4576 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:58,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4576 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:58,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-03 14:16:58,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 590. [2025-03-03 14:16:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 458 states have (on average 1.648471615720524) internal successors, (755), 479 states have internal predecessors, (755), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 14:16:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 960 transitions. [2025-03-03 14:16:58,754 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 960 transitions. Word has length 68 [2025-03-03 14:16:58,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:58,754 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 960 transitions. [2025-03-03 14:16:58,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:58,755 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 960 transitions. [2025-03-03 14:16:58,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:16:58,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:58,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:58,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:16:58,757 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:58,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:58,757 INFO L85 PathProgramCache]: Analyzing trace with hash 510077966, now seen corresponding path program 1 times [2025-03-03 14:16:58,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:58,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547271037] [2025-03-03 14:16:58,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:58,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:58,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:16:58,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:16:58,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:58,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:58,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:58,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547271037] [2025-03-03 14:16:58,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547271037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:58,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:58,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:58,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213768812] [2025-03-03 14:16:58,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:58,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:58,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:58,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:58,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:58,852 INFO L87 Difference]: Start difference. First operand 590 states and 960 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:58,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:58,989 INFO L93 Difference]: Finished difference Result 1137 states and 1858 transitions. [2025-03-03 14:16:58,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:58,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2025-03-03 14:16:58,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:58,994 INFO L225 Difference]: With dead ends: 1137 [2025-03-03 14:16:58,994 INFO L226 Difference]: Without dead ends: 599 [2025-03-03 14:16:58,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:58,996 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 54 mSDsluCounter, 3655 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4576 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:58,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4576 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:58,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-03 14:16:59,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 590. [2025-03-03 14:16:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 458 states have (on average 1.6397379912663756) internal successors, (751), 479 states have internal predecessors, (751), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 14:16:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 956 transitions. [2025-03-03 14:16:59,012 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 956 transitions. Word has length 69 [2025-03-03 14:16:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:59,012 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 956 transitions. [2025-03-03 14:16:59,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 956 transitions. [2025-03-03 14:16:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:16:59,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:59,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:59,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:16:59,013 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:59,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:59,014 INFO L85 PathProgramCache]: Analyzing trace with hash 587544206, now seen corresponding path program 1 times [2025-03-03 14:16:59,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:59,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069872027] [2025-03-03 14:16:59,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:59,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:59,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:16:59,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:16:59,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:59,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:59,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:59,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069872027] [2025-03-03 14:16:59,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069872027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:59,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:59,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:59,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482025906] [2025-03-03 14:16:59,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:59,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:59,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:59,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:59,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:59,121 INFO L87 Difference]: Start difference. First operand 590 states and 956 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:59,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:59,261 INFO L93 Difference]: Finished difference Result 1137 states and 1854 transitions. [2025-03-03 14:16:59,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:59,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-03 14:16:59,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:59,265 INFO L225 Difference]: With dead ends: 1137 [2025-03-03 14:16:59,266 INFO L226 Difference]: Without dead ends: 599 [2025-03-03 14:16:59,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:59,268 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 53 mSDsluCounter, 3638 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4558 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:59,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4558 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-03 14:16:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 590. [2025-03-03 14:16:59,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 458 states have (on average 1.6310043668122272) internal successors, (747), 479 states have internal predecessors, (747), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 14:16:59,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 952 transitions. [2025-03-03 14:16:59,287 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 952 transitions. Word has length 70 [2025-03-03 14:16:59,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:59,287 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 952 transitions. [2025-03-03 14:16:59,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:59,287 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 952 transitions. [2025-03-03 14:16:59,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:16:59,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:59,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:59,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:16:59,289 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:59,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:59,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1984109827, now seen corresponding path program 1 times [2025-03-03 14:16:59,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:59,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600199863] [2025-03-03 14:16:59,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:59,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:59,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:16:59,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:16:59,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:59,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:59,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:59,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600199863] [2025-03-03 14:16:59,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600199863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:59,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:59,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:16:59,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832410356] [2025-03-03 14:16:59,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:59,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:16:59,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:59,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:16:59,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:59,381 INFO L87 Difference]: Start difference. First operand 590 states and 952 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:59,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:59,435 INFO L93 Difference]: Finished difference Result 1128 states and 1836 transitions. [2025-03-03 14:16:59,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:16:59,435 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-03 14:16:59,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:59,439 INFO L225 Difference]: With dead ends: 1128 [2025-03-03 14:16:59,439 INFO L226 Difference]: Without dead ends: 569 [2025-03-03 14:16:59,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:16:59,442 INFO L435 NwaCegarLoop]: 941 mSDtfsCounter, 84 mSDsluCounter, 4632 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5573 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:59,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5573 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:59,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-03 14:16:59,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2025-03-03 14:16:59,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 437 states have (on average 1.631578947368421) internal successors, (713), 458 states have internal predecessors, (713), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 14:16:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 918 transitions. [2025-03-03 14:16:59,457 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 918 transitions. Word has length 70 [2025-03-03 14:16:59,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:59,457 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 918 transitions. [2025-03-03 14:16:59,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:59,458 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 918 transitions. [2025-03-03 14:16:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 14:16:59,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:59,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:59,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:16:59,459 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:59,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:59,459 INFO L85 PathProgramCache]: Analyzing trace with hash 294721553, now seen corresponding path program 1 times [2025-03-03 14:16:59,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:59,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878776671] [2025-03-03 14:16:59,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:59,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:59,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 14:16:59,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 14:16:59,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:59,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:59,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:59,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878776671] [2025-03-03 14:16:59,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878776671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:59,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:59,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:59,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058819390] [2025-03-03 14:16:59,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:59,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:59,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:59,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:59,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:59,556 INFO L87 Difference]: Start difference. First operand 569 states and 918 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:59,618 INFO L93 Difference]: Finished difference Result 1107 states and 1802 transitions. [2025-03-03 14:16:59,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:59,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-03-03 14:16:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:59,623 INFO L225 Difference]: With dead ends: 1107 [2025-03-03 14:16:59,623 INFO L226 Difference]: Without dead ends: 569 [2025-03-03 14:16:59,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:59,626 INFO L435 NwaCegarLoop]: 901 mSDtfsCounter, 17 mSDsluCounter, 3595 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4496 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:59,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4496 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:59,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-03 14:16:59,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2025-03-03 14:16:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 437 states have (on average 1.6292906178489703) internal successors, (712), 458 states have internal predecessors, (712), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 14:16:59,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 917 transitions. [2025-03-03 14:16:59,646 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 917 transitions. Word has length 71 [2025-03-03 14:16:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:59,646 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 917 transitions. [2025-03-03 14:16:59,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 917 transitions. [2025-03-03 14:16:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 14:16:59,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:59,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:59,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:16:59,647 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:59,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:59,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1407845105, now seen corresponding path program 1 times [2025-03-03 14:16:59,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:59,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110500845] [2025-03-03 14:16:59,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:59,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:59,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:16:59,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:16:59,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:59,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:59,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110500845] [2025-03-03 14:16:59,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110500845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:59,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:59,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:59,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387964712] [2025-03-03 14:16:59,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:59,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:59,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:59,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:59,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:59,750 INFO L87 Difference]: Start difference. First operand 569 states and 917 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:59,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:59,810 INFO L93 Difference]: Finished difference Result 1107 states and 1801 transitions. [2025-03-03 14:16:59,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:59,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2025-03-03 14:16:59,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:59,815 INFO L225 Difference]: With dead ends: 1107 [2025-03-03 14:16:59,816 INFO L226 Difference]: Without dead ends: 569 [2025-03-03 14:16:59,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:59,818 INFO L435 NwaCegarLoop]: 901 mSDtfsCounter, 16 mSDsluCounter, 3595 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4496 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:59,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4496 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:59,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-03 14:16:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2025-03-03 14:16:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 437 states have (on average 1.6270022883295194) internal successors, (711), 458 states have internal predecessors, (711), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 14:16:59,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 916 transitions. [2025-03-03 14:16:59,835 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 916 transitions. Word has length 72 [2025-03-03 14:16:59,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:59,835 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 916 transitions. [2025-03-03 14:16:59,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 916 transitions. [2025-03-03 14:16:59,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 14:16:59,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:59,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:59,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:16:59,836 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:59,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:59,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1139339244, now seen corresponding path program 1 times [2025-03-03 14:16:59,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:59,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874944999] [2025-03-03 14:16:59,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:59,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:59,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 14:16:59,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 14:16:59,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:59,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:59,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:59,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874944999] [2025-03-03 14:16:59,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874944999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:59,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:59,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:16:59,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817125496] [2025-03-03 14:16:59,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:59,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:16:59,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:59,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:16:59,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:16:59,986 INFO L87 Difference]: Start difference. First operand 569 states and 916 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:17:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:00,091 INFO L93 Difference]: Finished difference Result 1101 states and 1789 transitions. [2025-03-03 14:17:00,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:17:00,091 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 73 [2025-03-03 14:17:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:00,095 INFO L225 Difference]: With dead ends: 1101 [2025-03-03 14:17:00,095 INFO L226 Difference]: Without dead ends: 569 [2025-03-03 14:17:00,097 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-03 14:17:00,098 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 6 mSDsluCounter, 7178 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8078 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-03 14:17:00,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 8078 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:17:00,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-03 14:17:00,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2025-03-03 14:17:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 437 states have (on average 1.6247139588100687) internal successors, (710), 458 states have internal predecessors, (710), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 14:17:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 915 transitions. [2025-03-03 14:17:00,112 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 915 transitions. Word has length 73 [2025-03-03 14:17:00,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:00,112 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 915 transitions. [2025-03-03 14:17:00,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:17:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 915 transitions. [2025-03-03 14:17:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:17:00,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:00,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:00,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:17:00,114 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:00,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:00,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2003277700, now seen corresponding path program 1 times [2025-03-03 14:17:00,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:00,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798982986] [2025-03-03 14:17:00,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:00,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:00,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:17:00,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:17:00,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:00,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:17:00,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:00,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798982986] [2025-03-03 14:17:00,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798982986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:00,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:00,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:00,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23728375] [2025-03-03 14:17:00,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:00,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:00,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:00,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:00,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:00,280 INFO L87 Difference]: Start difference. First operand 569 states and 915 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:17:02,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:02,218 INFO L93 Difference]: Finished difference Result 1756 states and 2886 transitions. [2025-03-03 14:17:02,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:17:02,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 74 [2025-03-03 14:17:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:02,226 INFO L225 Difference]: With dead ends: 1756 [2025-03-03 14:17:02,226 INFO L226 Difference]: Without dead ends: 1232 [2025-03-03 14:17:02,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:02,229 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 2688 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2762 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 2661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:02,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2762 Valid, 1215 Invalid, 2661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:17:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2025-03-03 14:17:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1110. [2025-03-03 14:17:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 857 states have (on average 1.6429404900816802) internal successors, (1408), 887 states have internal predecessors, (1408), 204 states have call successors, (204), 47 states have call predecessors, (204), 48 states have return successors, (206), 188 states have call predecessors, (206), 199 states have call successors, (206) [2025-03-03 14:17:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1818 transitions. [2025-03-03 14:17:02,281 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1818 transitions. Word has length 74 [2025-03-03 14:17:02,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:02,282 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1818 transitions. [2025-03-03 14:17:02,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:17:02,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1818 transitions. [2025-03-03 14:17:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:17:02,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:02,287 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:02,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:17:02,287 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:02,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:02,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1787249031, now seen corresponding path program 1 times [2025-03-03 14:17:02,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:02,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262925708] [2025-03-03 14:17:02,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:02,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:02,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:17:02,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:17:02,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:02,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:02,578 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-03 14:17:02,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:02,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262925708] [2025-03-03 14:17:02,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262925708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:02,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:02,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 14:17:02,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019987867] [2025-03-03 14:17:02,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:02,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:17:02,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:02,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:17:02,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:17:02,580 INFO L87 Difference]: Start difference. First operand 1110 states and 1818 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 10 states have internal predecessors, (85), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:17:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:06,972 INFO L93 Difference]: Finished difference Result 4070 states and 6679 transitions. [2025-03-03 14:17:06,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 14:17:06,973 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 10 states have internal predecessors, (85), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 128 [2025-03-03 14:17:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:06,989 INFO L225 Difference]: With dead ends: 4070 [2025-03-03 14:17:06,989 INFO L226 Difference]: Without dead ends: 3005 [2025-03-03 14:17:06,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:17:06,995 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 2978 mSDsluCounter, 3785 mSDsCounter, 0 mSdLazyCounter, 10411 mSolverCounterSat, 980 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3059 SdHoareTripleChecker+Valid, 4536 SdHoareTripleChecker+Invalid, 11391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 980 IncrementalHoareTripleChecker+Valid, 10411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:06,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3059 Valid, 4536 Invalid, 11391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [980 Valid, 10411 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-03 14:17:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2025-03-03 14:17:07,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2911. [2025-03-03 14:17:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2911 states, 2170 states have (on average 1.607373271889401) internal successors, (3488), 2246 states have internal predecessors, (3488), 610 states have call successors, (610), 113 states have call predecessors, (610), 130 states have return successors, (643), 584 states have call predecessors, (643), 605 states have call successors, (643) [2025-03-03 14:17:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 4741 transitions. [2025-03-03 14:17:07,124 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 4741 transitions. Word has length 128 [2025-03-03 14:17:07,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:07,124 INFO L471 AbstractCegarLoop]: Abstraction has 2911 states and 4741 transitions. [2025-03-03 14:17:07,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 10 states have internal predecessors, (85), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:17:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 4741 transitions. [2025-03-03 14:17:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:17:07,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:07,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:07,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:17:07,128 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:07,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:07,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2074831067, now seen corresponding path program 1 times [2025-03-03 14:17:07,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:07,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708084624] [2025-03-03 14:17:07,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:07,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:07,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:17:07,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:17:07,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:07,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:07,279 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-03 14:17:07,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:07,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708084624] [2025-03-03 14:17:07,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708084624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:07,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717140535] [2025-03-03 14:17:07,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:07,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:07,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:07,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:07,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:17:07,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:17:07,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:17:07,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:07,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:07,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 1696 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:17:07,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:07,684 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-03 14:17:07,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:07,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717140535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:07,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:07,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:17:07,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537885268] [2025-03-03 14:17:07,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:07,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:17:07,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:07,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:17:07,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:07,689 INFO L87 Difference]: Start difference. First operand 2911 states and 4741 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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-03 14:17:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:08,172 INFO L93 Difference]: Finished difference Result 5841 states and 9704 transitions. [2025-03-03 14:17:08,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:17:08,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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 129 [2025-03-03 14:17:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:08,190 INFO L225 Difference]: With dead ends: 5841 [2025-03-03 14:17:08,190 INFO L226 Difference]: Without dead ends: 2975 [2025-03-03 14:17:08,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:08,204 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 866 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 2287 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:08,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 2287 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:17:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2025-03-03 14:17:08,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2975. [2025-03-03 14:17:08,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2975 states, 2226 states have (on average 1.610062893081761) internal successors, (3584), 2302 states have internal predecessors, (3584), 610 states have call successors, (610), 121 states have call predecessors, (610), 138 states have return successors, (649), 584 states have call predecessors, (649), 605 states have call successors, (649) [2025-03-03 14:17:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 4843 transitions. [2025-03-03 14:17:08,378 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 4843 transitions. Word has length 129 [2025-03-03 14:17:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:08,378 INFO L471 AbstractCegarLoop]: Abstraction has 2975 states and 4843 transitions. [2025-03-03 14:17:08,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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-03 14:17:08,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 4843 transitions. [2025-03-03 14:17:08,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:17:08,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:08,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:08,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:17:08,585 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,SelfDestructingSolverStorable16 [2025-03-03 14:17:08,585 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:08,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:08,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2107991823, now seen corresponding path program 1 times [2025-03-03 14:17:08,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:08,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463182224] [2025-03-03 14:17:08,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:08,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:08,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:17:08,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:17:08,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:08,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:08,717 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-03 14:17:08,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:08,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463182224] [2025-03-03 14:17:08,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463182224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:08,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834672658] [2025-03-03 14:17:08,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:08,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:08,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:08,720 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:08,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:17:08,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:17:09,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:17:09,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:09,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:09,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 1698 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:17:09,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:09,114 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-03 14:17:09,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:09,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834672658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:09,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:09,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:17:09,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73352012] [2025-03-03 14:17:09,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:09,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:17:09,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:09,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:17:09,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:09,118 INFO L87 Difference]: Start difference. First operand 2975 states and 4843 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 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-03 14:17:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:09,527 INFO L93 Difference]: Finished difference Result 5969 states and 9890 transitions. [2025-03-03 14:17:09,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:17:09,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 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 131 [2025-03-03 14:17:09,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:09,542 INFO L225 Difference]: With dead ends: 5969 [2025-03-03 14:17:09,542 INFO L226 Difference]: Without dead ends: 3039 [2025-03-03 14:17:09,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:09,555 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 860 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:09,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 2284 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:17:09,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2025-03-03 14:17:09,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 3039. [2025-03-03 14:17:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3039 states, 2282 states have (on average 1.6126205083260299) internal successors, (3680), 2358 states have internal predecessors, (3680), 610 states have call successors, (610), 129 states have call predecessors, (610), 146 states have return successors, (655), 584 states have call predecessors, (655), 605 states have call successors, (655) [2025-03-03 14:17:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3039 states to 3039 states and 4945 transitions. [2025-03-03 14:17:09,659 INFO L78 Accepts]: Start accepts. Automaton has 3039 states and 4945 transitions. Word has length 131 [2025-03-03 14:17:09,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:09,659 INFO L471 AbstractCegarLoop]: Abstraction has 3039 states and 4945 transitions. [2025-03-03 14:17:09,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 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-03 14:17:09,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 4945 transitions. [2025-03-03 14:17:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:17:09,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:09,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:09,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:17:09,863 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,SelfDestructingSolverStorable17 [2025-03-03 14:17:09,863 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:09,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:09,864 INFO L85 PathProgramCache]: Analyzing trace with hash -221178693, now seen corresponding path program 1 times [2025-03-03 14:17:09,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:09,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092817957] [2025-03-03 14:17:09,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:09,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:09,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:17:09,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:17:09,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:09,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:09,980 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-03 14:17:09,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:09,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092817957] [2025-03-03 14:17:09,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092817957] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:09,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257780350] [2025-03-03 14:17:09,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:09,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:09,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:09,982 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:09,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:17:10,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:17:10,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:17:10,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:10,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:10,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 1700 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:17:10,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:10,328 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-03 14:17:10,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:10,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257780350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:10,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:10,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:17:10,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499766327] [2025-03-03 14:17:10,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:10,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:17:10,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:10,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:17:10,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:10,329 INFO L87 Difference]: Start difference. First operand 3039 states and 4945 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 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-03 14:17:10,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:10,759 INFO L93 Difference]: Finished difference Result 6097 states and 10076 transitions. [2025-03-03 14:17:10,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:17:10,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 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 133 [2025-03-03 14:17:10,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:10,775 INFO L225 Difference]: With dead ends: 6097 [2025-03-03 14:17:10,775 INFO L226 Difference]: Without dead ends: 3103 [2025-03-03 14:17:10,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:10,786 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 857 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:10,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 2281 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:17:10,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2025-03-03 14:17:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 3103. [2025-03-03 14:17:10,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3103 states, 2338 states have (on average 1.615055603079555) internal successors, (3776), 2414 states have internal predecessors, (3776), 610 states have call successors, (610), 137 states have call predecessors, (610), 154 states have return successors, (661), 584 states have call predecessors, (661), 605 states have call successors, (661) [2025-03-03 14:17:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 5047 transitions. [2025-03-03 14:17:10,930 INFO L78 Accepts]: Start accepts. Automaton has 3103 states and 5047 transitions. Word has length 133 [2025-03-03 14:17:10,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:10,930 INFO L471 AbstractCegarLoop]: Abstraction has 3103 states and 5047 transitions. [2025-03-03 14:17:10,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 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-03 14:17:10,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 5047 transitions. [2025-03-03 14:17:10,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 14:17:10,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:10,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:10,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:11,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:11,140 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:11,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:11,141 INFO L85 PathProgramCache]: Analyzing trace with hash -515392119, now seen corresponding path program 1 times [2025-03-03 14:17:11,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:11,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501043146] [2025-03-03 14:17:11,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:11,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:11,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 14:17:11,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 14:17:11,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:11,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:11,249 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-03 14:17:11,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:11,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501043146] [2025-03-03 14:17:11,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501043146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:11,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685798341] [2025-03-03 14:17:11,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:11,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:11,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:11,251 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:11,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:17:11,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 14:17:11,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 14:17:11,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:11,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:11,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 1702 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:17:11,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:11,598 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-03 14:17:11,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:11,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685798341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:11,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:11,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:17:11,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280342841] [2025-03-03 14:17:11,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:11,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:17:11,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:11,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:17:11,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:11,603 INFO L87 Difference]: Start difference. First operand 3103 states and 5047 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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-03 14:17:12,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:12,022 INFO L93 Difference]: Finished difference Result 6225 states and 10262 transitions. [2025-03-03 14:17:12,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:17:12,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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 135 [2025-03-03 14:17:12,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:12,036 INFO L225 Difference]: With dead ends: 6225 [2025-03-03 14:17:12,036 INFO L226 Difference]: Without dead ends: 3167 [2025-03-03 14:17:12,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:12,046 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 851 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:12,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 2278 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:17:12,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3167 states. [2025-03-03 14:17:12,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3167 to 3167. [2025-03-03 14:17:12,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 2394 states have (on average 1.617376775271512) internal successors, (3872), 2470 states have internal predecessors, (3872), 610 states have call successors, (610), 145 states have call predecessors, (610), 162 states have return successors, (667), 584 states have call predecessors, (667), 605 states have call successors, (667) [2025-03-03 14:17:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 5149 transitions. [2025-03-03 14:17:12,195 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 5149 transitions. Word has length 135 [2025-03-03 14:17:12,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:12,195 INFO L471 AbstractCegarLoop]: Abstraction has 3167 states and 5149 transitions. [2025-03-03 14:17:12,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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-03 14:17:12,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 5149 transitions. [2025-03-03 14:17:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:17:12,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:12,199 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:12,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:17:12,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:12,400 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:12,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:12,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1934600421, now seen corresponding path program 1 times [2025-03-03 14:17:12,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:12,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531432512] [2025-03-03 14:17:12,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:12,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:12,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:17:12,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:17:12,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:12,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:12,632 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 14:17:12,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:12,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531432512] [2025-03-03 14:17:12,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531432512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:12,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204629617] [2025-03-03 14:17:12,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:12,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:12,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:12,635 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:12,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:17:12,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:17:12,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:17:12,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:12,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:12,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1704 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:17:12,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:13,070 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-03 14:17:13,070 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:13,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204629617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:13,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:13,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2025-03-03 14:17:13,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852400554] [2025-03-03 14:17:13,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:13,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:17:13,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:13,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:17:13,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:17:13,072 INFO L87 Difference]: Start difference. First operand 3167 states and 5149 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 14:17:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:13,380 INFO L93 Difference]: Finished difference Result 3279 states and 5334 transitions. [2025-03-03 14:17:13,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:13,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2025-03-03 14:17:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:13,404 INFO L225 Difference]: With dead ends: 3279 [2025-03-03 14:17:13,405 INFO L226 Difference]: Without dead ends: 3264 [2025-03-03 14:17:13,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:17:13,409 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 879 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:13,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 1642 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:17:13,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2025-03-03 14:17:13,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 3176. [2025-03-03 14:17:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3176 states, 2403 states have (on average 1.6150645027049522) internal successors, (3881), 2479 states have internal predecessors, (3881), 610 states have call successors, (610), 145 states have call predecessors, (610), 162 states have return successors, (667), 584 states have call predecessors, (667), 605 states have call successors, (667) [2025-03-03 14:17:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3176 states to 3176 states and 5158 transitions. [2025-03-03 14:17:13,545 INFO L78 Accepts]: Start accepts. Automaton has 3176 states and 5158 transitions. Word has length 137 [2025-03-03 14:17:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:13,545 INFO L471 AbstractCegarLoop]: Abstraction has 3176 states and 5158 transitions. [2025-03-03 14:17:13,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 14:17:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3176 states and 5158 transitions. [2025-03-03 14:17:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 14:17:13,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:13,551 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:13,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:13,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:13,752 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:13,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:13,752 INFO L85 PathProgramCache]: Analyzing trace with hash 140391129, now seen corresponding path program 1 times [2025-03-03 14:17:13,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:13,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090202081] [2025-03-03 14:17:13,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:13,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:13,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 14:17:13,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 14:17:13,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:13,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 14:17:13,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:13,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090202081] [2025-03-03 14:17:13,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090202081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:13,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379918538] [2025-03-03 14:17:13,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:13,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:13,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:13,974 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:13,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:17:14,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 14:17:14,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 14:17:14,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:14,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:14,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 1720 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:17:14,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:14,319 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-03 14:17:14,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:14,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379918538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:14,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:14,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2025-03-03 14:17:14,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045851091] [2025-03-03 14:17:14,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:14,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:14,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:14,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:14,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:17:14,321 INFO L87 Difference]: Start difference. First operand 3176 states and 5158 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:17:14,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:14,623 INFO L93 Difference]: Finished difference Result 3380 states and 5458 transitions. [2025-03-03 14:17:14,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:17:14,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2025-03-03 14:17:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:14,640 INFO L225 Difference]: With dead ends: 3380 [2025-03-03 14:17:14,640 INFO L226 Difference]: Without dead ends: 3365 [2025-03-03 14:17:14,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:17:14,645 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 842 mSDsluCounter, 2665 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 3577 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:14,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 3577 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:17:14,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3365 states. [2025-03-03 14:17:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3365 to 3344. [2025-03-03 14:17:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3344 states, 2539 states have (on average 1.6104765655769988) internal successors, (4089), 2615 states have internal predecessors, (4089), 626 states have call successors, (626), 161 states have call predecessors, (626), 178 states have return successors, (693), 600 states have call predecessors, (693), 621 states have call successors, (693) [2025-03-03 14:17:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3344 states to 3344 states and 5408 transitions. [2025-03-03 14:17:14,779 INFO L78 Accepts]: Start accepts. Automaton has 3344 states and 5408 transitions. Word has length 143 [2025-03-03 14:17:14,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:14,780 INFO L471 AbstractCegarLoop]: Abstraction has 3344 states and 5408 transitions. [2025-03-03 14:17:14,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:17:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 3344 states and 5408 transitions. [2025-03-03 14:17:14,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 14:17:14,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:14,784 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:14,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:17:14,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:14,985 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:14,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:14,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1856743861, now seen corresponding path program 1 times [2025-03-03 14:17:14,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:14,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161893979] [2025-03-03 14:17:14,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:14,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:14,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 14:17:15,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 14:17:15,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:15,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:17:15,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:15,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161893979] [2025-03-03 14:17:15,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161893979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:15,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184971717] [2025-03-03 14:17:15,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:15,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:15,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:15,220 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:15,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:17:15,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 14:17:15,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 14:17:15,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:15,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:15,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 1756 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 14:17:15,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:17:15,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:15,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184971717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:15,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:15,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-03-03 14:17:15,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974783381] [2025-03-03 14:17:15,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:15,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:15,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:15,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:15,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:17:15,572 INFO L87 Difference]: Start difference. First operand 3344 states and 5408 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 5 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:17:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:17,551 INFO L93 Difference]: Finished difference Result 10926 states and 17967 transitions. [2025-03-03 14:17:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:17:17,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 5 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 153 [2025-03-03 14:17:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:17,585 INFO L225 Difference]: With dead ends: 10926 [2025-03-03 14:17:17,585 INFO L226 Difference]: Without dead ends: 7635 [2025-03-03 14:17:17,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:17:17,599 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 2219 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 3639 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2309 SdHoareTripleChecker+Valid, 2179 SdHoareTripleChecker+Invalid, 4156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 3639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:17,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2309 Valid, 2179 Invalid, 4156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 3639 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 14:17:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7635 states. [2025-03-03 14:17:17,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7635 to 7148. [2025-03-03 14:17:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7148 states, 5415 states have (on average 1.602954755309326) internal successors, (8680), 5588 states have internal predecessors, (8680), 1314 states have call successors, (1314), 335 states have call predecessors, (1314), 418 states have return successors, (1652), 1290 states have call predecessors, (1652), 1309 states have call successors, (1652) [2025-03-03 14:17:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7148 states to 7148 states and 11646 transitions. [2025-03-03 14:17:17,864 INFO L78 Accepts]: Start accepts. Automaton has 7148 states and 11646 transitions. Word has length 153 [2025-03-03 14:17:17,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:17,865 INFO L471 AbstractCegarLoop]: Abstraction has 7148 states and 11646 transitions. [2025-03-03 14:17:17,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 5 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:17:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 7148 states and 11646 transitions. [2025-03-03 14:17:17,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 14:17:17,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:17,870 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:17,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:18,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:18,071 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:18,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:18,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1968585853, now seen corresponding path program 1 times [2025-03-03 14:17:18,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:18,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061330175] [2025-03-03 14:17:18,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:18,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:18,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 14:17:18,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 14:17:18,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:18,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:17:18,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:18,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061330175] [2025-03-03 14:17:18,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061330175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:18,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452694675] [2025-03-03 14:17:18,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:18,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:18,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:18,346 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:18,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:17:18,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 14:17:18,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 14:17:18,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:18,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:18,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 1773 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:17:18,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:17:18,603 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:18,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452694675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:18,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:18,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2025-03-03 14:17:18,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198022651] [2025-03-03 14:17:18,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:18,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:17:18,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:18,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:17:18,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:17:18,605 INFO L87 Difference]: Start difference. First operand 7148 states and 11646 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:17:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:18,904 INFO L93 Difference]: Finished difference Result 17476 states and 28776 transitions. [2025-03-03 14:17:18,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:17:18,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 158 [2025-03-03 14:17:18,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:18,958 INFO L225 Difference]: With dead ends: 17476 [2025-03-03 14:17:18,959 INFO L226 Difference]: Without dead ends: 10385 [2025-03-03 14:17:18,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:17:18,988 INFO L435 NwaCegarLoop]: 1641 mSDtfsCounter, 856 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 2547 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:18,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 2547 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:18,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10385 states. [2025-03-03 14:17:19,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10385 to 7136. [2025-03-03 14:17:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7136 states, 5409 states have (on average 1.6025143279718987) internal successors, (8668), 5576 states have internal predecessors, (8668), 1314 states have call successors, (1314), 335 states have call predecessors, (1314), 412 states have return successors, (1616), 1290 states have call predecessors, (1616), 1309 states have call successors, (1616) [2025-03-03 14:17:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 11598 transitions. [2025-03-03 14:17:19,439 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 11598 transitions. Word has length 158 [2025-03-03 14:17:19,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:19,440 INFO L471 AbstractCegarLoop]: Abstraction has 7136 states and 11598 transitions. [2025-03-03 14:17:19,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:17:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 11598 transitions. [2025-03-03 14:17:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 14:17:19,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:19,445 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:19,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:19,646 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,SelfDestructingSolverStorable23 [2025-03-03 14:17:19,646 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:19,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:19,647 INFO L85 PathProgramCache]: Analyzing trace with hash 625640964, now seen corresponding path program 1 times [2025-03-03 14:17:19,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:19,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870230761] [2025-03-03 14:17:19,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:19,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:19,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 14:17:19,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 14:17:19,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:19,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:17:19,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:19,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870230761] [2025-03-03 14:17:19,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870230761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:19,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257729519] [2025-03-03 14:17:19,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:19,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:19,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:19,904 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:19,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:17:20,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 14:17:20,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 14:17:20,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:20,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:20,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 1772 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:17:20,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:17:20,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:20,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257729519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:20,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:20,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:17:20,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647411966] [2025-03-03 14:17:20,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:20,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:20,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:20,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:20,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:17:20,301 INFO L87 Difference]: Start difference. First operand 7136 states and 11598 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:17:21,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:21,853 INFO L93 Difference]: Finished difference Result 19253 states and 31966 transitions. [2025-03-03 14:17:21,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:21,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 158 [2025-03-03 14:17:21,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:21,910 INFO L225 Difference]: With dead ends: 19253 [2025-03-03 14:17:21,910 INFO L226 Difference]: Without dead ends: 12162 [2025-03-03 14:17:21,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:17:21,931 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 2012 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2096 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:21,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2096 Valid, 941 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:17:21,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12162 states. [2025-03-03 14:17:22,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12162 to 11572. [2025-03-03 14:17:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11572 states, 8662 states have (on average 1.5923574232278919) internal successors, (13793), 8979 states have internal predecessors, (13793), 2232 states have call successors, (2232), 524 states have call predecessors, (2232), 677 states have return successors, (3008), 2230 states have call predecessors, (3008), 2227 states have call successors, (3008) [2025-03-03 14:17:22,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11572 states to 11572 states and 19033 transitions. [2025-03-03 14:17:22,445 INFO L78 Accepts]: Start accepts. Automaton has 11572 states and 19033 transitions. Word has length 158 [2025-03-03 14:17:22,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:22,446 INFO L471 AbstractCegarLoop]: Abstraction has 11572 states and 19033 transitions. [2025-03-03 14:17:22,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:17:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 11572 states and 19033 transitions. [2025-03-03 14:17:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 14:17:22,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:22,452 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:22,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 14:17:22,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-03 14:17:22,652 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:22,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:22,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2080183373, now seen corresponding path program 1 times [2025-03-03 14:17:22,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:22,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144921300] [2025-03-03 14:17:22,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:22,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:22,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 14:17:22,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 14:17:22,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:22,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:17:22,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:22,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144921300] [2025-03-03 14:17:22,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144921300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:22,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626408838] [2025-03-03 14:17:22,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:22,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:22,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:22,882 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:22,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 14:17:22,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 14:17:23,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 14:17:23,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:23,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:23,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 1774 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:17:23,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:17:23,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:23,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626408838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:23,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:23,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:17:23,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316720430] [2025-03-03 14:17:23,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:23,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:23,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:23,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:23,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:17:23,196 INFO L87 Difference]: Start difference. First operand 11572 states and 19033 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:17:25,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:25,565 INFO L93 Difference]: Finished difference Result 34013 states and 58203 transitions. [2025-03-03 14:17:25,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:25,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 159 [2025-03-03 14:17:25,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:25,680 INFO L225 Difference]: With dead ends: 34013 [2025-03-03 14:17:25,680 INFO L226 Difference]: Without dead ends: 22486 [2025-03-03 14:17:25,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:17:25,734 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 2015 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2098 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:25,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2098 Valid, 909 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 14:17:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22486 states. [2025-03-03 14:17:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22486 to 21427. [2025-03-03 14:17:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21427 states, 15753 states have (on average 1.5818574239827334) internal successors, (24919), 16442 states have internal predecessors, (24919), 4424 states have call successors, (4424), 902 states have call predecessors, (4424), 1249 states have return successors, (6866), 4490 states have call predecessors, (6866), 4419 states have call successors, (6866) [2025-03-03 14:17:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21427 states to 21427 states and 36209 transitions. [2025-03-03 14:17:26,862 INFO L78 Accepts]: Start accepts. Automaton has 21427 states and 36209 transitions. Word has length 159 [2025-03-03 14:17:26,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:26,863 INFO L471 AbstractCegarLoop]: Abstraction has 21427 states and 36209 transitions. [2025-03-03 14:17:26,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:17:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 21427 states and 36209 transitions. [2025-03-03 14:17:26,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 14:17:26,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:26,868 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:26,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 14:17:27,070 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,SelfDestructingSolverStorable25 [2025-03-03 14:17:27,070 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:27,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:27,071 INFO L85 PathProgramCache]: Analyzing trace with hash -61395682, now seen corresponding path program 1 times [2025-03-03 14:17:27,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:27,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010883833] [2025-03-03 14:17:27,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:27,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:27,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 14:17:27,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 14:17:27,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:27,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:27,509 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:17:27,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:27,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010883833] [2025-03-03 14:17:27,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010883833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:27,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475026725] [2025-03-03 14:17:27,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:27,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:27,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:27,517 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:27,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 14:17:27,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 14:17:27,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 14:17:27,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:27,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:27,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 1776 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:17:27,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:17:27,886 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:27,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475026725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:27,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:27,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:17:27,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376116516] [2025-03-03 14:17:27,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:27,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:27,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:27,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:27,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:17:27,887 INFO L87 Difference]: Start difference. First operand 21427 states and 36209 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:17:31,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:31,295 INFO L93 Difference]: Finished difference Result 67182 states and 121348 transitions. [2025-03-03 14:17:31,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:31,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 160 [2025-03-03 14:17:31,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:31,571 INFO L225 Difference]: With dead ends: 67182 [2025-03-03 14:17:31,571 INFO L226 Difference]: Without dead ends: 45800 [2025-03-03 14:17:31,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:17:31,684 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 2002 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2084 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:31,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2084 Valid, 905 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 14:17:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45800 states. [2025-03-03 14:17:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45800 to 43768. [2025-03-03 14:17:34,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43768 states, 31494 states have (on average 1.5710611545056201) internal successors, (49479), 33113 states have internal predecessors, (49479), 9772 states have call successors, (9772), 1658 states have call predecessors, (9772), 2501 states have return successors, (18108), 10046 states have call predecessors, (18108), 9767 states have call successors, (18108) [2025-03-03 14:17:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43768 states to 43768 states and 77359 transitions. [2025-03-03 14:17:34,694 INFO L78 Accepts]: Start accepts. Automaton has 43768 states and 77359 transitions. Word has length 160 [2025-03-03 14:17:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:34,695 INFO L471 AbstractCegarLoop]: Abstraction has 43768 states and 77359 transitions. [2025-03-03 14:17:34,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:17:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 43768 states and 77359 transitions. [2025-03-03 14:17:34,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 14:17:34,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:34,700 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:34,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:34,900 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,SelfDestructingSolverStorable26 [2025-03-03 14:17:34,901 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:34,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:34,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1903490483, now seen corresponding path program 1 times [2025-03-03 14:17:34,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:34,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294641496] [2025-03-03 14:17:34,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:34,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:34,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 14:17:34,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 14:17:34,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:34,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:17:35,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:35,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294641496] [2025-03-03 14:17:35,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294641496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:35,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025658420] [2025-03-03 14:17:35,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:35,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:35,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:35,118 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:35,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 14:17:35,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 14:17:35,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 14:17:35,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:35,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:35,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 1778 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:17:35,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:17:35,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:35,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025658420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:35,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:35,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:17:35,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48975611] [2025-03-03 14:17:35,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:35,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:35,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:35,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:35,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:17:35,438 INFO L87 Difference]: Start difference. First operand 43768 states and 77359 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:17:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:42,961 INFO L93 Difference]: Finished difference Result 143313 states and 281913 transitions. [2025-03-03 14:17:42,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:42,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 161 [2025-03-03 14:17:42,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:43,724 INFO L225 Difference]: With dead ends: 143313 [2025-03-03 14:17:43,725 INFO L226 Difference]: Without dead ends: 99590 [2025-03-03 14:17:43,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:17:43,983 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1989 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2070 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:43,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2070 Valid, 901 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 14:17:44,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99590 states. [2025-03-03 14:17:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99590 to 95745. [2025-03-03 14:17:50,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95745 states, 67323 states have (on average 1.559927513628329) internal successors, (105019), 71288 states have internal predecessors, (105019), 23128 states have call successors, (23128), 3170 states have call predecessors, (23128), 5293 states have return successors, (52714), 24034 states have call predecessors, (52714), 23123 states have call successors, (52714) [2025-03-03 14:17:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95745 states to 95745 states and 180861 transitions. [2025-03-03 14:17:51,691 INFO L78 Accepts]: Start accepts. Automaton has 95745 states and 180861 transitions. Word has length 161 [2025-03-03 14:17:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:51,691 INFO L471 AbstractCegarLoop]: Abstraction has 95745 states and 180861 transitions. [2025-03-03 14:17:51,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:17:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 95745 states and 180861 transitions. [2025-03-03 14:17:51,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 14:17:51,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:51,697 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:51,705 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-03 14:17:51,898 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,SelfDestructingSolverStorable27 [2025-03-03 14:17:51,898 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:51,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:51,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1121109048, now seen corresponding path program 1 times [2025-03-03 14:17:51,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:51,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444252377] [2025-03-03 14:17:51,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:51,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:51,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 14:17:51,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 14:17:51,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:51,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:17:52,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:52,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444252377] [2025-03-03 14:17:52,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444252377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:52,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544569417] [2025-03-03 14:17:52,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:52,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:52,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:52,497 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:52,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 14:17:52,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 14:17:52,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 14:17:52,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:52,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:52,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 1780 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:17:52,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:17:52,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:52,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544569417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:52,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:52,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:17:52,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669676417] [2025-03-03 14:17:52,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:52,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:52,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:52,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:52,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:17:52,861 INFO L87 Difference]: Start difference. First operand 95745 states and 180861 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18)