./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1493e9da3ad278988eda47a556733ebc5ac5411d3350d76fb478293d9e5d934e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:48:19,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:48:19,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:48:19,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:48:19,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:48:19,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:48:19,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:48:19,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:48:19,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:48:19,826 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:48:19,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:48:19,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:48:19,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:48:19,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:48:19,826 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:48:19,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:48:19,826 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:48:19,826 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:48:19,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:48:19,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:48:19,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:48:19,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:48:19,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:48:19,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:48:19,827 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:48:19,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:48:19,827 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:48:19,827 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:48:19,827 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:48:19,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:48:19,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:48:19,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:48:19,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:19,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:48:19,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:48:19,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:48:19,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:48:19,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:19,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:48:19,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:48:19,828 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:48:19,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:48:19,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:48:19,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:48:19,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:48:19,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:48:19,828 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:48:19,828 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:48:19,828 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1493e9da3ad278988eda47a556733ebc5ac5411d3350d76fb478293d9e5d934e [2025-01-09 03:48:20,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:48:20,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:48:20,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:48:20,084 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:48:20,084 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:48:20,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c [2025-01-09 03:48:21,363 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5e8ad863/63878eccb95b49e8b3e131d406b39c95/FLAG16f55fac8 [2025-01-09 03:48:21,764 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:48:21,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c [2025-01-09 03:48:21,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5e8ad863/63878eccb95b49e8b3e131d406b39c95/FLAG16f55fac8 [2025-01-09 03:48:21,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5e8ad863/63878eccb95b49e8b3e131d406b39c95 [2025-01-09 03:48:21,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:48:21,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:48:21,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:48:21,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:48:21,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:48:21,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:21" (1/1) ... [2025-01-09 03:48:21,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7a3495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:21, skipping insertion in model container [2025-01-09 03:48:21,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:21" (1/1) ... [2025-01-09 03:48:22,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:48:22,215 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c[11768,11781] [2025-01-09 03:48:22,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:48:22,415 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:48:22,422 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-01-09 03:48:22,424 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [414] [2025-01-09 03:48:22,424 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [452] [2025-01-09 03:48:22,424 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [461] [2025-01-09 03:48:22,424 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [626] [2025-01-09 03:48:22,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [640] [2025-01-09 03:48:22,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [739] [2025-01-09 03:48:22,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [859] [2025-01-09 03:48:22,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2444] [2025-01-09 03:48:22,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3105] [2025-01-09 03:48:22,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c[11768,11781] [2025-01-09 03:48:22,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:48:22,539 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:48:22,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:22 WrapperNode [2025-01-09 03:48:22,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:48:22,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:48:22,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:48:22,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:48:22,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:22" (1/1) ... [2025-01-09 03:48:22,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:22" (1/1) ... [2025-01-09 03:48:22,614 INFO L138 Inliner]: procedures = 95, calls = 344, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 869 [2025-01-09 03:48:22,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:48:22,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:48:22,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:48:22,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:48:22,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:22" (1/1) ... [2025-01-09 03:48:22,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:22" (1/1) ... [2025-01-09 03:48:22,634 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:22" (1/1) ... [2025-01-09 03:48:22,664 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-01-09 03:48:22,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:22" (1/1) ... [2025-01-09 03:48:22,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:22" (1/1) ... [2025-01-09 03:48:22,676 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:22" (1/1) ... [2025-01-09 03:48:22,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:22" (1/1) ... [2025-01-09 03:48:22,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:22" (1/1) ... [2025-01-09 03:48:22,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:22" (1/1) ... [2025-01-09 03:48:22,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:22" (1/1) ... [2025-01-09 03:48:22,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:48:22,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:48:22,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:48:22,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:48:22,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:22" (1/1) ... [2025-01-09 03:48:22,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:22,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:22,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:48:22,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:48:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:48:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-01-09 03:48:22,742 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-01-09 03:48:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-01-09 03:48:22,742 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-01-09 03:48:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:48:22,743 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:48:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:48:22,743 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:48:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:48:22,743 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:48:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-01-09 03:48:22,743 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-01-09 03:48:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:48:22,743 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:48:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:48:22,743 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:48:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-01-09 03:48:22,744 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-01-09 03:48:22,744 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:48:22,744 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:48:22,744 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:48:22,744 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:48:22,744 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:48:22,744 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:48:22,744 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:48:22,744 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:48:22,744 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-01-09 03:48:22,744 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-01-09 03:48:22,744 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:48:22,744 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:48:22,745 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:48:22,745 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:48:22,745 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:48:22,745 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:48:22,745 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:48:22,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:48:22,745 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:48:22,745 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:48:22,745 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-01-09 03:48:22,745 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-01-09 03:48:22,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:48:22,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:48:22,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:48:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:48:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:48:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:48:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:48:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:48:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:48:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:48:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:48:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:48:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:48:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:48:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:48:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:48:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:48:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:48:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:48:22,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:48:22,747 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-01-09 03:48:22,747 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-01-09 03:48:22,747 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:48:22,747 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:48:22,747 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:48:22,747 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:48:22,747 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:48:22,747 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:48:22,747 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2025-01-09 03:48:22,747 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2025-01-09 03:48:22,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:48:22,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:48:22,747 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:48:22,747 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:48:22,909 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:48:22,912 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:48:24,003 INFO L? ?]: Removed 455 outVars from TransFormulas that were not future-live. [2025-01-09 03:48:24,004 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:48:24,017 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:48:24,018 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:48:24,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:24 BoogieIcfgContainer [2025-01-09 03:48:24,018 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:48:24,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:48:24,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:48:24,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:48:24,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:48:21" (1/3) ... [2025-01-09 03:48:24,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571e182d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:24, skipping insertion in model container [2025-01-09 03:48:24,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:22" (2/3) ... [2025-01-09 03:48:24,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571e182d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:24, skipping insertion in model container [2025-01-09 03:48:24,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:24" (3/3) ... [2025-01-09 03:48:24,025 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product30.cil.c [2025-01-09 03:48:24,037 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:48:24,040 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product30.cil.c that has 27 procedures, 575 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:48:24,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:48:24,152 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;@3e8194d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:48:24,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:48:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 575 states, 451 states have (on average 1.6917960088691797) internal successors, (763), 474 states have internal predecessors, (763), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 03:48:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 03:48:24,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:24,175 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] [2025-01-09 03:48:24,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:24,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash 224187725, now seen corresponding path program 1 times [2025-01-09 03:48:24,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:24,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178004240] [2025-01-09 03:48:24,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:24,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:24,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 03:48:24,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 03:48:24,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:24,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:24,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:24,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178004240] [2025-01-09 03:48:24,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178004240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:24,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:24,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:24,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474914214] [2025-01-09 03:48:24,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:24,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:24,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:24,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:24,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:24,722 INFO L87 Difference]: Start difference. First operand has 575 states, 451 states have (on average 1.6917960088691797) internal successors, (763), 474 states have internal predecessors, (763), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:24,833 INFO L93 Difference]: Finished difference Result 1130 states and 1885 transitions. [2025-01-09 03:48:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:24,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2025-01-09 03:48:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:24,853 INFO L225 Difference]: With dead ends: 1130 [2025-01-09 03:48:24,854 INFO L226 Difference]: Without dead ends: 567 [2025-01-09 03:48:24,859 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-01-09 03:48:24,861 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 5 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2801 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-01-09 03:48:24,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2801 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:24,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-01-09 03:48:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-01-09 03:48:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 445 states have (on average 1.6898876404494383) internal successors, (752), 466 states have internal predecessors, (752), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 03:48:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 939 transitions. [2025-01-09 03:48:24,942 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 939 transitions. Word has length 62 [2025-01-09 03:48:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:24,942 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 939 transitions. [2025-01-09 03:48:24,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 939 transitions. [2025-01-09 03:48:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 03:48:24,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:24,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:24,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:48:24,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:24,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:24,953 INFO L85 PathProgramCache]: Analyzing trace with hash -334891032, now seen corresponding path program 1 times [2025-01-09 03:48:24,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:24,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654122930] [2025-01-09 03:48:24,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:24,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:24,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 03:48:25,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 03:48:25,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:25,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:25,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-01-09 03:48:25,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:25,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654122930] [2025-01-09 03:48:25,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654122930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:25,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:25,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:25,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047080663] [2025-01-09 03:48:25,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:25,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:25,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:25,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:25,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:25,166 INFO L87 Difference]: Start difference. First operand 567 states and 939 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:25,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:25,246 INFO L93 Difference]: Finished difference Result 1116 states and 1855 transitions. [2025-01-09 03:48:25,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:25,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 64 [2025-01-09 03:48:25,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:25,252 INFO L225 Difference]: With dead ends: 1116 [2025-01-09 03:48:25,253 INFO L226 Difference]: Without dead ends: 567 [2025-01-09 03:48:25,256 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-01-09 03:48:25,257 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 4 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2780 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-01-09 03:48:25,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2780 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-01-09 03:48:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-01-09 03:48:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 445 states have (on average 1.6876404494382022) internal successors, (751), 466 states have internal predecessors, (751), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 03:48:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 938 transitions. [2025-01-09 03:48:25,292 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 938 transitions. Word has length 64 [2025-01-09 03:48:25,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:25,292 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 938 transitions. [2025-01-09 03:48:25,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:25,293 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 938 transitions. [2025-01-09 03:48:25,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 03:48:25,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:25,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:25,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:48:25,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:25,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:25,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1208929821, now seen corresponding path program 1 times [2025-01-09 03:48:25,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:25,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836274281] [2025-01-09 03:48:25,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:25,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:25,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 03:48:25,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 03:48:25,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:25,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:25,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:25,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836274281] [2025-01-09 03:48:25,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836274281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:25,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:25,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:25,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263912108] [2025-01-09 03:48:25,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:25,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:25,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:25,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:25,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:25,461 INFO L87 Difference]: Start difference. First operand 567 states and 938 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:25,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:25,525 INFO L93 Difference]: Finished difference Result 1116 states and 1854 transitions. [2025-01-09 03:48:25,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:25,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2025-01-09 03:48:25,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:25,530 INFO L225 Difference]: With dead ends: 1116 [2025-01-09 03:48:25,532 INFO L226 Difference]: Without dead ends: 567 [2025-01-09 03:48:25,535 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-01-09 03:48:25,537 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 3 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2780 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-01-09 03:48:25,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2780 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-01-09 03:48:25,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-01-09 03:48:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 445 states have (on average 1.6853932584269662) internal successors, (750), 466 states have internal predecessors, (750), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 03:48:25,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 937 transitions. [2025-01-09 03:48:25,566 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 937 transitions. Word has length 65 [2025-01-09 03:48:25,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:25,566 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 937 transitions. [2025-01-09 03:48:25,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:25,567 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 937 transitions. [2025-01-09 03:48:25,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 03:48:25,568 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:25,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:25,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:48:25,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:25,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:25,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2060531084, now seen corresponding path program 1 times [2025-01-09 03:48:25,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:25,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090198384] [2025-01-09 03:48:25,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:25,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:25,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 03:48:25,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 03:48:25,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:25,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:25,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:25,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090198384] [2025-01-09 03:48:25,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090198384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:25,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:25,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:25,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046177611] [2025-01-09 03:48:25,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:25,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:25,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:25,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:25,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:25,719 INFO L87 Difference]: Start difference. First operand 567 states and 937 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:25,789 INFO L93 Difference]: Finished difference Result 1116 states and 1853 transitions. [2025-01-09 03:48:25,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:25,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2025-01-09 03:48:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:25,799 INFO L225 Difference]: With dead ends: 1116 [2025-01-09 03:48:25,799 INFO L226 Difference]: Without dead ends: 567 [2025-01-09 03:48:25,802 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-01-09 03:48:25,803 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 2 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2780 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-01-09 03:48:25,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2780 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:25,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-01-09 03:48:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-01-09 03:48:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 445 states have (on average 1.6831460674157304) internal successors, (749), 466 states have internal predecessors, (749), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 03:48:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 936 transitions. [2025-01-09 03:48:25,834 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 936 transitions. Word has length 66 [2025-01-09 03:48:25,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:25,834 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 936 transitions. [2025-01-09 03:48:25,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:25,835 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 936 transitions. [2025-01-09 03:48:25,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 03:48:25,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:25,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:25,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:48:25,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:25,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:25,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1366805759, now seen corresponding path program 1 times [2025-01-09 03:48:25,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:25,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238929505] [2025-01-09 03:48:25,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:25,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:25,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 03:48:25,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 03:48:25,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:25,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:25,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:25,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238929505] [2025-01-09 03:48:25,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238929505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:25,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:25,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:25,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105223136] [2025-01-09 03:48:25,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:25,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:25,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:25,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:25,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:25,960 INFO L87 Difference]: Start difference. First operand 567 states and 936 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:25,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:25,994 INFO L93 Difference]: Finished difference Result 1116 states and 1852 transitions. [2025-01-09 03:48:25,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:25,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2025-01-09 03:48:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:25,999 INFO L225 Difference]: With dead ends: 1116 [2025-01-09 03:48:25,999 INFO L226 Difference]: Without dead ends: 567 [2025-01-09 03:48:26,001 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-01-09 03:48:26,002 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 1 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2780 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-01-09 03:48:26,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2780 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:26,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-01-09 03:48:26,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-01-09 03:48:26,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 445 states have (on average 1.6808988764044943) internal successors, (748), 466 states have internal predecessors, (748), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 03:48:26,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 935 transitions. [2025-01-09 03:48:26,022 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 935 transitions. Word has length 67 [2025-01-09 03:48:26,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:26,024 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 935 transitions. [2025-01-09 03:48:26,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 935 transitions. [2025-01-09 03:48:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 03:48:26,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:26,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:26,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:48:26,026 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:26,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:26,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2270416, now seen corresponding path program 1 times [2025-01-09 03:48:26,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:26,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830151401] [2025-01-09 03:48:26,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:26,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:26,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:48:26,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:48:26,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:26,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:26,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:26,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830151401] [2025-01-09 03:48:26,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830151401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:26,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:26,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:48:26,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982992207] [2025-01-09 03:48:26,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:26,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:48:26,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:26,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:48:26,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:48:26,229 INFO L87 Difference]: Start difference. First operand 567 states and 935 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:26,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:26,343 INFO L93 Difference]: Finished difference Result 1082 states and 1784 transitions. [2025-01-09 03:48:26,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:48:26,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2025-01-09 03:48:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:26,348 INFO L225 Difference]: With dead ends: 1082 [2025-01-09 03:48:26,348 INFO L226 Difference]: Without dead ends: 582 [2025-01-09 03:48:26,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:48:26,351 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 91 mSDsluCounter, 6378 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7301 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:26,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7301 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:26,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-01-09 03:48:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2025-01-09 03:48:26,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 455 states have (on average 1.676923076923077) internal successors, (763), 478 states have internal predecessors, (763), 97 states have call successors, (97), 26 states have call predecessors, (97), 27 states have return successors, (94), 89 states have call predecessors, (94), 92 states have call successors, (94) [2025-01-09 03:48:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 954 transitions. [2025-01-09 03:48:26,372 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 954 transitions. Word has length 68 [2025-01-09 03:48:26,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:26,373 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 954 transitions. [2025-01-09 03:48:26,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:26,373 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 954 transitions. [2025-01-09 03:48:26,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 03:48:26,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:26,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:26,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:48:26,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:26,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:26,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1130920177, now seen corresponding path program 1 times [2025-01-09 03:48:26,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:26,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557998156] [2025-01-09 03:48:26,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:26,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:26,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:48:26,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:48:26,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:26,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:26,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:26,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557998156] [2025-01-09 03:48:26,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557998156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:26,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:26,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:26,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843166699] [2025-01-09 03:48:26,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:26,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:26,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:26,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:26,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:26,459 INFO L87 Difference]: Start difference. First operand 580 states and 954 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:26,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:26,490 INFO L93 Difference]: Finished difference Result 1134 states and 1878 transitions. [2025-01-09 03:48:26,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:26,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2025-01-09 03:48:26,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:26,494 INFO L225 Difference]: With dead ends: 1134 [2025-01-09 03:48:26,494 INFO L226 Difference]: Without dead ends: 561 [2025-01-09 03:48:26,495 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-01-09 03:48:26,496 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 0 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2782 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-01-09 03:48:26,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2782 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-01-09 03:48:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-01-09 03:48:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 439 states have (on average 1.671981776765376) internal successors, (734), 460 states have internal predecessors, (734), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 03:48:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 921 transitions. [2025-01-09 03:48:26,511 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 921 transitions. Word has length 68 [2025-01-09 03:48:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:26,511 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 921 transitions. [2025-01-09 03:48:26,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 921 transitions. [2025-01-09 03:48:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 03:48:26,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:26,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:26,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:48:26,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:26,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:26,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1830830124, now seen corresponding path program 1 times [2025-01-09 03:48:26,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:26,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459543591] [2025-01-09 03:48:26,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:26,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:26,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 03:48:26,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 03:48:26,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:26,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:26,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:26,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459543591] [2025-01-09 03:48:26,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459543591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:26,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:26,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:26,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608845868] [2025-01-09 03:48:26,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:26,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:26,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:26,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:26,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:26,614 INFO L87 Difference]: Start difference. First operand 561 states and 921 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:26,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:26,778 INFO L93 Difference]: Finished difference Result 1079 states and 1776 transitions. [2025-01-09 03:48:26,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:26,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2025-01-09 03:48:26,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:26,782 INFO L225 Difference]: With dead ends: 1079 [2025-01-09 03:48:26,782 INFO L226 Difference]: Without dead ends: 570 [2025-01-09 03:48:26,784 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-01-09 03:48:26,785 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 55 mSDsluCounter, 3483 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4361 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-01-09 03:48:26,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4361 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:26,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-01-09 03:48:26,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 561. [2025-01-09 03:48:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 439 states have (on average 1.6628701594533029) internal successors, (730), 460 states have internal predecessors, (730), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 03:48:26,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 917 transitions. [2025-01-09 03:48:26,805 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 917 transitions. Word has length 69 [2025-01-09 03:48:26,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:26,806 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 917 transitions. [2025-01-09 03:48:26,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:26,806 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 917 transitions. [2025-01-09 03:48:26,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 03:48:26,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:26,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:26,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:48:26,807 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:26,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:26,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1931006099, now seen corresponding path program 1 times [2025-01-09 03:48:26,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:26,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108960289] [2025-01-09 03:48:26,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:26,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:26,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 03:48:26,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 03:48:26,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:26,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:26,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:26,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108960289] [2025-01-09 03:48:26,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108960289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:26,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:26,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:26,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892155284] [2025-01-09 03:48:26,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:26,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:26,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:26,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:26,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:26,911 INFO L87 Difference]: Start difference. First operand 561 states and 917 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:27,054 INFO L93 Difference]: Finished difference Result 1079 states and 1772 transitions. [2025-01-09 03:48:27,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:27,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2025-01-09 03:48:27,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:27,059 INFO L225 Difference]: With dead ends: 1079 [2025-01-09 03:48:27,059 INFO L226 Difference]: Without dead ends: 570 [2025-01-09 03:48:27,061 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-01-09 03:48:27,061 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 54 mSDsluCounter, 3483 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4361 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-01-09 03:48:27,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4361 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:27,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-01-09 03:48:27,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 561. [2025-01-09 03:48:27,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 439 states have (on average 1.65375854214123) internal successors, (726), 460 states have internal predecessors, (726), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 03:48:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 913 transitions. [2025-01-09 03:48:27,081 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 913 transitions. Word has length 70 [2025-01-09 03:48:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:27,081 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 913 transitions. [2025-01-09 03:48:27,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 913 transitions. [2025-01-09 03:48:27,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 03:48:27,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:27,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:27,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:48:27,082 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:27,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:27,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1569996337, now seen corresponding path program 1 times [2025-01-09 03:48:27,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:27,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660649885] [2025-01-09 03:48:27,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:27,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:27,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 03:48:27,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 03:48:27,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:27,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:27,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:27,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660649885] [2025-01-09 03:48:27,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660649885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:27,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:27,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:27,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068711851] [2025-01-09 03:48:27,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:27,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:27,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:27,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:27,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:27,220 INFO L87 Difference]: Start difference. First operand 561 states and 913 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:27,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:27,392 INFO L93 Difference]: Finished difference Result 1079 states and 1768 transitions. [2025-01-09 03:48:27,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:27,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-01-09 03:48:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:27,399 INFO L225 Difference]: With dead ends: 1079 [2025-01-09 03:48:27,399 INFO L226 Difference]: Without dead ends: 570 [2025-01-09 03:48:27,402 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-01-09 03:48:27,402 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 53 mSDsluCounter, 3466 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4343 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-01-09 03:48:27,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4343 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-01-09 03:48:27,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 561. [2025-01-09 03:48:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 439 states have (on average 1.644646924829157) internal successors, (722), 460 states have internal predecessors, (722), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 03:48:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 909 transitions. [2025-01-09 03:48:27,419 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 909 transitions. Word has length 71 [2025-01-09 03:48:27,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:27,419 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 909 transitions. [2025-01-09 03:48:27,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 909 transitions. [2025-01-09 03:48:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 03:48:27,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:27,420 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:27,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:48:27,424 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:27,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:27,424 INFO L85 PathProgramCache]: Analyzing trace with hash -51710641, now seen corresponding path program 1 times [2025-01-09 03:48:27,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:27,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338072293] [2025-01-09 03:48:27,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:27,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:27,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 03:48:27,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 03:48:27,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:27,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:27,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:27,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:27,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338072293] [2025-01-09 03:48:27,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338072293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:27,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:27,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:27,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680308955] [2025-01-09 03:48:27,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:27,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:27,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:27,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:27,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:27,533 INFO L87 Difference]: Start difference. First operand 561 states and 909 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:27,594 INFO L93 Difference]: Finished difference Result 1070 states and 1750 transitions. [2025-01-09 03:48:27,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:48:27,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 71 [2025-01-09 03:48:27,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:27,598 INFO L225 Difference]: With dead ends: 1070 [2025-01-09 03:48:27,598 INFO L226 Difference]: Without dead ends: 540 [2025-01-09 03:48:27,600 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-01-09 03:48:27,600 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 84 mSDsluCounter, 4417 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5315 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-01-09 03:48:27,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5315 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:27,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-01-09 03:48:27,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-01-09 03:48:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 418 states have (on average 1.645933014354067) internal successors, (688), 439 states have internal predecessors, (688), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 03:48:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 875 transitions. [2025-01-09 03:48:27,635 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 875 transitions. Word has length 71 [2025-01-09 03:48:27,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:27,635 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 875 transitions. [2025-01-09 03:48:27,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 875 transitions. [2025-01-09 03:48:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 03:48:27,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:27,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:27,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:48:27,636 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:27,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:27,637 INFO L85 PathProgramCache]: Analyzing trace with hash 202869384, now seen corresponding path program 1 times [2025-01-09 03:48:27,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:27,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098179314] [2025-01-09 03:48:27,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:27,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:27,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 03:48:27,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 03:48:27,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:27,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:27,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:27,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:27,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098179314] [2025-01-09 03:48:27,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098179314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:27,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:27,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:27,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033246979] [2025-01-09 03:48:27,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:27,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:27,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:27,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:27,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:27,721 INFO L87 Difference]: Start difference. First operand 540 states and 875 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:27,776 INFO L93 Difference]: Finished difference Result 1049 states and 1716 transitions. [2025-01-09 03:48:27,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:27,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2025-01-09 03:48:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:27,781 INFO L225 Difference]: With dead ends: 1049 [2025-01-09 03:48:27,781 INFO L226 Difference]: Without dead ends: 540 [2025-01-09 03:48:27,782 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-01-09 03:48:27,783 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 17 mSDsluCounter, 3423 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4281 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-01-09 03:48:27,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4281 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:27,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-01-09 03:48:27,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-01-09 03:48:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 418 states have (on average 1.6435406698564594) internal successors, (687), 439 states have internal predecessors, (687), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 03:48:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 874 transitions. [2025-01-09 03:48:27,795 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 874 transitions. Word has length 72 [2025-01-09 03:48:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:27,795 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 874 transitions. [2025-01-09 03:48:27,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 874 transitions. [2025-01-09 03:48:27,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 03:48:27,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:27,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:27,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:48:27,796 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:27,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:27,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1501370422, now seen corresponding path program 1 times [2025-01-09 03:48:27,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:27,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440130080] [2025-01-09 03:48:27,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:27,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:27,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 03:48:27,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 03:48:27,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:27,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:27,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:27,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440130080] [2025-01-09 03:48:27,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440130080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:27,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:27,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:27,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288840474] [2025-01-09 03:48:27,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:27,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:27,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:27,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:27,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:27,903 INFO L87 Difference]: Start difference. First operand 540 states and 874 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:27,959 INFO L93 Difference]: Finished difference Result 1049 states and 1715 transitions. [2025-01-09 03:48:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:27,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-01-09 03:48:27,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:27,962 INFO L225 Difference]: With dead ends: 1049 [2025-01-09 03:48:27,962 INFO L226 Difference]: Without dead ends: 540 [2025-01-09 03:48:27,964 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-01-09 03:48:27,964 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 16 mSDsluCounter, 3423 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4281 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-01-09 03:48:27,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4281 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-01-09 03:48:27,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-01-09 03:48:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 418 states have (on average 1.6411483253588517) internal successors, (686), 439 states have internal predecessors, (686), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 03:48:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 873 transitions. [2025-01-09 03:48:27,976 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 873 transitions. Word has length 73 [2025-01-09 03:48:27,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:27,976 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 873 transitions. [2025-01-09 03:48:27,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 873 transitions. [2025-01-09 03:48:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 03:48:27,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:27,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:27,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:48:27,978 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:27,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:27,978 INFO L85 PathProgramCache]: Analyzing trace with hash 673268131, now seen corresponding path program 1 times [2025-01-09 03:48:27,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:27,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100238002] [2025-01-09 03:48:27,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:27,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:27,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 03:48:27,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 03:48:27,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:27,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:28,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:28,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100238002] [2025-01-09 03:48:28,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100238002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:28,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:28,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 03:48:28,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193757415] [2025-01-09 03:48:28,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:28,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:48:28,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:28,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:48:28,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:48:28,120 INFO L87 Difference]: Start difference. First operand 540 states and 873 transitions. Second operand has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:28,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:28,212 INFO L93 Difference]: Finished difference Result 1043 states and 1703 transitions. [2025-01-09 03:48:28,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:48:28,213 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 74 [2025-01-09 03:48:28,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:28,216 INFO L225 Difference]: With dead ends: 1043 [2025-01-09 03:48:28,216 INFO L226 Difference]: Without dead ends: 540 [2025-01-09 03:48:28,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:48:28,217 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 6 mSDsluCounter, 6834 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7691 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:28,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7691 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:28,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-01-09 03:48:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-01-09 03:48:28,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 418 states have (on average 1.638755980861244) internal successors, (685), 439 states have internal predecessors, (685), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 03:48:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 872 transitions. [2025-01-09 03:48:28,229 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 872 transitions. Word has length 74 [2025-01-09 03:48:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:28,229 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 872 transitions. [2025-01-09 03:48:28,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 872 transitions. [2025-01-09 03:48:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 03:48:28,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:28,230 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] [2025-01-09 03:48:28,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:48:28,230 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:28,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:28,230 INFO L85 PathProgramCache]: Analyzing trace with hash -729733387, now seen corresponding path program 1 times [2025-01-09 03:48:28,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:28,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366626885] [2025-01-09 03:48:28,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:28,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:28,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 03:48:28,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 03:48:28,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:28,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:28,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:28,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366626885] [2025-01-09 03:48:28,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366626885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:28,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:28,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:28,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132772603] [2025-01-09 03:48:28,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:28,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:28,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:28,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:28,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:28,391 INFO L87 Difference]: Start difference. First operand 540 states and 872 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-09 03:48:30,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:30,376 INFO L93 Difference]: Finished difference Result 1665 states and 2751 transitions. [2025-01-09 03:48:30,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:30,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 75 [2025-01-09 03:48:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:30,384 INFO L225 Difference]: With dead ends: 1665 [2025-01-09 03:48:30,385 INFO L226 Difference]: Without dead ends: 1170 [2025-01-09 03:48:30,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:48:30,389 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 3255 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 1933 mSolverCounterSat, 744 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3319 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 2677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 744 IncrementalHoareTripleChecker+Valid, 1933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:30,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3319 Valid, 962 Invalid, 2677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [744 Valid, 1933 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 03:48:30,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2025-01-09 03:48:30,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1038. [2025-01-09 03:48:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 811 states have (on average 1.6596794081381012) internal successors, (1346), 841 states have internal predecessors, (1346), 179 states have call successors, (179), 46 states have call predecessors, (179), 47 states have return successors, (181), 163 states have call predecessors, (181), 174 states have call successors, (181) [2025-01-09 03:48:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1706 transitions. [2025-01-09 03:48:30,432 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1706 transitions. Word has length 75 [2025-01-09 03:48:30,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:30,432 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1706 transitions. [2025-01-09 03:48:30,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-09 03:48:30,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1706 transitions. [2025-01-09 03:48:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:48:30,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:30,436 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:30,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:48:30,436 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:30,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:30,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1051374415, now seen corresponding path program 1 times [2025-01-09 03:48:30,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:30,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532173885] [2025-01-09 03:48:30,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:30,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:30,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:48:30,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:48:30,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:30,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:30,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:30,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532173885] [2025-01-09 03:48:30,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532173885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:30,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:30,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 03:48:30,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240750345] [2025-01-09 03:48:30,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:30,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:48:30,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:30,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:48:30,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:48:30,754 INFO L87 Difference]: Start difference. First operand 1038 states and 1706 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:48:35,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:35,127 INFO L93 Difference]: Finished difference Result 3756 states and 6200 transitions. [2025-01-09 03:48:35,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 03:48:35,127 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 113 [2025-01-09 03:48:35,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:35,140 INFO L225 Difference]: With dead ends: 3756 [2025-01-09 03:48:35,140 INFO L226 Difference]: Without dead ends: 2763 [2025-01-09 03:48:35,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-01-09 03:48:35,145 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 2828 mSDsluCounter, 3517 mSDsCounter, 0 mSdLazyCounter, 9772 mSolverCounterSat, 861 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2903 SdHoareTripleChecker+Valid, 4211 SdHoareTripleChecker+Invalid, 10633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 861 IncrementalHoareTripleChecker+Valid, 9772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:35,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2903 Valid, 4211 Invalid, 10633 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [861 Valid, 9772 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 03:48:35,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2025-01-09 03:48:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2669. [2025-01-09 03:48:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2026 states have (on average 1.6332675222112536) internal successors, (3309), 2102 states have internal predecessors, (3309), 516 states have call successors, (516), 109 states have call predecessors, (516), 126 states have return successors, (549), 490 states have call predecessors, (549), 511 states have call successors, (549) [2025-01-09 03:48:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 4374 transitions. [2025-01-09 03:48:35,248 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 4374 transitions. Word has length 113 [2025-01-09 03:48:35,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:35,248 INFO L471 AbstractCegarLoop]: Abstraction has 2669 states and 4374 transitions. [2025-01-09 03:48:35,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:48:35,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 4374 transitions. [2025-01-09 03:48:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:48:35,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:35,250 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:35,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:48:35,251 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:35,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:35,252 INFO L85 PathProgramCache]: Analyzing trace with hash 602113407, now seen corresponding path program 1 times [2025-01-09 03:48:35,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:35,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078373524] [2025-01-09 03:48:35,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:35,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:35,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:48:35,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:48:35,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:35,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:35,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:35,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078373524] [2025-01-09 03:48:35,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078373524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:35,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:35,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:48:35,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869325381] [2025-01-09 03:48:35,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:35,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:48:35,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:35,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:48:35,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:48:35,494 INFO L87 Difference]: Start difference. First operand 2669 states and 4374 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:48:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:36,945 INFO L93 Difference]: Finished difference Result 5321 states and 8868 transitions. [2025-01-09 03:48:36,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:48:36,946 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) Word has length 114 [2025-01-09 03:48:36,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:36,957 INFO L225 Difference]: With dead ends: 5321 [2025-01-09 03:48:36,957 INFO L226 Difference]: Without dead ends: 2697 [2025-01-09 03:48:36,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 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-01-09 03:48:36,967 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 1331 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 2820 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 3212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 2820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:36,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1558 Invalid, 3212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 2820 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 03:48:36,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2025-01-09 03:48:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2693. [2025-01-09 03:48:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2693 states, 2044 states have (on average 1.6276908023483365) internal successors, (3327), 2120 states have internal predecessors, (3327), 516 states have call successors, (516), 109 states have call predecessors, (516), 132 states have return successors, (615), 496 states have call predecessors, (615), 511 states have call successors, (615) [2025-01-09 03:48:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 4458 transitions. [2025-01-09 03:48:37,100 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 4458 transitions. Word has length 114 [2025-01-09 03:48:37,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:37,100 INFO L471 AbstractCegarLoop]: Abstraction has 2693 states and 4458 transitions. [2025-01-09 03:48:37,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:48:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 4458 transitions. [2025-01-09 03:48:37,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:48:37,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:37,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:37,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:48:37,106 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:37,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:37,107 INFO L85 PathProgramCache]: Analyzing trace with hash -708665452, now seen corresponding path program 1 times [2025-01-09 03:48:37,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:37,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843466887] [2025-01-09 03:48:37,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:37,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:37,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:48:37,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:48:37,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:37,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:37,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:37,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843466887] [2025-01-09 03:48:37,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843466887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:37,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:37,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:37,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580424604] [2025-01-09 03:48:37,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:37,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:37,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:37,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:37,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:37,325 INFO L87 Difference]: Start difference. First operand 2693 states and 4458 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:48:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:40,169 INFO L93 Difference]: Finished difference Result 8621 states and 14663 transitions. [2025-01-09 03:48:40,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 03:48:40,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 115 [2025-01-09 03:48:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:40,198 INFO L225 Difference]: With dead ends: 8621 [2025-01-09 03:48:40,198 INFO L226 Difference]: Without dead ends: 5973 [2025-01-09 03:48:40,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-01-09 03:48:40,211 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 2785 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 4634 mSolverCounterSat, 731 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2859 SdHoareTripleChecker+Valid, 2312 SdHoareTripleChecker+Invalid, 5365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 731 IncrementalHoareTripleChecker+Valid, 4634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:40,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2859 Valid, 2312 Invalid, 5365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [731 Valid, 4634 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 03:48:40,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2025-01-09 03:48:40,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 5674. [2025-01-09 03:48:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5674 states, 4278 states have (on average 1.608695652173913) internal successors, (6882), 4459 states have internal predecessors, (6882), 1111 states have call successors, (1111), 252 states have call predecessors, (1111), 284 states have return successors, (1296), 1039 states have call predecessors, (1296), 1106 states have call successors, (1296) [2025-01-09 03:48:40,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5674 states to 5674 states and 9289 transitions. [2025-01-09 03:48:40,531 INFO L78 Accepts]: Start accepts. Automaton has 5674 states and 9289 transitions. Word has length 115 [2025-01-09 03:48:40,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:40,531 INFO L471 AbstractCegarLoop]: Abstraction has 5674 states and 9289 transitions. [2025-01-09 03:48:40,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:48:40,532 INFO L276 IsEmpty]: Start isEmpty. Operand 5674 states and 9289 transitions. [2025-01-09 03:48:40,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 03:48:40,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:40,535 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:40,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:48:40,535 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:40,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:40,535 INFO L85 PathProgramCache]: Analyzing trace with hash -279213761, now seen corresponding path program 1 times [2025-01-09 03:48:40,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:40,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270532550] [2025-01-09 03:48:40,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:40,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:40,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:48:40,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:48:40,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:40,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:48:40,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:40,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270532550] [2025-01-09 03:48:40,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270532550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:40,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:40,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:40,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799996448] [2025-01-09 03:48:40,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:40,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:40,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:40,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:40,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:40,688 INFO L87 Difference]: Start difference. First operand 5674 states and 9289 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 03:48:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:43,334 INFO L93 Difference]: Finished difference Result 16362 states and 27362 transitions. [2025-01-09 03:48:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:48:43,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 117 [2025-01-09 03:48:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:43,418 INFO L225 Difference]: With dead ends: 16362 [2025-01-09 03:48:43,418 INFO L226 Difference]: Without dead ends: 10729 [2025-01-09 03:48:43,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:48:43,502 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 3409 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 3499 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3442 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 4533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 3499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:43,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3442 Valid, 2031 Invalid, 4533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 3499 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 03:48:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10729 states. [2025-01-09 03:48:43,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10729 to 9513. [2025-01-09 03:48:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9513 states, 6873 states have (on average 1.5888258402444349) internal successors, (10920), 7284 states have internal predecessors, (10920), 2183 states have call successors, (2183), 384 states have call predecessors, (2183), 456 states have return successors, (2605), 2117 states have call predecessors, (2605), 2178 states have call successors, (2605) [2025-01-09 03:48:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9513 states to 9513 states and 15708 transitions. [2025-01-09 03:48:43,972 INFO L78 Accepts]: Start accepts. Automaton has 9513 states and 15708 transitions. Word has length 117 [2025-01-09 03:48:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:43,973 INFO L471 AbstractCegarLoop]: Abstraction has 9513 states and 15708 transitions. [2025-01-09 03:48:43,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 03:48:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 9513 states and 15708 transitions. [2025-01-09 03:48:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:48:43,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:43,977 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:43,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:48:43,978 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:43,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:43,978 INFO L85 PathProgramCache]: Analyzing trace with hash 721381205, now seen corresponding path program 1 times [2025-01-09 03:48:43,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:43,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172212203] [2025-01-09 03:48:43,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:43,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:43,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:48:44,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:48:44,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:44,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:48:44,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:44,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172212203] [2025-01-09 03:48:44,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172212203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:44,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:44,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:44,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221884320] [2025-01-09 03:48:44,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:44,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:44,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:44,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:44,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:44,115 INFO L87 Difference]: Start difference. First operand 9513 states and 15708 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 03:48:48,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:48,263 INFO L93 Difference]: Finished difference Result 31788 states and 54175 transitions. [2025-01-09 03:48:48,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:48:48,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 118 [2025-01-09 03:48:48,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:48,405 INFO L225 Difference]: With dead ends: 31788 [2025-01-09 03:48:48,405 INFO L226 Difference]: Without dead ends: 22323 [2025-01-09 03:48:48,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:48:48,451 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 3422 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 3458 mSolverCounterSat, 1059 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3456 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 4517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1059 IncrementalHoareTripleChecker+Valid, 3458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:48,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3456 Valid, 2044 Invalid, 4517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1059 Valid, 3458 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 03:48:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22323 states. [2025-01-09 03:48:49,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22323 to 19972. [2025-01-09 03:48:49,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19972 states, 13545 states have (on average 1.564857881136951) internal successors, (21196), 14621 states have internal predecessors, (21196), 5556 states have call successors, (5556), 650 states have call predecessors, (5556), 870 states have return successors, (6904), 5568 states have call predecessors, (6904), 5551 states have call successors, (6904) [2025-01-09 03:48:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19972 states to 19972 states and 33656 transitions. [2025-01-09 03:48:49,885 INFO L78 Accepts]: Start accepts. Automaton has 19972 states and 33656 transitions. Word has length 118 [2025-01-09 03:48:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:49,886 INFO L471 AbstractCegarLoop]: Abstraction has 19972 states and 33656 transitions. [2025-01-09 03:48:49,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 03:48:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 19972 states and 33656 transitions. [2025-01-09 03:48:49,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:48:49,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:49,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:49,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:48:49,890 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:49,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:49,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2066975398, now seen corresponding path program 1 times [2025-01-09 03:48:49,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:49,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227271584] [2025-01-09 03:48:49,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:49,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:49,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:48:49,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:48:49,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:49,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:48:50,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:50,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227271584] [2025-01-09 03:48:50,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227271584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:50,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:50,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:50,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011852520] [2025-01-09 03:48:50,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:50,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:50,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:50,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:50,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:50,059 INFO L87 Difference]: Start difference. First operand 19972 states and 33656 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 03:48:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:56,093 INFO L93 Difference]: Finished difference Result 76998 states and 134671 transitions. [2025-01-09 03:48:56,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:48:56,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 119 [2025-01-09 03:48:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:56,547 INFO L225 Difference]: With dead ends: 76998 [2025-01-09 03:48:56,548 INFO L226 Difference]: Without dead ends: 57076 [2025-01-09 03:48:56,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:48:56,673 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 3434 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 3467 mSolverCounterSat, 1061 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3469 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 4528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1061 IncrementalHoareTripleChecker+Valid, 3467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:56,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3469 Valid, 2065 Invalid, 4528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1061 Valid, 3467 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 03:48:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57076 states. [2025-01-09 03:49:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57076 to 51159. [2025-01-09 03:49:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51159 states, 32439 states have (on average 1.543728228367089) internal successors, (50077), 35572 states have internal predecessors, (50077), 16751 states have call successors, (16751), 1182 states have call predecessors, (16751), 1968 states have return successors, (22005), 17183 states have call predecessors, (22005), 16746 states have call successors, (22005) [2025-01-09 03:49:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51159 states to 51159 states and 88833 transitions. [2025-01-09 03:49:01,338 INFO L78 Accepts]: Start accepts. Automaton has 51159 states and 88833 transitions. Word has length 119 [2025-01-09 03:49:01,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:01,339 INFO L471 AbstractCegarLoop]: Abstraction has 51159 states and 88833 transitions. [2025-01-09 03:49:01,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 03:49:01,339 INFO L276 IsEmpty]: Start isEmpty. Operand 51159 states and 88833 transitions. [2025-01-09 03:49:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:49:01,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:01,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:01,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:49:01,342 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:01,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:01,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2053746352, now seen corresponding path program 1 times [2025-01-09 03:49:01,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:01,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596581728] [2025-01-09 03:49:01,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:01,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:01,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:49:01,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:49:01,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:01,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:01,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:49:01,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:01,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596581728] [2025-01-09 03:49:01,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596581728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:01,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:01,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:49:01,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140764456] [2025-01-09 03:49:01,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:01,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:49:01,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:01,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:49:01,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:49:01,774 INFO L87 Difference]: Start difference. First operand 51159 states and 88833 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 03:49:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:17,279 INFO L93 Difference]: Finished difference Result 219826 states and 395668 transitions. [2025-01-09 03:49:17,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:49:17,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 120 [2025-01-09 03:49:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:18,952 INFO L225 Difference]: With dead ends: 219826 [2025-01-09 03:49:18,953 INFO L226 Difference]: Without dead ends: 168721 [2025-01-09 03:49:19,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:49:19,339 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 3446 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 3476 mSolverCounterSat, 1063 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3482 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 4539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1063 IncrementalHoareTripleChecker+Valid, 3476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:19,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3482 Valid, 2086 Invalid, 4539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1063 Valid, 3476 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 03:49:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168721 states.