./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec9_product25.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 68864d90c2581c7e2b9a72172352bcf9279d03107788434bd4ac5af6cc5db51a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:28:38,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:28:38,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:28:38,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:28:38,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:28:38,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:28:38,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:28:38,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:28:38,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:28:38,407 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:28:38,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:28:38,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:28:38,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:28:38,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:28:38,408 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:28:38,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:28:38,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:28:38,408 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:28:38,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:28:38,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:28:38,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:28:38,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:28:38,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:28:38,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:28:38,408 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:28:38,408 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:28:38,409 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:28:38,409 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:28:38,409 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:28:38,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:28:38,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:28:38,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:28:38,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:28:38,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:28:38,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:28:38,409 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:28:38,409 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:28:38,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:28:38,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:28:38,409 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:28:38,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:28:38,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:28:38,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:28:38,411 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 -> 68864d90c2581c7e2b9a72172352bcf9279d03107788434bd4ac5af6cc5db51a [2025-03-08 05:28:38,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:28:38,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:28:38,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:28:38,664 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:28:38,664 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:28:38,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c [2025-03-08 05:28:39,825 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a9d260ce/3963d1d64fba4b33a1ad263049d4f395/FLAGe223ded25 [2025-03-08 05:28:40,147 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:28:40,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c [2025-03-08 05:28:40,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a9d260ce/3963d1d64fba4b33a1ad263049d4f395/FLAGe223ded25 [2025-03-08 05:28:40,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a9d260ce/3963d1d64fba4b33a1ad263049d4f395 [2025-03-08 05:28:40,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:28:40,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:28:40,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:28:40,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:28:40,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:28:40,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:28:40" (1/1) ... [2025-03-08 05:28:40,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c1bedc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:40, skipping insertion in model container [2025-03-08 05:28:40,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:28:40" (1/1) ... [2025-03-08 05:28:40,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:28:40,532 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_spec9_product25.cil.c[23488,23501] [2025-03-08 05:28:40,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:28:40,674 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:28:40,682 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [48] [2025-03-08 05:28:40,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [213] [2025-03-08 05:28:40,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [334] [2025-03-08 05:28:40,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [432] [2025-03-08 05:28:40,684 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [446] [2025-03-08 05:28:40,684 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [812] [2025-03-08 05:28:40,684 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1166] [2025-03-08 05:28:40,685 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1175] [2025-03-08 05:28:40,685 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1842] [2025-03-08 05:28:40,685 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1877] [2025-03-08 05:28:40,715 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_spec9_product25.cil.c[23488,23501] [2025-03-08 05:28:40,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:28:40,786 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:28:40,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:40 WrapperNode [2025-03-08 05:28:40,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:28:40,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:28:40,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:28:40,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:28:40,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:40" (1/1) ... [2025-03-08 05:28:40,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:40" (1/1) ... [2025-03-08 05:28:40,852 INFO L138 Inliner]: procedures = 91, calls = 331, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 801 [2025-03-08 05:28:40,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:28:40,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:28:40,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:28:40,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:28:40,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:40" (1/1) ... [2025-03-08 05:28:40,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:40" (1/1) ... [2025-03-08 05:28:40,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:40" (1/1) ... [2025-03-08 05:28:40,893 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-08 05:28:40,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:40" (1/1) ... [2025-03-08 05:28:40,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:40" (1/1) ... [2025-03-08 05:28:40,912 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:40" (1/1) ... [2025-03-08 05:28:40,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:40" (1/1) ... [2025-03-08 05:28:40,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:40" (1/1) ... [2025-03-08 05:28:40,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:40" (1/1) ... [2025-03-08 05:28:40,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:28:40,928 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:28:40,928 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:28:40,928 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:28:40,930 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:40" (1/1) ... [2025-03-08 05:28:40,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:28:40,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:28:40,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:28:40,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:28:40,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:28:40,982 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-08 05:28:40,982 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-08 05:28:40,982 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-08 05:28:40,982 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-08 05:28:40,982 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:28:40,982 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:28:40,982 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:28:40,982 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:28:40,982 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:28:40,982 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:28:40,982 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:28:40,982 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:28:40,982 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:28:40,982 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:28:40,983 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:28:40,983 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:28:40,983 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:28:40,983 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:28:40,983 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:28:40,983 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:28:40,983 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:28:40,984 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:28:40,984 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:28:40,984 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:28:40,984 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:28:40,984 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:28:40,984 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-03-08 05:28:40,984 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:28:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:28:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:28:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:28:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:28:40,985 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:28:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:28:40,985 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:28:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:28:40,985 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:28:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:28:40,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:28:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:28:40,985 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:28:41,125 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:28:41,130 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:28:41,175 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L331: #res := ~retValue_acc~2; [2025-03-08 05:28:41,193 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L253: #res := ~retValue_acc~0; [2025-03-08 05:28:41,196 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1948: #res := ~retValue_acc~13; [2025-03-08 05:28:41,502 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2662: #res := ~retValue_acc~21; [2025-03-08 05:28:41,568 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2766: #res := ~retValue_acc~24; [2025-03-08 05:28:41,580 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L292: #res := ~retValue_acc~1; [2025-03-08 05:28:41,599 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2217: #res := ~retValue_acc~18; [2025-03-08 05:28:41,712 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2297-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~19#1; [2025-03-08 05:28:41,713 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2310-1: isIdle_#res#1 := isIdle_~retValue_acc~20#1; [2025-03-08 05:28:41,832 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~23#1; [2025-03-08 05:28:41,832 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2125-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1; [2025-03-08 05:28:41,832 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2134-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; [2025-03-08 05:28:41,832 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2168-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~16#1; [2025-03-08 05:28:41,877 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1528: #res := ~retValue_acc~9; [2025-03-08 05:28:41,935 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1163-1: main_#res#1 := main_~retValue_acc~7#1; [2025-03-08 05:28:41,935 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1874-1: valid_product_#res#1 := valid_product_~retValue_acc~12#1; [2025-03-08 05:28:41,942 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1292: #res := ~retValue_acc~8; [2025-03-08 05:28:41,946 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1839: #res := ~retValue_acc~10; [2025-03-08 05:28:42,064 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2025-03-08 05:28:42,065 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:28:42,084 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:28:42,084 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:28:42,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:28:42 BoogieIcfgContainer [2025-03-08 05:28:42,085 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:28:42,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:28:42,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:28:42,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:28:42,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:28:40" (1/3) ... [2025-03-08 05:28:42,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eaac8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:28:42, skipping insertion in model container [2025-03-08 05:28:42,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:40" (2/3) ... [2025-03-08 05:28:42,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eaac8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:28:42, skipping insertion in model container [2025-03-08 05:28:42,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:28:42" (3/3) ... [2025-03-08 05:28:42,097 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product25.cil.c [2025-03-08 05:28:42,107 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:28:42,111 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product25.cil.c that has 22 procedures, 530 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:28:42,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:28:42,176 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;@e669f87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:28:42,176 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:28:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 530 states, 422 states have (on average 1.7156398104265402) internal successors, (724), 443 states have internal predecessors, (724), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 05:28:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:28:42,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:42,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:42,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:42,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:42,205 INFO L85 PathProgramCache]: Analyzing trace with hash 218415754, now seen corresponding path program 1 times [2025-03-08 05:28:42,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:42,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358448407] [2025-03-08 05:28:42,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:42,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:42,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:28:42,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:28:42,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:42,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:42,670 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-08 05:28:42,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:42,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358448407] [2025-03-08 05:28:42,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358448407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:42,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:42,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:42,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560607308] [2025-03-08 05:28:42,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:42,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:42,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:42,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:42,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:42,694 INFO L87 Difference]: Start difference. First operand has 530 states, 422 states have (on average 1.7156398104265402) internal successors, (724), 443 states have internal predecessors, (724), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:42,827 INFO L93 Difference]: Finished difference Result 1040 states and 1763 transitions. [2025-03-08 05:28:42,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:42,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2025-03-08 05:28:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:42,846 INFO L225 Difference]: With dead ends: 1040 [2025-03-08 05:28:42,848 INFO L226 Difference]: Without dead ends: 522 [2025-03-08 05:28:42,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:42,861 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 5 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2618 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:42,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2618 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:42,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-08 05:28:42,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-08 05:28:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 416 states have (on average 1.7139423076923077) internal successors, (713), 435 states have internal predecessors, (713), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-08 05:28:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 878 transitions. [2025-03-08 05:28:42,930 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 878 transitions. Word has length 76 [2025-03-08 05:28:42,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:42,931 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 878 transitions. [2025-03-08 05:28:42,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 878 transitions. [2025-03-08 05:28:42,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 05:28:42,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:42,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:42,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:28:42,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:42,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:42,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1519048684, now seen corresponding path program 1 times [2025-03-08 05:28:42,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:42,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354807649] [2025-03-08 05:28:42,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:42,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:42,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 05:28:42,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 05:28:42,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:42,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:43,163 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-08 05:28:43,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:43,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354807649] [2025-03-08 05:28:43,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354807649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:43,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:43,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:43,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641473324] [2025-03-08 05:28:43,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:43,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:43,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:43,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:43,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:43,167 INFO L87 Difference]: Start difference. First operand 522 states and 878 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:43,230 INFO L93 Difference]: Finished difference Result 1026 states and 1733 transitions. [2025-03-08 05:28:43,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:43,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 78 [2025-03-08 05:28:43,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:43,234 INFO L225 Difference]: With dead ends: 1026 [2025-03-08 05:28:43,234 INFO L226 Difference]: Without dead ends: 522 [2025-03-08 05:28:43,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:43,236 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 4 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:43,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2597 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:43,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-08 05:28:43,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-08 05:28:43,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 416 states have (on average 1.7115384615384615) internal successors, (712), 435 states have internal predecessors, (712), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-08 05:28:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 877 transitions. [2025-03-08 05:28:43,266 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 877 transitions. Word has length 78 [2025-03-08 05:28:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:43,266 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 877 transitions. [2025-03-08 05:28:43,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 877 transitions. [2025-03-08 05:28:43,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 05:28:43,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:43,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:43,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:28:43,269 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:43,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:43,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1367842354, now seen corresponding path program 1 times [2025-03-08 05:28:43,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:43,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518870718] [2025-03-08 05:28:43,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:43,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:43,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 05:28:43,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 05:28:43,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:43,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:43,437 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-08 05:28:43,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:43,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518870718] [2025-03-08 05:28:43,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518870718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:43,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:43,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:43,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989154155] [2025-03-08 05:28:43,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:43,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:43,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:43,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:43,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:43,438 INFO L87 Difference]: Start difference. First operand 522 states and 877 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:43,490 INFO L93 Difference]: Finished difference Result 1026 states and 1732 transitions. [2025-03-08 05:28:43,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:43,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2025-03-08 05:28:43,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:43,495 INFO L225 Difference]: With dead ends: 1026 [2025-03-08 05:28:43,496 INFO L226 Difference]: Without dead ends: 522 [2025-03-08 05:28:43,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:43,499 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 3 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:43,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2597 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:43,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-08 05:28:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-08 05:28:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 416 states have (on average 1.7091346153846154) internal successors, (711), 435 states have internal predecessors, (711), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-08 05:28:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 876 transitions. [2025-03-08 05:28:43,523 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 876 transitions. Word has length 79 [2025-03-08 05:28:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:43,524 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 876 transitions. [2025-03-08 05:28:43,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 876 transitions. [2025-03-08 05:28:43,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 05:28:43,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:43,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:43,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:28:43,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:43,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:43,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1591454825, now seen corresponding path program 1 times [2025-03-08 05:28:43,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:43,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894664516] [2025-03-08 05:28:43,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:43,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:43,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 05:28:43,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 05:28:43,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:43,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:43,665 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-08 05:28:43,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:43,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894664516] [2025-03-08 05:28:43,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894664516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:43,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:43,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:43,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500520785] [2025-03-08 05:28:43,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:43,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:43,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:43,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:43,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:43,668 INFO L87 Difference]: Start difference. First operand 522 states and 876 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:43,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:43,713 INFO L93 Difference]: Finished difference Result 1026 states and 1731 transitions. [2025-03-08 05:28:43,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:43,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80 [2025-03-08 05:28:43,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:43,719 INFO L225 Difference]: With dead ends: 1026 [2025-03-08 05:28:43,720 INFO L226 Difference]: Without dead ends: 522 [2025-03-08 05:28:43,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:43,723 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 2 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:43,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2597 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:43,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-08 05:28:43,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-08 05:28:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 416 states have (on average 1.7067307692307692) internal successors, (710), 435 states have internal predecessors, (710), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-08 05:28:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 875 transitions. [2025-03-08 05:28:43,750 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 875 transitions. Word has length 80 [2025-03-08 05:28:43,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:43,751 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 875 transitions. [2025-03-08 05:28:43,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:43,752 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 875 transitions. [2025-03-08 05:28:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 05:28:43,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:43,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:43,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:28:43,754 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:43,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:43,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1098993003, now seen corresponding path program 1 times [2025-03-08 05:28:43,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:43,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976121775] [2025-03-08 05:28:43,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:43,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:43,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 05:28:43,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 05:28:43,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:43,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:43,895 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-08 05:28:43,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:43,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976121775] [2025-03-08 05:28:43,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976121775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:43,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:43,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:43,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033574284] [2025-03-08 05:28:43,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:43,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:43,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:43,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:43,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:43,897 INFO L87 Difference]: Start difference. First operand 522 states and 875 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:43,934 INFO L93 Difference]: Finished difference Result 1026 states and 1730 transitions. [2025-03-08 05:28:43,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:43,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2025-03-08 05:28:43,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:43,938 INFO L225 Difference]: With dead ends: 1026 [2025-03-08 05:28:43,938 INFO L226 Difference]: Without dead ends: 522 [2025-03-08 05:28:43,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:43,942 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 1 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:43,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2597 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-08 05:28:43,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-08 05:28:43,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 416 states have (on average 1.7043269230769231) internal successors, (709), 435 states have internal predecessors, (709), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-08 05:28:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 874 transitions. [2025-03-08 05:28:43,960 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 874 transitions. Word has length 81 [2025-03-08 05:28:43,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:43,960 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 874 transitions. [2025-03-08 05:28:43,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:43,961 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 874 transitions. [2025-03-08 05:28:43,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 05:28:43,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:43,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:43,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:28:43,963 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:43,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:43,963 INFO L85 PathProgramCache]: Analyzing trace with hash -976184550, now seen corresponding path program 1 times [2025-03-08 05:28:43,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:43,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807844796] [2025-03-08 05:28:43,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:43,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:43,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 05:28:43,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 05:28:43,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:43,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:44,135 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-08 05:28:44,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:44,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807844796] [2025-03-08 05:28:44,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807844796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:44,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:44,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:28:44,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085286158] [2025-03-08 05:28:44,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:44,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:28:44,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:44,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:28:44,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:44,138 INFO L87 Difference]: Start difference. First operand 522 states and 874 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:28:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:44,222 INFO L93 Difference]: Finished difference Result 992 states and 1662 transitions. [2025-03-08 05:28:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:28:44,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 82 [2025-03-08 05:28:44,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:44,226 INFO L225 Difference]: With dead ends: 992 [2025-03-08 05:28:44,227 INFO L226 Difference]: Without dead ends: 537 [2025-03-08 05:28:44,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:28:44,229 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 91 mSDsluCounter, 4239 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5103 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:44,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5103 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-08 05:28:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2025-03-08 05:28:44,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 426 states have (on average 1.699530516431925) internal successors, (724), 447 states have internal predecessors, (724), 86 states have call successors, (86), 21 states have call predecessors, (86), 22 states have return successors, (83), 79 states have call predecessors, (83), 81 states have call successors, (83) [2025-03-08 05:28:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 893 transitions. [2025-03-08 05:28:44,251 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 893 transitions. Word has length 82 [2025-03-08 05:28:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:44,251 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 893 transitions. [2025-03-08 05:28:44,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:28:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 893 transitions. [2025-03-08 05:28:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 05:28:44,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:44,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:44,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:28:44,254 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:44,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:44,255 INFO L85 PathProgramCache]: Analyzing trace with hash 328209179, now seen corresponding path program 1 times [2025-03-08 05:28:44,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:44,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645779742] [2025-03-08 05:28:44,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:44,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:44,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 05:28:44,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 05:28:44,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:44,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:44,343 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-08 05:28:44,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:44,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645779742] [2025-03-08 05:28:44,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645779742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:44,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:44,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:44,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436516724] [2025-03-08 05:28:44,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:44,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:44,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:44,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:44,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:44,345 INFO L87 Difference]: Start difference. First operand 535 states and 893 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:44,377 INFO L93 Difference]: Finished difference Result 1044 states and 1756 transitions. [2025-03-08 05:28:44,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:44,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 82 [2025-03-08 05:28:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:44,381 INFO L225 Difference]: With dead ends: 1044 [2025-03-08 05:28:44,381 INFO L226 Difference]: Without dead ends: 516 [2025-03-08 05:28:44,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:44,383 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 0 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2599 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:44,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2599 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-08 05:28:44,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-08 05:28:44,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 410 states have (on average 1.6951219512195121) internal successors, (695), 429 states have internal predecessors, (695), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-08 05:28:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 860 transitions. [2025-03-08 05:28:44,400 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 860 transitions. Word has length 82 [2025-03-08 05:28:44,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:44,401 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 860 transitions. [2025-03-08 05:28:44,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:44,401 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 860 transitions. [2025-03-08 05:28:44,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 05:28:44,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:44,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:44,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:28:44,403 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:44,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:44,404 INFO L85 PathProgramCache]: Analyzing trace with hash -834045724, now seen corresponding path program 1 times [2025-03-08 05:28:44,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:44,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19172531] [2025-03-08 05:28:44,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:44,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:44,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 05:28:44,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 05:28:44,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:44,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:44,508 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-08 05:28:44,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:44,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19172531] [2025-03-08 05:28:44,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19172531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:44,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:44,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:44,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218085601] [2025-03-08 05:28:44,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:44,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:44,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:44,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:44,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:44,510 INFO L87 Difference]: Start difference. First operand 516 states and 860 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:44,657 INFO L93 Difference]: Finished difference Result 989 states and 1654 transitions. [2025-03-08 05:28:44,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:44,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2025-03-08 05:28:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:44,661 INFO L225 Difference]: With dead ends: 989 [2025-03-08 05:28:44,661 INFO L226 Difference]: Without dead ends: 525 [2025-03-08 05:28:44,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:44,663 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 55 mSDsluCounter, 3239 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4056 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:44,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4056 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-08 05:28:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 516. [2025-03-08 05:28:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 410 states have (on average 1.6853658536585365) internal successors, (691), 429 states have internal predecessors, (691), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-08 05:28:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 856 transitions. [2025-03-08 05:28:44,676 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 856 transitions. Word has length 83 [2025-03-08 05:28:44,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:44,676 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 856 transitions. [2025-03-08 05:28:44,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:44,676 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 856 transitions. [2025-03-08 05:28:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 05:28:44,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:44,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:44,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:28:44,678 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:44,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:44,678 INFO L85 PathProgramCache]: Analyzing trace with hash -993615197, now seen corresponding path program 1 times [2025-03-08 05:28:44,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:44,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459959414] [2025-03-08 05:28:44,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:44,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:44,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 05:28:44,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 05:28:44,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:44,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:44,781 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-08 05:28:44,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:44,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459959414] [2025-03-08 05:28:44,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459959414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:44,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:44,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:44,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283344321] [2025-03-08 05:28:44,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:44,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:44,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:44,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:44,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:44,782 INFO L87 Difference]: Start difference. First operand 516 states and 856 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:44,909 INFO L93 Difference]: Finished difference Result 989 states and 1650 transitions. [2025-03-08 05:28:44,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:44,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-03-08 05:28:44,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:44,913 INFO L225 Difference]: With dead ends: 989 [2025-03-08 05:28:44,913 INFO L226 Difference]: Without dead ends: 525 [2025-03-08 05:28:44,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:44,915 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 54 mSDsluCounter, 3239 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4056 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:44,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4056 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:44,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-08 05:28:44,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 516. [2025-03-08 05:28:44,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 410 states have (on average 1.675609756097561) internal successors, (687), 429 states have internal predecessors, (687), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-08 05:28:44,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 852 transitions. [2025-03-08 05:28:44,928 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 852 transitions. Word has length 84 [2025-03-08 05:28:44,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:44,929 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 852 transitions. [2025-03-08 05:28:44,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:44,929 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 852 transitions. [2025-03-08 05:28:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 05:28:44,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:44,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:44,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:28:44,931 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:44,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:44,932 INFO L85 PathProgramCache]: Analyzing trace with hash 158346849, now seen corresponding path program 1 times [2025-03-08 05:28:44,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:44,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096275120] [2025-03-08 05:28:44,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:44,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:44,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 05:28:44,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 05:28:44,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:44,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:45,033 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-08 05:28:45,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:45,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096275120] [2025-03-08 05:28:45,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096275120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:45,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:45,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:45,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405326211] [2025-03-08 05:28:45,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:45,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:45,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:45,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:45,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:45,035 INFO L87 Difference]: Start difference. First operand 516 states and 852 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:45,166 INFO L93 Difference]: Finished difference Result 989 states and 1646 transitions. [2025-03-08 05:28:45,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:45,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2025-03-08 05:28:45,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:45,173 INFO L225 Difference]: With dead ends: 989 [2025-03-08 05:28:45,173 INFO L226 Difference]: Without dead ends: 525 [2025-03-08 05:28:45,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:45,176 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 53 mSDsluCounter, 3222 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4038 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:45,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4038 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:45,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-08 05:28:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 516. [2025-03-08 05:28:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 410 states have (on average 1.6658536585365853) internal successors, (683), 429 states have internal predecessors, (683), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-08 05:28:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 848 transitions. [2025-03-08 05:28:45,193 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 848 transitions. Word has length 85 [2025-03-08 05:28:45,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:45,194 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 848 transitions. [2025-03-08 05:28:45,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 848 transitions. [2025-03-08 05:28:45,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 05:28:45,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:45,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:45,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:28:45,197 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:45,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:45,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1294611986, now seen corresponding path program 1 times [2025-03-08 05:28:45,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:45,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925903373] [2025-03-08 05:28:45,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:45,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:45,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 05:28:45,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 05:28:45,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:45,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:45,312 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-08 05:28:45,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:45,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925903373] [2025-03-08 05:28:45,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925903373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:45,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:45,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:28:45,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715859072] [2025-03-08 05:28:45,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:45,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:28:45,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:45,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:28:45,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:45,314 INFO L87 Difference]: Start difference. First operand 516 states and 848 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:28:45,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:45,366 INFO L93 Difference]: Finished difference Result 980 states and 1628 transitions. [2025-03-08 05:28:45,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:28:45,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 85 [2025-03-08 05:28:45,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:45,371 INFO L225 Difference]: With dead ends: 980 [2025-03-08 05:28:45,372 INFO L226 Difference]: Without dead ends: 495 [2025-03-08 05:28:45,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:28:45,374 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 84 mSDsluCounter, 4112 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 4949 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:45,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 4949 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-08 05:28:45,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2025-03-08 05:28:45,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 389 states have (on average 1.6683804627249357) internal successors, (649), 408 states have internal predecessors, (649), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-08 05:28:45,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 814 transitions. [2025-03-08 05:28:45,388 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 814 transitions. Word has length 85 [2025-03-08 05:28:45,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:45,388 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 814 transitions. [2025-03-08 05:28:45,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:28:45,388 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 814 transitions. [2025-03-08 05:28:45,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 05:28:45,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:45,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:45,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:28:45,390 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:45,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:45,391 INFO L85 PathProgramCache]: Analyzing trace with hash -981886976, now seen corresponding path program 1 times [2025-03-08 05:28:45,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:45,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805407366] [2025-03-08 05:28:45,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:45,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:45,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 05:28:45,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 05:28:45,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:45,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:45,500 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-08 05:28:45,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:45,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805407366] [2025-03-08 05:28:45,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805407366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:45,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:45,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:45,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146157286] [2025-03-08 05:28:45,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:45,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:45,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:45,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:45,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:45,502 INFO L87 Difference]: Start difference. First operand 495 states and 814 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:45,566 INFO L93 Difference]: Finished difference Result 959 states and 1594 transitions. [2025-03-08 05:28:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:45,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2025-03-08 05:28:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:45,570 INFO L225 Difference]: With dead ends: 959 [2025-03-08 05:28:45,570 INFO L226 Difference]: Without dead ends: 495 [2025-03-08 05:28:45,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:45,574 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 17 mSDsluCounter, 3179 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3976 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:45,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3976 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:45,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-08 05:28:45,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2025-03-08 05:28:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 389 states have (on average 1.6658097686375322) internal successors, (648), 408 states have internal predecessors, (648), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-08 05:28:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 813 transitions. [2025-03-08 05:28:45,590 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 813 transitions. Word has length 86 [2025-03-08 05:28:45,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:45,590 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 813 transitions. [2025-03-08 05:28:45,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:45,590 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 813 transitions. [2025-03-08 05:28:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 05:28:45,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:45,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:45,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:28:45,592 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:45,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:45,593 INFO L85 PathProgramCache]: Analyzing trace with hash -165748770, now seen corresponding path program 1 times [2025-03-08 05:28:45,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:45,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542211933] [2025-03-08 05:28:45,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:45,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:28:45,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:28:45,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:45,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:45,687 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-08 05:28:45,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:45,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542211933] [2025-03-08 05:28:45,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542211933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:45,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:45,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:45,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973821702] [2025-03-08 05:28:45,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:45,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:45,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:45,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:45,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:45,689 INFO L87 Difference]: Start difference. First operand 495 states and 813 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:45,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:45,749 INFO L93 Difference]: Finished difference Result 959 states and 1593 transitions. [2025-03-08 05:28:45,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:45,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 87 [2025-03-08 05:28:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:45,753 INFO L225 Difference]: With dead ends: 959 [2025-03-08 05:28:45,753 INFO L226 Difference]: Without dead ends: 495 [2025-03-08 05:28:45,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:45,756 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 16 mSDsluCounter, 3179 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3976 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:45,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3976 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-08 05:28:45,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2025-03-08 05:28:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 389 states have (on average 1.6632390745501284) internal successors, (647), 408 states have internal predecessors, (647), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-08 05:28:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 812 transitions. [2025-03-08 05:28:45,783 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 812 transitions. Word has length 87 [2025-03-08 05:28:45,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:45,783 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 812 transitions. [2025-03-08 05:28:45,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:45,783 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 812 transitions. [2025-03-08 05:28:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 05:28:45,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:45,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:45,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:28:45,785 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:45,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:45,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1168380253, now seen corresponding path program 1 times [2025-03-08 05:28:45,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:45,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079193531] [2025-03-08 05:28:45,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:45,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:45,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 05:28:45,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 05:28:45,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:45,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:45,853 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-08 05:28:45,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:45,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079193531] [2025-03-08 05:28:45,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079193531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:45,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:45,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:45,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469146749] [2025-03-08 05:28:45,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:45,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:45,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:45,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:45,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:45,855 INFO L87 Difference]: Start difference. First operand 495 states and 812 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:45,890 INFO L93 Difference]: Finished difference Result 953 states and 1581 transitions. [2025-03-08 05:28:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:45,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2025-03-08 05:28:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:45,894 INFO L225 Difference]: With dead ends: 953 [2025-03-08 05:28:45,895 INFO L226 Difference]: Without dead ends: 495 [2025-03-08 05:28:45,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:45,897 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 5 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2390 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:45,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2390 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-08 05:28:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2025-03-08 05:28:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 389 states have (on average 1.660668380462725) internal successors, (646), 408 states have internal predecessors, (646), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-08 05:28:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 811 transitions. [2025-03-08 05:28:45,913 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 811 transitions. Word has length 88 [2025-03-08 05:28:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:45,913 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 811 transitions. [2025-03-08 05:28:45,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:28:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 811 transitions. [2025-03-08 05:28:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 05:28:45,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:45,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:45,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:28:45,917 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:45,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:45,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1483058389, now seen corresponding path program 1 times [2025-03-08 05:28:45,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:45,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651897264] [2025-03-08 05:28:45,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:45,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:45,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 05:28:45,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 05:28:45,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:45,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:46,102 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-08 05:28:46,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:46,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651897264] [2025-03-08 05:28:46,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651897264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:46,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:46,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:28:46,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136301782] [2025-03-08 05:28:46,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:46,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:28:46,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:46,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:28:46,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:28:46,104 INFO L87 Difference]: Start difference. First operand 495 states and 811 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:28:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:47,446 INFO L93 Difference]: Finished difference Result 949 states and 1593 transitions. [2025-03-08 05:28:47,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:28:47,446 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 89 [2025-03-08 05:28:47,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:47,451 INFO L225 Difference]: With dead ends: 949 [2025-03-08 05:28:47,451 INFO L226 Difference]: Without dead ends: 499 [2025-03-08 05:28:47,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:28:47,453 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 1258 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 2538 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 2888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 2538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:47,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 1535 Invalid, 2888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 2538 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 05:28:47,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-08 05:28:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2025-03-08 05:28:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 392 states have (on average 1.655612244897959) internal successors, (649), 411 states have internal predecessors, (649), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (96), 79 states have call predecessors, (96), 80 states have call successors, (96) [2025-03-08 05:28:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 830 transitions. [2025-03-08 05:28:47,479 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 830 transitions. Word has length 89 [2025-03-08 05:28:47,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:47,479 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 830 transitions. [2025-03-08 05:28:47,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:28:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 830 transitions. [2025-03-08 05:28:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:28:47,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:47,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:47,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:28:47,482 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:47,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:47,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1844934813, now seen corresponding path program 1 times [2025-03-08 05:28:47,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:47,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840986912] [2025-03-08 05:28:47,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:47,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:47,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:28:47,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:28:47,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:47,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:47,618 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-08 05:28:47,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:47,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840986912] [2025-03-08 05:28:47,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840986912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:47,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:47,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:28:47,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62644183] [2025-03-08 05:28:47,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:47,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:28:47,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:47,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:28:47,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:47,620 INFO L87 Difference]: Start difference. First operand 499 states and 830 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:28:50,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:50,148 INFO L93 Difference]: Finished difference Result 1764 states and 3029 transitions. [2025-03-08 05:28:50,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:28:50,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 90 [2025-03-08 05:28:50,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:50,157 INFO L225 Difference]: With dead ends: 1764 [2025-03-08 05:28:50,157 INFO L226 Difference]: Without dead ends: 1310 [2025-03-08 05:28:50,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:28:50,160 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 2264 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 4621 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2325 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 5184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 4621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:50,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2325 Valid, 2333 Invalid, 5184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 4621 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 05:28:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2025-03-08 05:28:50,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1251. [2025-03-08 05:28:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 980 states have (on average 1.6673469387755102) internal successors, (1634), 1028 states have internal predecessors, (1634), 216 states have call successors, (216), 54 states have call predecessors, (216), 54 states have return successors, (231), 205 states have call predecessors, (231), 211 states have call successors, (231) [2025-03-08 05:28:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 2081 transitions. [2025-03-08 05:28:50,247 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 2081 transitions. Word has length 90 [2025-03-08 05:28:50,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:50,247 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 2081 transitions. [2025-03-08 05:28:50,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:28:50,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 2081 transitions. [2025-03-08 05:28:50,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 05:28:50,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:50,249 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:50,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:28:50,249 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:50,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:50,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1978169425, now seen corresponding path program 1 times [2025-03-08 05:28:50,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:50,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135337625] [2025-03-08 05:28:50,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:50,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:50,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 05:28:50,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 05:28:50,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:50,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:50,369 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-08 05:28:50,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135337625] [2025-03-08 05:28:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135337625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:50,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:50,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:28:50,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356830509] [2025-03-08 05:28:50,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:50,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:28:50,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:50,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:28:50,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:50,371 INFO L87 Difference]: Start difference. First operand 1251 states and 2081 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:28:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:53,373 INFO L93 Difference]: Finished difference Result 5768 states and 9912 transitions. [2025-03-08 05:28:53,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:28:53,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 92 [2025-03-08 05:28:53,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:53,405 INFO L225 Difference]: With dead ends: 5768 [2025-03-08 05:28:53,405 INFO L226 Difference]: Without dead ends: 4562 [2025-03-08 05:28:53,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:28:53,417 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 2991 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 5292 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3110 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 6064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 5292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:53,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3110 Valid, 2635 Invalid, 6064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 5292 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 05:28:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4562 states. [2025-03-08 05:28:53,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4562 to 4085. [2025-03-08 05:28:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4085 states, 3027 states have (on average 1.6610505450941526) internal successors, (5028), 3239 states have internal predecessors, (5028), 895 states have call successors, (895), 146 states have call predecessors, (895), 162 states have return successors, (1089), 873 states have call predecessors, (1089), 890 states have call successors, (1089) [2025-03-08 05:28:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 7012 transitions. [2025-03-08 05:28:53,640 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 7012 transitions. Word has length 92 [2025-03-08 05:28:53,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:53,640 INFO L471 AbstractCegarLoop]: Abstraction has 4085 states and 7012 transitions. [2025-03-08 05:28:53,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:28:53,640 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 7012 transitions. [2025-03-08 05:28:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 05:28:53,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:53,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:53,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:28:53,643 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:53,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:53,643 INFO L85 PathProgramCache]: Analyzing trace with hash 944990573, now seen corresponding path program 1 times [2025-03-08 05:28:53,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:53,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222309164] [2025-03-08 05:28:53,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:53,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:53,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 05:28:53,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 05:28:53,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:53,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:53,777 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-08 05:28:53,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:53,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222309164] [2025-03-08 05:28:53,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222309164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:53,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:53,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:28:53,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692831107] [2025-03-08 05:28:53,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:53,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:28:53,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:53,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:28:53,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:53,778 INFO L87 Difference]: Start difference. First operand 4085 states and 7012 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:28:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:55,838 INFO L93 Difference]: Finished difference Result 10788 states and 18644 transitions. [2025-03-08 05:28:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 05:28:55,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 92 [2025-03-08 05:28:55,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:55,885 INFO L225 Difference]: With dead ends: 10788 [2025-03-08 05:28:55,886 INFO L226 Difference]: Without dead ends: 7838 [2025-03-08 05:28:55,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:28:55,899 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 2280 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 3493 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2347 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 3947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 3493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:55,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2347 Valid, 1553 Invalid, 3947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 3493 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 05:28:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7838 states. [2025-03-08 05:28:56,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7838 to 7541. [2025-03-08 05:28:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7541 states, 5626 states have (on average 1.658905083540704) internal successors, (9333), 6016 states have internal predecessors, (9333), 1587 states have call successors, (1587), 269 states have call predecessors, (1587), 327 states have return successors, (2060), 1546 states have call predecessors, (2060), 1582 states have call successors, (2060) [2025-03-08 05:28:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7541 states to 7541 states and 12980 transitions. [2025-03-08 05:28:56,262 INFO L78 Accepts]: Start accepts. Automaton has 7541 states and 12980 transitions. Word has length 92 [2025-03-08 05:28:56,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:56,263 INFO L471 AbstractCegarLoop]: Abstraction has 7541 states and 12980 transitions. [2025-03-08 05:28:56,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:28:56,263 INFO L276 IsEmpty]: Start isEmpty. Operand 7541 states and 12980 transitions. [2025-03-08 05:28:56,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 05:28:56,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:56,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:56,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:28:56,266 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:56,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:56,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1922215306, now seen corresponding path program 1 times [2025-03-08 05:28:56,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:56,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208911496] [2025-03-08 05:28:56,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:56,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:56,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 05:28:56,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 05:28:56,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:56,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:56,407 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-08 05:28:56,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:56,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208911496] [2025-03-08 05:28:56,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208911496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:56,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:56,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:28:56,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910553718] [2025-03-08 05:28:56,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:56,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:28:56,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:56,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:28:56,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:28:56,409 INFO L87 Difference]: Start difference. First operand 7541 states and 12980 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:28:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:56,724 INFO L93 Difference]: Finished difference Result 13869 states and 23936 transitions. [2025-03-08 05:28:56,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:28:56,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2025-03-08 05:28:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:56,776 INFO L225 Difference]: With dead ends: 13869 [2025-03-08 05:28:56,776 INFO L226 Difference]: Without dead ends: 7628 [2025-03-08 05:28:56,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:28:56,804 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 0 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3206 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:56,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3206 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:56,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7628 states. [2025-03-08 05:28:57,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7628 to 7614. [2025-03-08 05:28:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7614 states, 5682 states have (on average 1.6518831397395284) internal successors, (9386), 6071 states have internal predecessors, (9386), 1584 states have call successors, (1584), 269 states have call predecessors, (1584), 347 states have return successors, (2123), 1564 states have call predecessors, (2123), 1579 states have call successors, (2123) [2025-03-08 05:28:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7614 states to 7614 states and 13093 transitions. [2025-03-08 05:28:57,242 INFO L78 Accepts]: Start accepts. Automaton has 7614 states and 13093 transitions. Word has length 97 [2025-03-08 05:28:57,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:57,242 INFO L471 AbstractCegarLoop]: Abstraction has 7614 states and 13093 transitions. [2025-03-08 05:28:57,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:28:57,242 INFO L276 IsEmpty]: Start isEmpty. Operand 7614 states and 13093 transitions. [2025-03-08 05:28:57,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:28:57,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:57,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:57,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:28:57,245 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:57,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:57,245 INFO L85 PathProgramCache]: Analyzing trace with hash 726315366, now seen corresponding path program 1 times [2025-03-08 05:28:57,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:57,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058627462] [2025-03-08 05:28:57,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:57,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:57,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:28:57,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:28:57,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:57,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:57,423 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-08 05:28:57,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:57,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058627462] [2025-03-08 05:28:57,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058627462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:57,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:57,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:28:57,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625552731] [2025-03-08 05:28:57,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:57,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:28:57,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:57,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:28:57,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:28:57,427 INFO L87 Difference]: Start difference. First operand 7614 states and 13093 transitions. Second operand has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 05:28:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:57,816 INFO L93 Difference]: Finished difference Result 15095 states and 26409 transitions. [2025-03-08 05:28:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:28:57,816 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 104 [2025-03-08 05:28:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:57,866 INFO L225 Difference]: With dead ends: 15095 [2025-03-08 05:28:57,866 INFO L226 Difference]: Without dead ends: 7762 [2025-03-08 05:28:57,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:28:57,896 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 244 mSDsluCounter, 5646 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 6493 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:57,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 6493 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2025-03-08 05:28:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 7638. [2025-03-08 05:28:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7638 states, 5703 states have (on average 1.6284411713133438) internal successors, (9287), 6095 states have internal predecessors, (9287), 1584 states have call successors, (1584), 269 states have call predecessors, (1584), 350 states have return successors, (2135), 1564 states have call predecessors, (2135), 1579 states have call successors, (2135) [2025-03-08 05:28:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7638 states to 7638 states and 13006 transitions. [2025-03-08 05:28:58,247 INFO L78 Accepts]: Start accepts. Automaton has 7638 states and 13006 transitions. Word has length 104 [2025-03-08 05:28:58,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:58,248 INFO L471 AbstractCegarLoop]: Abstraction has 7638 states and 13006 transitions. [2025-03-08 05:28:58,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 05:28:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 7638 states and 13006 transitions. [2025-03-08 05:28:58,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:28:58,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:58,252 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:58,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:28:58,252 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:58,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:58,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1890665216, now seen corresponding path program 1 times [2025-03-08 05:28:58,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:58,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420653065] [2025-03-08 05:28:58,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:58,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:58,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:28:58,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:28:58,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:58,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:28:58,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:58,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420653065] [2025-03-08 05:28:58,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420653065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:58,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:58,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:28:58,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58804995] [2025-03-08 05:28:58,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:58,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:28:58,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:58,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:28:58,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:58,380 INFO L87 Difference]: Start difference. First operand 7638 states and 13006 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 05:29:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:00,314 INFO L93 Difference]: Finished difference Result 14506 states and 24740 transitions. [2025-03-08 05:29:00,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:29:00,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 109 [2025-03-08 05:29:00,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:00,355 INFO L225 Difference]: With dead ends: 14506 [2025-03-08 05:29:00,355 INFO L226 Difference]: Without dead ends: 8184 [2025-03-08 05:29:00,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:29:00,378 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 2004 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 3024 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2073 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 3438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 3024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:00,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2073 Valid, 1485 Invalid, 3438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 3024 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 05:29:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8184 states. [2025-03-08 05:29:00,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8184 to 7869. [2025-03-08 05:29:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7869 states, 5876 states have (on average 1.6170864533696392) internal successors, (9502), 6286 states have internal predecessors, (9502), 1601 states have call successors, (1601), 295 states have call predecessors, (1601), 391 states have return successors, (2224), 1578 states have call predecessors, (2224), 1596 states have call successors, (2224) [2025-03-08 05:29:00,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7869 states to 7869 states and 13327 transitions. [2025-03-08 05:29:00,835 INFO L78 Accepts]: Start accepts. Automaton has 7869 states and 13327 transitions. Word has length 109 [2025-03-08 05:29:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:00,836 INFO L471 AbstractCegarLoop]: Abstraction has 7869 states and 13327 transitions. [2025-03-08 05:29:00,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 05:29:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 7869 states and 13327 transitions. [2025-03-08 05:29:00,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:29:00,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:00,839 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:00,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:29:00,840 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:00,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:00,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1003897962, now seen corresponding path program 1 times [2025-03-08 05:29:00,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:00,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681813052] [2025-03-08 05:29:00,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:00,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:00,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:29:00,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:29:00,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:00,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:01,115 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:29:01,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:01,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681813052] [2025-03-08 05:29:01,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681813052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:01,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:01,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 05:29:01,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723556880] [2025-03-08 05:29:01,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:01,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:29:01,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:01,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:29:01,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:29:01,116 INFO L87 Difference]: Start difference. First operand 7869 states and 13327 transitions. Second operand has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-08 05:29:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:04,121 INFO L93 Difference]: Finished difference Result 16520 states and 27718 transitions. [2025-03-08 05:29:04,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 05:29:04,122 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 116 [2025-03-08 05:29:04,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:04,177 INFO L225 Difference]: With dead ends: 16520 [2025-03-08 05:29:04,178 INFO L226 Difference]: Without dead ends: 9786 [2025-03-08 05:29:04,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:29:04,208 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 2899 mSDsluCounter, 3009 mSDsCounter, 0 mSdLazyCounter, 7251 mSolverCounterSat, 623 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2972 SdHoareTripleChecker+Valid, 3361 SdHoareTripleChecker+Invalid, 7874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 623 IncrementalHoareTripleChecker+Valid, 7251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:04,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2972 Valid, 3361 Invalid, 7874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [623 Valid, 7251 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 05:29:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9786 states. [2025-03-08 05:29:04,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9786 to 9343. [2025-03-08 05:29:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9343 states, 7042 states have (on average 1.5934393638170974) internal successors, (11221), 7511 states have internal predecessors, (11221), 1784 states have call successors, (1784), 382 states have call predecessors, (1784), 516 states have return successors, (2497), 1740 states have call predecessors, (2497), 1779 states have call successors, (2497) [2025-03-08 05:29:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9343 states to 9343 states and 15502 transitions. [2025-03-08 05:29:04,553 INFO L78 Accepts]: Start accepts. Automaton has 9343 states and 15502 transitions. Word has length 116 [2025-03-08 05:29:04,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:04,553 INFO L471 AbstractCegarLoop]: Abstraction has 9343 states and 15502 transitions. [2025-03-08 05:29:04,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-08 05:29:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 9343 states and 15502 transitions. [2025-03-08 05:29:04,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:29:04,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:04,557 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:04,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:29:04,557 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:04,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:04,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1590328855, now seen corresponding path program 1 times [2025-03-08 05:29:04,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:04,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031354897] [2025-03-08 05:29:04,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:04,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:04,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:29:04,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:29:04,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:04,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:04,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:29:04,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:04,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031354897] [2025-03-08 05:29:04,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031354897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:04,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:04,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:29:04,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255486053] [2025-03-08 05:29:04,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:04,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:29:04,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:04,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:29:04,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:04,695 INFO L87 Difference]: Start difference. First operand 9343 states and 15502 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:29:05,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:05,244 INFO L93 Difference]: Finished difference Result 21925 states and 36477 transitions. [2025-03-08 05:29:05,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:29:05,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2025-03-08 05:29:05,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:05,330 INFO L225 Difference]: With dead ends: 21925 [2025-03-08 05:29:05,331 INFO L226 Difference]: Without dead ends: 13898 [2025-03-08 05:29:05,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:29:05,367 INFO L435 NwaCegarLoop]: 1331 mSDtfsCounter, 762 mSDsluCounter, 7382 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 8713 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:05,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 8713 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:29:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13898 states. [2025-03-08 05:29:05,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13898 to 12044. [2025-03-08 05:29:05,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12044 states, 9058 states have (on average 1.6067564583793332) internal successors, (14554), 9660 states have internal predecessors, (14554), 2355 states have call successors, (2355), 471 states have call predecessors, (2355), 630 states have return successors, (3236), 2320 states have call predecessors, (3236), 2350 states have call successors, (3236) [2025-03-08 05:29:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12044 states to 12044 states and 20145 transitions. [2025-03-08 05:29:05,922 INFO L78 Accepts]: Start accepts. Automaton has 12044 states and 20145 transitions. Word has length 116 [2025-03-08 05:29:05,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:05,923 INFO L471 AbstractCegarLoop]: Abstraction has 12044 states and 20145 transitions. [2025-03-08 05:29:05,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:29:05,923 INFO L276 IsEmpty]: Start isEmpty. Operand 12044 states and 20145 transitions. [2025-03-08 05:29:05,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:29:05,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:05,925 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:05,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:29:05,925 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:05,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:05,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2147351233, now seen corresponding path program 1 times [2025-03-08 05:29:05,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:05,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976426461] [2025-03-08 05:29:05,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:05,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:05,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:29:05,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:29:05,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:05,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:06,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:29:06,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:06,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976426461] [2025-03-08 05:29:06,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976426461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:06,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:06,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 05:29:06,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639027671] [2025-03-08 05:29:06,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:06,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:29:06,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:06,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:29:06,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:29:06,115 INFO L87 Difference]: Start difference. First operand 12044 states and 20145 transitions. Second operand has 12 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 6 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 05:29:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:10,433 INFO L93 Difference]: Finished difference Result 41978 states and 72837 transitions. [2025-03-08 05:29:10,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:29:10,434 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 6 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 114 [2025-03-08 05:29:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:10,694 INFO L225 Difference]: With dead ends: 41978 [2025-03-08 05:29:10,695 INFO L226 Difference]: Without dead ends: 29979 [2025-03-08 05:29:10,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:29:10,780 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 3923 mSDsluCounter, 5228 mSDsCounter, 0 mSdLazyCounter, 8303 mSolverCounterSat, 1178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3959 SdHoareTripleChecker+Valid, 6038 SdHoareTripleChecker+Invalid, 9481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1178 IncrementalHoareTripleChecker+Valid, 8303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:10,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3959 Valid, 6038 Invalid, 9481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1178 Valid, 8303 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 05:29:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29979 states. [2025-03-08 05:29:12,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29979 to 29786. [2025-03-08 05:29:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29786 states, 21046 states have (on average 1.5810130191010168) internal successors, (33274), 22849 states have internal predecessors, (33274), 7395 states have call successors, (7395), 937 states have call predecessors, (7395), 1344 states have return successors, (10462), 7375 states have call predecessors, (10462), 7390 states have call successors, (10462) [2025-03-08 05:29:12,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29786 states to 29786 states and 51131 transitions. [2025-03-08 05:29:12,283 INFO L78 Accepts]: Start accepts. Automaton has 29786 states and 51131 transitions. Word has length 114 [2025-03-08 05:29:12,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:12,283 INFO L471 AbstractCegarLoop]: Abstraction has 29786 states and 51131 transitions. [2025-03-08 05:29:12,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 6 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 05:29:12,283 INFO L276 IsEmpty]: Start isEmpty. Operand 29786 states and 51131 transitions. [2025-03-08 05:29:12,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:29:12,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:12,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:12,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 05:29:12,285 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:12,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:12,286 INFO L85 PathProgramCache]: Analyzing trace with hash 919339408, now seen corresponding path program 1 times [2025-03-08 05:29:12,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:12,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095680996] [2025-03-08 05:29:12,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:12,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:12,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:29:12,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:29:12,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:12,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:29:12,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:12,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095680996] [2025-03-08 05:29:12,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095680996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:12,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:12,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 05:29:12,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508604981] [2025-03-08 05:29:12,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:12,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:29:12,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:12,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:29:12,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:29:12,444 INFO L87 Difference]: Start difference. First operand 29786 states and 51131 transitions. Second operand has 12 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 6 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 05:29:19,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:19,690 INFO L93 Difference]: Finished difference Result 110855 states and 198542 transitions. [2025-03-08 05:29:19,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:29:19,691 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 6 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 115 [2025-03-08 05:29:19,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:20,341 INFO L225 Difference]: With dead ends: 110855 [2025-03-08 05:29:20,341 INFO L226 Difference]: Without dead ends: 81114 [2025-03-08 05:29:20,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:29:20,540 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 3917 mSDsluCounter, 5183 mSDsCounter, 0 mSdLazyCounter, 8305 mSolverCounterSat, 1167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3953 SdHoareTripleChecker+Valid, 5986 SdHoareTripleChecker+Invalid, 9472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1167 IncrementalHoareTripleChecker+Valid, 8305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:20,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3953 Valid, 5986 Invalid, 9472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1167 Valid, 8305 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 05:29:20,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81114 states. [2025-03-08 05:29:25,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81114 to 80745. [2025-03-08 05:29:25,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80745 states, 53142 states have (on average 1.554740130217154) internal successors, (82622), 58775 states have internal predecessors, (82622), 24678 states have call successors, (24678), 1869 states have call predecessors, (24678), 2924 states have return successors, (36496), 24854 states have call predecessors, (36496), 24673 states have call successors, (36496) [2025-03-08 05:29:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80745 states to 80745 states and 143796 transitions. [2025-03-08 05:29:26,657 INFO L78 Accepts]: Start accepts. Automaton has 80745 states and 143796 transitions. Word has length 115 [2025-03-08 05:29:26,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:26,658 INFO L471 AbstractCegarLoop]: Abstraction has 80745 states and 143796 transitions. [2025-03-08 05:29:26,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 6 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 05:29:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand 80745 states and 143796 transitions. [2025-03-08 05:29:26,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:29:26,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:26,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:26,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 05:29:26,660 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:26,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:26,661 INFO L85 PathProgramCache]: Analyzing trace with hash 549955874, now seen corresponding path program 1 times [2025-03-08 05:29:26,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:26,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760659027] [2025-03-08 05:29:26,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:26,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:26,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:29:26,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:29:26,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:26,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:27,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:29:27,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:27,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760659027] [2025-03-08 05:29:27,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760659027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:27,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:27,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 05:29:27,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434129889] [2025-03-08 05:29:27,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:27,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:29:27,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:27,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:29:27,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:29:27,041 INFO L87 Difference]: Start difference. First operand 80745 states and 143796 transitions. Second operand has 12 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 6 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12)