./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product09.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_spec2_product09.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 4cb164e6307f0ddcae5850d7f4578967441d1456f6ed5a5be472ba090758b873 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:44:13,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:44:13,657 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:44:13,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:44:13,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:44:13,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:44:13,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:44:13,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:44:13,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:44:13,676 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:44:13,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:44:13,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:44:13,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:44:13,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:44:13,677 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:44:13,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:44:13,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:44:13,677 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:44:13,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:44:13,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:44:13,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:44:13,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:44:13,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:44:13,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:44:13,677 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:44:13,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:44:13,678 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:44:13,678 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:44:13,678 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:44:13,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:44:13,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:44:13,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:44:13,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:44:13,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:44:13,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:44:13,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:44:13,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:44:13,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:44:13,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:44:13,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:44:13,678 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:44:13,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:44:13,678 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:44:13,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:44:13,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:44:13,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:44:13,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:44:13,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:44:13,679 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 -> 4cb164e6307f0ddcae5850d7f4578967441d1456f6ed5a5be472ba090758b873 [2025-01-09 03:44:13,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:44:13,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:44:13,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:44:13,910 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:44:13,910 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:44:13,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c [2025-01-09 03:44:15,120 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89246fcf0/f9864dcaeb8445afbd9f79686a4902f9/FLAG8cc9947db [2025-01-09 03:44:15,440 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:44:15,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c [2025-01-09 03:44:15,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89246fcf0/f9864dcaeb8445afbd9f79686a4902f9/FLAG8cc9947db [2025-01-09 03:44:15,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89246fcf0/f9864dcaeb8445afbd9f79686a4902f9 [2025-01-09 03:44:15,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:44:15,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:44:15,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:44:15,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:44:15,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:44:15,479 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:44:15" (1/1) ... [2025-01-09 03:44:15,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@721343d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:15, skipping insertion in model container [2025-01-09 03:44:15,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:44:15" (1/1) ... [2025-01-09 03:44:15,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:44:15,744 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_spec2_product09.cil.c[28842,28855] [2025-01-09 03:44:15,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:44:15,869 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:44:15,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-01-09 03:44:15,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [412] [2025-01-09 03:44:15,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [532] [2025-01-09 03:44:15,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [716] [2025-01-09 03:44:15,885 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1383] [2025-01-09 03:44:15,885 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1418] [2025-01-09 03:44:15,885 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1427] [2025-01-09 03:44:15,885 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2869] [2025-01-09 03:44:15,885 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3235] [2025-01-09 03:44:15,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3247] [2025-01-09 03:44:15,926 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_spec2_product09.cil.c[28842,28855] [2025-01-09 03:44:15,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:44:16,008 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:44:16,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:16 WrapperNode [2025-01-09 03:44:16,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:44:16,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:44:16,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:44:16,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:44:16,018 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:44:16" (1/1) ... [2025-01-09 03:44:16,045 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:44:16" (1/1) ... [2025-01-09 03:44:16,086 INFO L138 Inliner]: procedures = 89, calls = 330, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 808 [2025-01-09 03:44:16,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:44:16,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:44:16,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:44:16,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:44:16,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:16" (1/1) ... [2025-01-09 03:44:16,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:16" (1/1) ... [2025-01-09 03:44:16,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:16" (1/1) ... [2025-01-09 03:44:16,126 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-01-09 03:44:16,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:16" (1/1) ... [2025-01-09 03:44:16,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:16" (1/1) ... [2025-01-09 03:44:16,144 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:16" (1/1) ... [2025-01-09 03:44:16,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:16" (1/1) ... [2025-01-09 03:44:16,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:16" (1/1) ... [2025-01-09 03:44:16,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:16" (1/1) ... [2025-01-09 03:44:16,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:16" (1/1) ... [2025-01-09 03:44:16,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:44:16,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:44:16,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:44:16,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:44:16,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:16" (1/1) ... [2025-01-09 03:44:16,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:44:16,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:44:16,223 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:44:16,226 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:44:16,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:44:16,256 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-01-09 03:44:16,256 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-01-09 03:44:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:44:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:44:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:44:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:44:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:44:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:44:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:44:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:44:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:44:16,258 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:44:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-01-09 03:44:16,258 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-01-09 03:44:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:44:16,259 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:44:16,259 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:44:16,259 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:44:16,259 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:44:16,259 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:44:16,259 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:44:16,259 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:44:16,259 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:44:16,259 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:44:16,259 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:44:16,259 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:44:16,260 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:44:16,260 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:44:16,260 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:44:16,260 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:44:16,260 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:44:16,260 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:44:16,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:44:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:44:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:44:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:44:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:44:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:44:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:44:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:44:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:44:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:44:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:44:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:44:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:44:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:44:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:44:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:44:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:44:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:44:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:44:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:44:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:44:16,262 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:44:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:44:16,262 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:44:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:44:16,262 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:44:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:44:16,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:44:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:44:16,262 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:44:16,416 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:44:16,418 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:44:17,277 INFO L? ?]: Removed 421 outVars from TransFormulas that were not future-live. [2025-01-09 03:44:17,277 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:44:17,290 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:44:17,290 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:44:17,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:17 BoogieIcfgContainer [2025-01-09 03:44:17,291 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:44:17,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:44:17,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:44:17,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:44:17,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:44:15" (1/3) ... [2025-01-09 03:44:17,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7268a885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:17, skipping insertion in model container [2025-01-09 03:44:17,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:16" (2/3) ... [2025-01-09 03:44:17,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7268a885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:17, skipping insertion in model container [2025-01-09 03:44:17,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:17" (3/3) ... [2025-01-09 03:44:17,297 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product09.cil.c [2025-01-09 03:44:17,306 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:44:17,308 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product09.cil.c that has 21 procedures, 525 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:44:17,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:44:17,358 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;@7b9ff910, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:44:17,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:44:17,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 525 states, 417 states have (on average 1.7170263788968825) internal successors, (716), 438 states have internal predecessors, (716), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (86), 80 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 03:44:17,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 03:44:17,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:17,374 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:44:17,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:17,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:17,378 INFO L85 PathProgramCache]: Analyzing trace with hash -2125944385, now seen corresponding path program 1 times [2025-01-09 03:44:17,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:17,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615223351] [2025-01-09 03:44:17,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:17,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:17,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 03:44:17,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 03:44:17,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:17,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:17,826 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:44:17,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:17,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615223351] [2025-01-09 03:44:17,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615223351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:17,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:17,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:17,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782118082] [2025-01-09 03:44:17,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:17,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:17,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:17,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:17,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:17,848 INFO L87 Difference]: Start difference. First operand has 525 states, 417 states have (on average 1.7170263788968825) internal successors, (716), 438 states have internal predecessors, (716), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (86), 80 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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:44:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:17,992 INFO L93 Difference]: Finished difference Result 1030 states and 1751 transitions. [2025-01-09 03:44:17,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:17,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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 74 [2025-01-09 03:44:17,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:18,011 INFO L225 Difference]: With dead ends: 1030 [2025-01-09 03:44:18,012 INFO L226 Difference]: Without dead ends: 517 [2025-01-09 03:44:18,016 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:44:18,019 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 5 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2600 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:44:18,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2600 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-01-09 03:44:18,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-01-09 03:44:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.7153284671532847) internal successors, (705), 430 states have internal predecessors, (705), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 872 transitions. [2025-01-09 03:44:18,094 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 872 transitions. Word has length 74 [2025-01-09 03:44:18,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:18,095 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 872 transitions. [2025-01-09 03:44:18,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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:44:18,095 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 872 transitions. [2025-01-09 03:44:18,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 03:44:18,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:18,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:18,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:44:18,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:18,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:18,101 INFO L85 PathProgramCache]: Analyzing trace with hash 64359012, now seen corresponding path program 1 times [2025-01-09 03:44:18,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:18,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391140094] [2025-01-09 03:44:18,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:18,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:18,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 03:44:18,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 03:44:18,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:18,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:18,348 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:44:18,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:18,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391140094] [2025-01-09 03:44:18,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391140094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:18,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:18,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:18,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90168644] [2025-01-09 03:44:18,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:18,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:18,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:18,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:18,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:18,351 INFO L87 Difference]: Start difference. First operand 517 states and 872 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (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:44:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:18,462 INFO L93 Difference]: Finished difference Result 1016 states and 1721 transitions. [2025-01-09 03:44:18,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:18,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (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 76 [2025-01-09 03:44:18,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:18,469 INFO L225 Difference]: With dead ends: 1016 [2025-01-09 03:44:18,469 INFO L226 Difference]: Without dead ends: 517 [2025-01-09 03:44:18,472 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:44:18,474 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 4 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2579 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:18,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2579 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:18,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-01-09 03:44:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-01-09 03:44:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.7128953771289537) internal successors, (704), 430 states have internal predecessors, (704), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 871 transitions. [2025-01-09 03:44:18,510 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 871 transitions. Word has length 76 [2025-01-09 03:44:18,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:18,510 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 871 transitions. [2025-01-09 03:44:18,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (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:44:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 871 transitions. [2025-01-09 03:44:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 03:44:18,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:18,514 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] [2025-01-09 03:44:18,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:44:18,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:18,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:18,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1887128342, now seen corresponding path program 1 times [2025-01-09 03:44:18,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:18,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397358140] [2025-01-09 03:44:18,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:18,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:18,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 03:44:18,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 03:44:18,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:18,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:18,675 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:44:18,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:18,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397358140] [2025-01-09 03:44:18,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397358140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:18,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:18,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:18,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796140859] [2025-01-09 03:44:18,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:18,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:18,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:18,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:18,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:18,678 INFO L87 Difference]: Start difference. First operand 517 states and 871 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (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:44:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:18,743 INFO L93 Difference]: Finished difference Result 1016 states and 1720 transitions. [2025-01-09 03:44:18,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:18,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (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 77 [2025-01-09 03:44:18,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:18,749 INFO L225 Difference]: With dead ends: 1016 [2025-01-09 03:44:18,750 INFO L226 Difference]: Without dead ends: 517 [2025-01-09 03:44:18,752 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:44:18,752 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 3 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2579 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:44:18,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2579 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:18,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-01-09 03:44:18,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-01-09 03:44:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.710462287104623) internal successors, (703), 430 states have internal predecessors, (703), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 870 transitions. [2025-01-09 03:44:18,784 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 870 transitions. Word has length 77 [2025-01-09 03:44:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:18,785 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 870 transitions. [2025-01-09 03:44:18,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (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:44:18,786 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 870 transitions. [2025-01-09 03:44:18,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 03:44:18,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:18,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:18,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:44:18,791 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:18,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:18,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1723609512, now seen corresponding path program 1 times [2025-01-09 03:44:18,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:18,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328492729] [2025-01-09 03:44:18,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:18,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:18,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 03:44:18,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 03:44:18,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:18,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:18,938 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:44:18,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:18,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328492729] [2025-01-09 03:44:18,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328492729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:18,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:18,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:18,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79726211] [2025-01-09 03:44:18,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:18,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:18,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:18,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:18,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:18,941 INFO L87 Difference]: Start difference. First operand 517 states and 870 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (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:44:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:18,991 INFO L93 Difference]: Finished difference Result 1016 states and 1719 transitions. [2025-01-09 03:44:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:18,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (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 78 [2025-01-09 03:44:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:18,999 INFO L225 Difference]: With dead ends: 1016 [2025-01-09 03:44:18,999 INFO L226 Difference]: Without dead ends: 517 [2025-01-09 03:44:19,002 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:44:19,004 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 2 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2579 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:44:19,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2579 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:19,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-01-09 03:44:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-01-09 03:44:19,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.7080291970802919) internal successors, (702), 430 states have internal predecessors, (702), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 869 transitions. [2025-01-09 03:44:19,039 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 869 transitions. Word has length 78 [2025-01-09 03:44:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:19,042 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 869 transitions. [2025-01-09 03:44:19,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (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:44:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 869 transitions. [2025-01-09 03:44:19,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 03:44:19,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:19,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:19,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:44:19,046 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:19,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:19,046 INFO L85 PathProgramCache]: Analyzing trace with hash 114699866, now seen corresponding path program 1 times [2025-01-09 03:44:19,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:19,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695572107] [2025-01-09 03:44:19,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:19,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:19,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 03:44:19,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 03:44:19,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:19,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:19,214 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:44:19,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:19,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695572107] [2025-01-09 03:44:19,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695572107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:19,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:19,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:19,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401316388] [2025-01-09 03:44:19,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:19,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:19,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:19,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:19,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:19,218 INFO L87 Difference]: Start difference. First operand 517 states and 869 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (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:44:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:19,253 INFO L93 Difference]: Finished difference Result 1016 states and 1718 transitions. [2025-01-09 03:44:19,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:19,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (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 79 [2025-01-09 03:44:19,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:19,258 INFO L225 Difference]: With dead ends: 1016 [2025-01-09 03:44:19,258 INFO L226 Difference]: Without dead ends: 517 [2025-01-09 03:44:19,259 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:44:19,261 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 1 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2579 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:44:19,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2579 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-01-09 03:44:19,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-01-09 03:44:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.705596107055961) internal successors, (701), 430 states have internal predecessors, (701), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 868 transitions. [2025-01-09 03:44:19,285 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 868 transitions. Word has length 79 [2025-01-09 03:44:19,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:19,285 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 868 transitions. [2025-01-09 03:44:19,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (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:44:19,286 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 868 transitions. [2025-01-09 03:44:19,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 03:44:19,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:19,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:19,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:44:19,288 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:19,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:19,289 INFO L85 PathProgramCache]: Analyzing trace with hash 943315180, now seen corresponding path program 1 times [2025-01-09 03:44:19,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:19,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969455013] [2025-01-09 03:44:19,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:19,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:19,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 03:44:19,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 03:44:19,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:19,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:19,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:19,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969455013] [2025-01-09 03:44:19,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969455013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:19,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:19,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:19,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351334319] [2025-01-09 03:44:19,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:19,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:19,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:19,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:19,439 INFO L87 Difference]: Start difference. First operand 517 states and 868 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (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:44:19,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:19,523 INFO L93 Difference]: Finished difference Result 982 states and 1650 transitions. [2025-01-09 03:44:19,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:44:19,524 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (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 80 [2025-01-09 03:44:19,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:19,529 INFO L225 Difference]: With dead ends: 982 [2025-01-09 03:44:19,529 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 03:44:19,530 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:44:19,532 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 91 mSDsluCounter, 4209 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5067 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:19,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5067 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:19,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 03:44:19,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 530. [2025-01-09 03:44:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 421 states have (on average 1.700712589073634) internal successors, (716), 442 states have internal predecessors, (716), 87 states have call successors, (87), 20 states have call predecessors, (87), 21 states have return successors, (84), 80 states have call predecessors, (84), 82 states have call successors, (84) [2025-01-09 03:44:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 887 transitions. [2025-01-09 03:44:19,552 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 887 transitions. Word has length 80 [2025-01-09 03:44:19,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:19,553 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 887 transitions. [2025-01-09 03:44:19,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (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:44:19,553 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 887 transitions. [2025-01-09 03:44:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 03:44:19,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:19,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:19,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:44:19,558 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:19,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:19,559 INFO L85 PathProgramCache]: Analyzing trace with hash 734616877, now seen corresponding path program 1 times [2025-01-09 03:44:19,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:19,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669002698] [2025-01-09 03:44:19,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:19,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:19,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 03:44:19,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 03:44:19,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:19,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:19,631 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:44:19,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:19,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669002698] [2025-01-09 03:44:19,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669002698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:19,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:19,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:19,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433458495] [2025-01-09 03:44:19,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:19,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:19,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:19,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:19,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:19,634 INFO L87 Difference]: Start difference. First operand 530 states and 887 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (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:44:19,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:19,671 INFO L93 Difference]: Finished difference Result 1034 states and 1744 transitions. [2025-01-09 03:44:19,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:19,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (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 80 [2025-01-09 03:44:19,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:19,675 INFO L225 Difference]: With dead ends: 1034 [2025-01-09 03:44:19,675 INFO L226 Difference]: Without dead ends: 511 [2025-01-09 03:44:19,677 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:44:19,678 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 0 mSDsluCounter, 1719 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2581 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:44:19,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2581 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:19,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-01-09 03:44:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-01-09 03:44:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 405 states have (on average 1.6962962962962962) internal successors, (687), 424 states have internal predecessors, (687), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 854 transitions. [2025-01-09 03:44:19,721 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 854 transitions. Word has length 80 [2025-01-09 03:44:19,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:19,723 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 854 transitions. [2025-01-09 03:44:19,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (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:44:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 854 transitions. [2025-01-09 03:44:19,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 03:44:19,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:19,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:19,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:44:19,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:19,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:19,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1585754696, now seen corresponding path program 1 times [2025-01-09 03:44:19,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:19,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985532088] [2025-01-09 03:44:19,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:19,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:19,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 03:44:19,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 03:44:19,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:19,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:19,840 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:44:19,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:19,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985532088] [2025-01-09 03:44:19,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985532088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:19,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:19,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:19,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542561274] [2025-01-09 03:44:19,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:19,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:19,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:19,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:19,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:19,843 INFO L87 Difference]: Start difference. First operand 511 states and 854 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (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:44:20,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:20,011 INFO L93 Difference]: Finished difference Result 979 states and 1642 transitions. [2025-01-09 03:44:20,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:20,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (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 81 [2025-01-09 03:44:20,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:20,015 INFO L225 Difference]: With dead ends: 979 [2025-01-09 03:44:20,015 INFO L226 Difference]: Without dead ends: 520 [2025-01-09 03:44:20,017 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:44:20,018 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 55 mSDsluCounter, 3215 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4026 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:44:20,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4026 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:20,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-01-09 03:44:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 511. [2025-01-09 03:44:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 405 states have (on average 1.6864197530864198) internal successors, (683), 424 states have internal predecessors, (683), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:20,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 850 transitions. [2025-01-09 03:44:20,035 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 850 transitions. Word has length 81 [2025-01-09 03:44:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:20,036 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 850 transitions. [2025-01-09 03:44:20,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (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:44:20,036 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 850 transitions. [2025-01-09 03:44:20,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 03:44:20,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:20,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:20,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:44:20,038 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:20,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:20,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1344770217, now seen corresponding path program 1 times [2025-01-09 03:44:20,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:20,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563743672] [2025-01-09 03:44:20,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:20,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:20,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 03:44:20,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 03:44:20,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:20,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:20,134 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:44:20,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:20,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563743672] [2025-01-09 03:44:20,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563743672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:20,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:20,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:20,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829406739] [2025-01-09 03:44:20,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:20,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:20,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:20,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:20,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:20,136 INFO L87 Difference]: Start difference. First operand 511 states and 850 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (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:44:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:20,279 INFO L93 Difference]: Finished difference Result 979 states and 1638 transitions. [2025-01-09 03:44:20,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:20,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (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 82 [2025-01-09 03:44:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:20,284 INFO L225 Difference]: With dead ends: 979 [2025-01-09 03:44:20,284 INFO L226 Difference]: Without dead ends: 520 [2025-01-09 03:44:20,286 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:44:20,289 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 54 mSDsluCounter, 3215 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4026 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:44:20,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4026 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:20,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-01-09 03:44:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 511. [2025-01-09 03:44:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 405 states have (on average 1.6765432098765432) internal successors, (679), 424 states have internal predecessors, (679), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:20,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 846 transitions. [2025-01-09 03:44:20,310 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 846 transitions. Word has length 82 [2025-01-09 03:44:20,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:20,311 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 846 transitions. [2025-01-09 03:44:20,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (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:44:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 846 transitions. [2025-01-09 03:44:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 03:44:20,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:20,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:20,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:44:20,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:20,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:20,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1729094461, now seen corresponding path program 1 times [2025-01-09 03:44:20,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:20,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64536912] [2025-01-09 03:44:20,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:20,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:20,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 03:44:20,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 03:44:20,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:20,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:20,460 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:44:20,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:20,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64536912] [2025-01-09 03:44:20,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64536912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:20,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:20,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:20,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567446223] [2025-01-09 03:44:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:20,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:20,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:20,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:20,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:20,462 INFO L87 Difference]: Start difference. First operand 511 states and 846 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (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:44:20,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:20,593 INFO L93 Difference]: Finished difference Result 979 states and 1634 transitions. [2025-01-09 03:44:20,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:20,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (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 83 [2025-01-09 03:44:20,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:20,597 INFO L225 Difference]: With dead ends: 979 [2025-01-09 03:44:20,597 INFO L226 Difference]: Without dead ends: 520 [2025-01-09 03:44:20,598 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:44:20,598 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 53 mSDsluCounter, 3198 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4008 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:44:20,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4008 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-01-09 03:44:20,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 511. [2025-01-09 03:44:20,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 405 states have (on average 1.6666666666666667) internal successors, (675), 424 states have internal predecessors, (675), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:20,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 842 transitions. [2025-01-09 03:44:20,613 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 842 transitions. Word has length 83 [2025-01-09 03:44:20,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:20,614 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 842 transitions. [2025-01-09 03:44:20,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (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:44:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 842 transitions. [2025-01-09 03:44:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 03:44:20,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:20,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:20,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:44:20,616 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:20,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:20,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2000809917, now seen corresponding path program 1 times [2025-01-09 03:44:20,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:20,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313946218] [2025-01-09 03:44:20,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:20,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:20,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 03:44:20,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 03:44:20,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:20,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:20,722 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:44:20,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:20,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313946218] [2025-01-09 03:44:20,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313946218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:20,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:20,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:20,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654177969] [2025-01-09 03:44:20,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:20,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:20,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:20,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:20,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:20,724 INFO L87 Difference]: Start difference. First operand 511 states and 842 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (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:44:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:20,781 INFO L93 Difference]: Finished difference Result 970 states and 1616 transitions. [2025-01-09 03:44:20,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:44:20,782 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (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 83 [2025-01-09 03:44:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:20,786 INFO L225 Difference]: With dead ends: 970 [2025-01-09 03:44:20,786 INFO L226 Difference]: Without dead ends: 490 [2025-01-09 03:44:20,788 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:44:20,789 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 84 mSDsluCounter, 4082 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 4913 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:44:20,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 4913 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-01-09 03:44:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-01-09 03:44:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 384 states have (on average 1.6692708333333333) internal successors, (641), 403 states have internal predecessors, (641), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 808 transitions. [2025-01-09 03:44:20,804 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 808 transitions. Word has length 83 [2025-01-09 03:44:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:20,804 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 808 transitions. [2025-01-09 03:44:20,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (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:44:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 808 transitions. [2025-01-09 03:44:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 03:44:20,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:20,806 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:20,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:44:20,807 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:20,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:20,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1867035204, now seen corresponding path program 1 times [2025-01-09 03:44:20,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:20,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226457085] [2025-01-09 03:44:20,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:20,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:20,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 03:44:20,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 03:44:20,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:20,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:20,922 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:44:20,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:20,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226457085] [2025-01-09 03:44:20,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226457085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:20,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:20,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:20,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375999020] [2025-01-09 03:44:20,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:20,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:20,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:20,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:20,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:20,925 INFO L87 Difference]: Start difference. First operand 490 states and 808 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (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:44:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:20,991 INFO L93 Difference]: Finished difference Result 949 states and 1582 transitions. [2025-01-09 03:44:20,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:20,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (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 84 [2025-01-09 03:44:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:20,995 INFO L225 Difference]: With dead ends: 949 [2025-01-09 03:44:20,995 INFO L226 Difference]: Without dead ends: 490 [2025-01-09 03:44:20,997 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:44:20,999 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 17 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3946 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:44:20,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3946 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-01-09 03:44:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-01-09 03:44:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 384 states have (on average 1.6666666666666667) internal successors, (640), 403 states have internal predecessors, (640), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 807 transitions. [2025-01-09 03:44:21,016 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 807 transitions. Word has length 84 [2025-01-09 03:44:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:21,016 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 807 transitions. [2025-01-09 03:44:21,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (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:44:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 807 transitions. [2025-01-09 03:44:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 03:44:21,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:21,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:21,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:44:21,019 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:21,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:21,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1779591998, now seen corresponding path program 1 times [2025-01-09 03:44:21,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:21,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150820165] [2025-01-09 03:44:21,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:21,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:21,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 03:44:21,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 03:44:21,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:21,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:21,128 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:44:21,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:21,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150820165] [2025-01-09 03:44:21,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150820165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:21,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:21,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:21,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316318705] [2025-01-09 03:44:21,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:21,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:21,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:21,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:21,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:21,131 INFO L87 Difference]: Start difference. First operand 490 states and 807 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (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:44:21,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:21,201 INFO L93 Difference]: Finished difference Result 949 states and 1581 transitions. [2025-01-09 03:44:21,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:21,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (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 85 [2025-01-09 03:44:21,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:21,205 INFO L225 Difference]: With dead ends: 949 [2025-01-09 03:44:21,205 INFO L226 Difference]: Without dead ends: 490 [2025-01-09 03:44:21,207 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:44:21,208 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 16 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3946 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:44:21,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3946 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:21,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-01-09 03:44:21,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-01-09 03:44:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 384 states have (on average 1.6640625) internal successors, (639), 403 states have internal predecessors, (639), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 806 transitions. [2025-01-09 03:44:21,225 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 806 transitions. Word has length 85 [2025-01-09 03:44:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:21,225 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 806 transitions. [2025-01-09 03:44:21,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (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:44:21,226 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 806 transitions. [2025-01-09 03:44:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 03:44:21,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:21,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:21,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:44:21,228 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:21,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:21,229 INFO L85 PathProgramCache]: Analyzing trace with hash -829460513, now seen corresponding path program 1 times [2025-01-09 03:44:21,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:21,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015823035] [2025-01-09 03:44:21,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:21,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:21,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 03:44:21,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 03:44:21,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:21,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:21,300 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:44:21,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:21,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015823035] [2025-01-09 03:44:21,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015823035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:21,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:21,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:21,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528070258] [2025-01-09 03:44:21,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:21,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:21,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:21,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:21,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:21,302 INFO L87 Difference]: Start difference. First operand 490 states and 806 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:21,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:21,333 INFO L93 Difference]: Finished difference Result 943 states and 1569 transitions. [2025-01-09 03:44:21,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:21,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2025-01-09 03:44:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:21,337 INFO L225 Difference]: With dead ends: 943 [2025-01-09 03:44:21,337 INFO L226 Difference]: Without dead ends: 490 [2025-01-09 03:44:21,339 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:44:21,340 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 5 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:21,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2372 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:21,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-01-09 03:44:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-01-09 03:44:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 384 states have (on average 1.6614583333333333) internal successors, (638), 403 states have internal predecessors, (638), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 03:44:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 805 transitions. [2025-01-09 03:44:21,353 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 805 transitions. Word has length 86 [2025-01-09 03:44:21,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:21,353 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 805 transitions. [2025-01-09 03:44:21,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:44:21,354 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 805 transitions. [2025-01-09 03:44:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 03:44:21,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:21,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:21,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:44:21,356 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:21,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:21,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1960752407, now seen corresponding path program 1 times [2025-01-09 03:44:21,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:21,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143460863] [2025-01-09 03:44:21,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:21,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:21,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 03:44:21,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 03:44:21,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:21,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:21,526 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:44:21,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:21,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143460863] [2025-01-09 03:44:21,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143460863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:21,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:21,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:44:21,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957537159] [2025-01-09 03:44:21,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:21,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:44:21,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:21,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:44:21,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:44:21,528 INFO L87 Difference]: Start difference. First operand 490 states and 805 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:44:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:22,986 INFO L93 Difference]: Finished difference Result 939 states and 1581 transitions. [2025-01-09 03:44:22,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:44:22,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2025-01-09 03:44:22,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:22,991 INFO L225 Difference]: With dead ends: 939 [2025-01-09 03:44:22,991 INFO L226 Difference]: Without dead ends: 494 [2025-01-09 03:44:22,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:44:22,994 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 1242 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 2454 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 2454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:22,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 1589 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 2454 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 03:44:22,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-01-09 03:44:23,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2025-01-09 03:44:23,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 387 states have (on average 1.6563307493540051) internal successors, (641), 406 states have internal predecessors, (641), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (97), 80 states have call predecessors, (97), 81 states have call successors, (97) [2025-01-09 03:44:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 824 transitions. [2025-01-09 03:44:23,014 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 824 transitions. Word has length 87 [2025-01-09 03:44:23,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:23,014 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 824 transitions. [2025-01-09 03:44:23,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:44:23,015 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 824 transitions. [2025-01-09 03:44:23,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 03:44:23,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:23,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:23,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:44:23,017 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:23,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:23,017 INFO L85 PathProgramCache]: Analyzing trace with hash 114042760, now seen corresponding path program 1 times [2025-01-09 03:44:23,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:23,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113384564] [2025-01-09 03:44:23,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:23,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:23,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 03:44:23,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 03:44:23,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:23,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:23,124 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:44:23,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:23,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113384564] [2025-01-09 03:44:23,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113384564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:23,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:23,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:23,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435355546] [2025-01-09 03:44:23,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:23,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:23,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:23,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:23,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:23,126 INFO L87 Difference]: Start difference. First operand 494 states and 824 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:44:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:25,754 INFO L93 Difference]: Finished difference Result 1763 states and 3038 transitions. [2025-01-09 03:44:25,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 03:44:25,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 88 [2025-01-09 03:44:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:25,763 INFO L225 Difference]: With dead ends: 1763 [2025-01-09 03:44:25,763 INFO L226 Difference]: Without dead ends: 1314 [2025-01-09 03:44:25,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-01-09 03:44:25,766 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 2235 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 4458 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2302 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 5022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 4458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:25,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2302 Valid, 2580 Invalid, 5022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 4458 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 03:44:25,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-01-09 03:44:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1257. [2025-01-09 03:44:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 982 states have (on average 1.6710794297352343) internal successors, (1641), 1030 states have internal predecessors, (1641), 223 states have call successors, (223), 51 states have call predecessors, (223), 51 states have return successors, (238), 212 states have call predecessors, (238), 218 states have call successors, (238) [2025-01-09 03:44:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 2102 transitions. [2025-01-09 03:44:25,855 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 2102 transitions. Word has length 88 [2025-01-09 03:44:25,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:25,855 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 2102 transitions. [2025-01-09 03:44:25,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:44:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 2102 transitions. [2025-01-09 03:44:25,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 03:44:25,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:25,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:25,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:44:25,857 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:25,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:25,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1426603161, now seen corresponding path program 1 times [2025-01-09 03:44:25,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:25,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710620633] [2025-01-09 03:44:25,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:25,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:25,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 03:44:25,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 03:44:25,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:25,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:25,973 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:44:25,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:25,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710620633] [2025-01-09 03:44:25,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710620633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:25,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:25,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:25,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901366571] [2025-01-09 03:44:25,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:25,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:25,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:25,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:25,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:25,975 INFO L87 Difference]: Start difference. First operand 1257 states and 2102 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:44:28,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:28,934 INFO L93 Difference]: Finished difference Result 5960 states and 10289 transitions. [2025-01-09 03:44:28,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:44:28,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2025-01-09 03:44:28,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:28,969 INFO L225 Difference]: With dead ends: 5960 [2025-01-09 03:44:28,969 INFO L226 Difference]: Without dead ends: 4748 [2025-01-09 03:44:28,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:44:28,980 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 3000 mSDsluCounter, 2031 mSDsCounter, 0 mSdLazyCounter, 5070 mSolverCounterSat, 791 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3129 SdHoareTripleChecker+Valid, 2831 SdHoareTripleChecker+Invalid, 5861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 791 IncrementalHoareTripleChecker+Valid, 5070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:28,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3129 Valid, 2831 Invalid, 5861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [791 Valid, 5070 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 03:44:28,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2025-01-09 03:44:29,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 4333. [2025-01-09 03:44:29,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4333 states, 3192 states have (on average 1.6657268170426065) internal successors, (5317), 3415 states have internal predecessors, (5317), 986 states have call successors, (986), 137 states have call predecessors, (986), 154 states have return successors, (1186), 965 states have call predecessors, (1186), 981 states have call successors, (1186) [2025-01-09 03:44:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4333 states to 4333 states and 7489 transitions. [2025-01-09 03:44:29,251 INFO L78 Accepts]: Start accepts. Automaton has 4333 states and 7489 transitions. Word has length 90 [2025-01-09 03:44:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:29,251 INFO L471 AbstractCegarLoop]: Abstraction has 4333 states and 7489 transitions. [2025-01-09 03:44:29,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:44:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 4333 states and 7489 transitions. [2025-01-09 03:44:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 03:44:29,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:29,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:29,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:44:29,254 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:29,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:29,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1839004837, now seen corresponding path program 1 times [2025-01-09 03:44:29,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:29,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35486708] [2025-01-09 03:44:29,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:29,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:29,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 03:44:29,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 03:44:29,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:29,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:29,387 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:44:29,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:29,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35486708] [2025-01-09 03:44:29,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35486708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:29,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:29,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:29,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268341753] [2025-01-09 03:44:29,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:29,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:29,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:29,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:29,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:29,390 INFO L87 Difference]: Start difference. First operand 4333 states and 7489 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:44:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:31,721 INFO L93 Difference]: Finished difference Result 11572 states and 20108 transitions. [2025-01-09 03:44:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 03:44:31,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2025-01-09 03:44:31,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:31,776 INFO L225 Difference]: With dead ends: 11572 [2025-01-09 03:44:31,776 INFO L226 Difference]: Without dead ends: 8502 [2025-01-09 03:44:31,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-01-09 03:44:31,794 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 2287 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 3433 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2364 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 3908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 3433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:31,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2364 Valid, 1700 Invalid, 3908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 3433 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 03:44:31,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8502 states. [2025-01-09 03:44:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8502 to 8053. [2025-01-09 03:44:32,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8053 states, 5991 states have (on average 1.6644967451176764) internal successors, (9972), 6392 states have internal predecessors, (9972), 1746 states have call successors, (1746), 254 states have call predecessors, (1746), 315 states have return successors, (2224), 1708 states have call predecessors, (2224), 1741 states have call successors, (2224) [2025-01-09 03:44:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8053 states to 8053 states and 13942 transitions. [2025-01-09 03:44:32,227 INFO L78 Accepts]: Start accepts. Automaton has 8053 states and 13942 transitions. Word has length 90 [2025-01-09 03:44:32,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:32,229 INFO L471 AbstractCegarLoop]: Abstraction has 8053 states and 13942 transitions. [2025-01-09 03:44:32,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:44:32,229 INFO L276 IsEmpty]: Start isEmpty. Operand 8053 states and 13942 transitions. [2025-01-09 03:44:32,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 03:44:32,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:32,231 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] [2025-01-09 03:44:32,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:44:32,231 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:32,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:32,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2087409094, now seen corresponding path program 1 times [2025-01-09 03:44:32,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:32,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920080573] [2025-01-09 03:44:32,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:32,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:32,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 03:44:32,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 03:44:32,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:32,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:32,315 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:44:32,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:32,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920080573] [2025-01-09 03:44:32,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920080573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:32,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:32,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:44:32,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33365587] [2025-01-09 03:44:32,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:32,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:44:32,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:32,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:44:32,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:44:32,317 INFO L87 Difference]: Start difference. First operand 8053 states and 13942 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:44:32,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:32,632 INFO L93 Difference]: Finished difference Result 14765 states and 25620 transitions. [2025-01-09 03:44:32,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:44:32,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2025-01-09 03:44:32,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:32,696 INFO L225 Difference]: With dead ends: 14765 [2025-01-09 03:44:32,696 INFO L226 Difference]: Without dead ends: 8140 [2025-01-09 03:44:32,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:44:32,723 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 0 mSDsluCounter, 2379 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3182 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:32,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3182 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8140 states. [2025-01-09 03:44:33,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8140 to 8126. [2025-01-09 03:44:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8126 states, 6047 states have (on average 1.657846866214652) internal successors, (10025), 6447 states have internal predecessors, (10025), 1743 states have call successors, (1743), 254 states have call predecessors, (1743), 335 states have return successors, (2287), 1726 states have call predecessors, (2287), 1738 states have call successors, (2287) [2025-01-09 03:44:33,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8126 states to 8126 states and 14055 transitions. [2025-01-09 03:44:33,078 INFO L78 Accepts]: Start accepts. Automaton has 8126 states and 14055 transitions. Word has length 95 [2025-01-09 03:44:33,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:33,078 INFO L471 AbstractCegarLoop]: Abstraction has 8126 states and 14055 transitions. [2025-01-09 03:44:33,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:44:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 8126 states and 14055 transitions. [2025-01-09 03:44:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:44:33,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:33,081 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] [2025-01-09 03:44:33,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:44:33,082 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:33,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:33,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1463495137, now seen corresponding path program 1 times [2025-01-09 03:44:33,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:33,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45069076] [2025-01-09 03:44:33,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:33,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:33,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:44:33,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:44:33,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:33,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:33,256 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:44:33,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:33,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45069076] [2025-01-09 03:44:33,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45069076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:33,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:33,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:44:33,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114639778] [2025-01-09 03:44:33,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:33,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:44:33,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:33,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:44:33,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:44:33,257 INFO L87 Difference]: Start difference. First operand 8126 states and 14055 transitions. Second operand has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:44:33,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:33,770 INFO L93 Difference]: Finished difference Result 15991 states and 28093 transitions. [2025-01-09 03:44:33,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:44:33,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 102 [2025-01-09 03:44:33,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:33,810 INFO L225 Difference]: With dead ends: 15991 [2025-01-09 03:44:33,810 INFO L226 Difference]: Without dead ends: 8274 [2025-01-09 03:44:33,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:44:33,836 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 243 mSDsluCounter, 5609 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 6451 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:33,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 6451 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:33,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8274 states. [2025-01-09 03:44:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8274 to 8150. [2025-01-09 03:44:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8150 states, 6068 states have (on average 1.6357943309162821) internal successors, (9926), 6471 states have internal predecessors, (9926), 1743 states have call successors, (1743), 254 states have call predecessors, (1743), 338 states have return successors, (2299), 1726 states have call predecessors, (2299), 1738 states have call successors, (2299) [2025-01-09 03:44:34,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8150 states to 8150 states and 13968 transitions. [2025-01-09 03:44:34,314 INFO L78 Accepts]: Start accepts. Automaton has 8150 states and 13968 transitions. Word has length 102 [2025-01-09 03:44:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:34,315 INFO L471 AbstractCegarLoop]: Abstraction has 8150 states and 13968 transitions. [2025-01-09 03:44:34,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:44:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 8150 states and 13968 transitions. [2025-01-09 03:44:34,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:44:34,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:34,318 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] [2025-01-09 03:44:34,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:44:34,318 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:34,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:34,319 INFO L85 PathProgramCache]: Analyzing trace with hash -709309845, now seen corresponding path program 1 times [2025-01-09 03:44:34,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:34,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536428694] [2025-01-09 03:44:34,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:34,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:34,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:44:34,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:44:34,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:34,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:44:34,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:34,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536428694] [2025-01-09 03:44:34,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536428694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:34,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:34,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:34,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753907189] [2025-01-09 03:44:34,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:34,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:34,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:34,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:34,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:34,482 INFO L87 Difference]: Start difference. First operand 8150 states and 13968 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:44:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:36,508 INFO L93 Difference]: Finished difference Result 15626 states and 26807 transitions. [2025-01-09 03:44:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:44:36,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 107 [2025-01-09 03:44:36,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:36,553 INFO L225 Difference]: With dead ends: 15626 [2025-01-09 03:44:36,553 INFO L226 Difference]: Without dead ends: 8920 [2025-01-09 03:44:36,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-01-09 03:44:36,577 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 2009 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2083 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 3384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:36,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2083 Valid, 1638 Invalid, 3384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 2936 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 03:44:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8920 states. [2025-01-09 03:44:36,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8920 to 8385. [2025-01-09 03:44:36,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8385 states, 6243 states have (on average 1.6250200224251161) internal successors, (10145), 6664 states have internal predecessors, (10145), 1763 states have call successors, (1763), 279 states have call predecessors, (1763), 378 states have return successors, (2391), 1744 states have call predecessors, (2391), 1758 states have call successors, (2391) [2025-01-09 03:44:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8385 states to 8385 states and 14299 transitions. [2025-01-09 03:44:36,916 INFO L78 Accepts]: Start accepts. Automaton has 8385 states and 14299 transitions. Word has length 107 [2025-01-09 03:44:36,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:36,917 INFO L471 AbstractCegarLoop]: Abstraction has 8385 states and 14299 transitions. [2025-01-09 03:44:36,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:44:36,917 INFO L276 IsEmpty]: Start isEmpty. Operand 8385 states and 14299 transitions. [2025-01-09 03:44:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:44:36,920 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:36,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:36,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:44:36,920 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:36,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:36,921 INFO L85 PathProgramCache]: Analyzing trace with hash -730630426, now seen corresponding path program 1 times [2025-01-09 03:44:36,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:36,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111149178] [2025-01-09 03:44:36,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:36,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:36,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:44:36,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:44:36,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:36,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:44:37,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:37,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111149178] [2025-01-09 03:44:37,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111149178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:37,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:37,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:44:37,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17226057] [2025-01-09 03:44:37,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:37,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:44:37,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:37,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:44:37,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:44:37,097 INFO L87 Difference]: Start difference. First operand 8385 states and 14299 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:44:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:37,529 INFO L93 Difference]: Finished difference Result 18785 states and 32179 transitions. [2025-01-09 03:44:37,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:44:37,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-01-09 03:44:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:37,606 INFO L225 Difference]: With dead ends: 18785 [2025-01-09 03:44:37,606 INFO L226 Difference]: Without dead ends: 11844 [2025-01-09 03:44:37,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:44:37,642 INFO L435 NwaCegarLoop]: 1288 mSDtfsCounter, 755 mSDsluCounter, 7161 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 8449 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:37,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 8449 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:37,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11844 states. [2025-01-09 03:44:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11844 to 11170. [2025-01-09 03:44:38,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11170 states, 8325 states have (on average 1.635075075075075) internal successors, (13612), 8873 states have internal predecessors, (13612), 2366 states have call successors, (2366), 360 states have call predecessors, (2366), 478 states have return successors, (3151), 2356 states have call predecessors, (3151), 2361 states have call successors, (3151) [2025-01-09 03:44:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11170 states to 11170 states and 19129 transitions. [2025-01-09 03:44:38,130 INFO L78 Accepts]: Start accepts. Automaton has 11170 states and 19129 transitions. Word has length 112 [2025-01-09 03:44:38,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:38,130 INFO L471 AbstractCegarLoop]: Abstraction has 11170 states and 19129 transitions. [2025-01-09 03:44:38,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:44:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 11170 states and 19129 transitions. [2025-01-09 03:44:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:44:38,133 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:38,133 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:38,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:44:38,133 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:38,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:38,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1407580793, now seen corresponding path program 1 times [2025-01-09 03:44:38,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:38,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676049426] [2025-01-09 03:44:38,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:38,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:38,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:44:38,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:44:38,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:38,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:44:38,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:38,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676049426] [2025-01-09 03:44:38,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676049426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:38,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:38,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 03:44:38,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282511266] [2025-01-09 03:44:38,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:38,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 03:44:38,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:38,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 03:44:38,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:44:38,323 INFO L87 Difference]: Start difference. First operand 11170 states and 19129 transitions. Second operand has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 03:44:42,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:42,757 INFO L93 Difference]: Finished difference Result 24064 states and 40871 transitions. [2025-01-09 03:44:42,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 03:44:42,757 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 114 [2025-01-09 03:44:42,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:42,854 INFO L225 Difference]: With dead ends: 24064 [2025-01-09 03:44:42,854 INFO L226 Difference]: Without dead ends: 14157 [2025-01-09 03:44:42,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2025-01-09 03:44:42,907 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 2018 mSDsluCounter, 4585 mSDsCounter, 0 mSdLazyCounter, 8901 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2101 SdHoareTripleChecker+Valid, 5096 SdHoareTripleChecker+Invalid, 9316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 8901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:42,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2101 Valid, 5096 Invalid, 9316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 8901 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 03:44:42,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14157 states. [2025-01-09 03:44:43,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14157 to 12932. [2025-01-09 03:44:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12932 states, 9717 states have (on average 1.615827930431203) internal successors, (15701), 10330 states have internal predecessors, (15701), 2599 states have call successors, (2599), 449 states have call predecessors, (2599), 615 states have return successors, (3492), 2565 states have call predecessors, (3492), 2594 states have call successors, (3492) [2025-01-09 03:44:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12932 states to 12932 states and 21792 transitions. [2025-01-09 03:44:43,638 INFO L78 Accepts]: Start accepts. Automaton has 12932 states and 21792 transitions. Word has length 114 [2025-01-09 03:44:43,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:43,639 INFO L471 AbstractCegarLoop]: Abstraction has 12932 states and 21792 transitions. [2025-01-09 03:44:43,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 03:44:43,639 INFO L276 IsEmpty]: Start isEmpty. Operand 12932 states and 21792 transitions. [2025-01-09 03:44:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:44:43,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:43,642 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:43,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:44:43,642 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:43,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:43,643 INFO L85 PathProgramCache]: Analyzing trace with hash -511775708, now seen corresponding path program 1 times [2025-01-09 03:44:43,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:43,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010797358] [2025-01-09 03:44:43,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:43,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:43,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:44:43,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:44:43,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:43,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:44:43,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010797358] [2025-01-09 03:44:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010797358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:43,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:43,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:43,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645385495] [2025-01-09 03:44:43,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:43,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:43,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:43,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:43,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:43,751 INFO L87 Difference]: Start difference. First operand 12932 states and 21792 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:44:44,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:44,495 INFO L93 Difference]: Finished difference Result 13060 states and 22019 transitions. [2025-01-09 03:44:44,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:44:44,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-01-09 03:44:44,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:44,575 INFO L225 Difference]: With dead ends: 13060 [2025-01-09 03:44:44,575 INFO L226 Difference]: Without dead ends: 13045 [2025-01-09 03:44:44,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:44:44,589 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 865 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 2232 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:44,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 2232 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:44:44,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13045 states. [2025-01-09 03:44:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13045 to 12940. [2025-01-09 03:44:45,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12940 states, 9725 states have (on average 1.6153213367609254) internal successors, (15709), 10338 states have internal predecessors, (15709), 2599 states have call successors, (2599), 449 states have call predecessors, (2599), 615 states have return successors, (3492), 2565 states have call predecessors, (3492), 2594 states have call successors, (3492) [2025-01-09 03:44:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12940 states to 12940 states and 21800 transitions. [2025-01-09 03:44:45,106 INFO L78 Accepts]: Start accepts. Automaton has 12940 states and 21800 transitions. Word has length 112 [2025-01-09 03:44:45,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:45,107 INFO L471 AbstractCegarLoop]: Abstraction has 12940 states and 21800 transitions. [2025-01-09 03:44:45,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:44:45,107 INFO L276 IsEmpty]: Start isEmpty. Operand 12940 states and 21800 transitions. [2025-01-09 03:44:45,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:44:45,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:45,111 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:45,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 03:44:45,112 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:45,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:45,112 INFO L85 PathProgramCache]: Analyzing trace with hash 806392895, now seen corresponding path program 1 times [2025-01-09 03:44:45,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:45,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810460650] [2025-01-09 03:44:45,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:45,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:45,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:44:45,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:44:45,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:45,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:44:45,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:45,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810460650] [2025-01-09 03:44:45,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810460650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:45,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:45,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 03:44:45,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543137541] [2025-01-09 03:44:45,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:45,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:44:45,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:45,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:44:45,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:44:45,263 INFO L87 Difference]: Start difference. First operand 12940 states and 21800 transitions. Second operand has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:44:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:45,689 INFO L93 Difference]: Finished difference Result 12955 states and 21818 transitions. [2025-01-09 03:44:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:44:45,690 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-01-09 03:44:45,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:45,753 INFO L225 Difference]: With dead ends: 12955 [2025-01-09 03:44:45,753 INFO L226 Difference]: Without dead ends: 12940 [2025-01-09 03:44:45,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:44:45,764 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 19 mSDsluCounter, 6252 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 7038 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:44:45,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 7038 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:45,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12940 states. [2025-01-09 03:44:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12940 to 12940. [2025-01-09 03:44:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12940 states, 9725 states have (on average 1.6144987146529564) internal successors, (15701), 10338 states have internal predecessors, (15701), 2599 states have call successors, (2599), 449 states have call predecessors, (2599), 615 states have return successors, (3492), 2565 states have call predecessors, (3492), 2594 states have call successors, (3492) [2025-01-09 03:44:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12940 states to 12940 states and 21792 transitions. [2025-01-09 03:44:46,273 INFO L78 Accepts]: Start accepts. Automaton has 12940 states and 21792 transitions. Word has length 118 [2025-01-09 03:44:46,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:46,274 INFO L471 AbstractCegarLoop]: Abstraction has 12940 states and 21792 transitions. [2025-01-09 03:44:46,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:44:46,274 INFO L276 IsEmpty]: Start isEmpty. Operand 12940 states and 21792 transitions. [2025-01-09 03:44:46,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 03:44:46,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:46,277 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:46,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 03:44:46,277 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:46,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:46,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1980663787, now seen corresponding path program 1 times [2025-01-09 03:44:46,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:46,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092681417] [2025-01-09 03:44:46,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:46,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:46,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:44:46,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:44:46,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:46,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 03:44:46,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:46,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092681417] [2025-01-09 03:44:46,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092681417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:46,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:46,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:44:46,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824107177] [2025-01-09 03:44:46,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:46,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:44:46,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:46,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:44:46,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:44:46,463 INFO L87 Difference]: Start difference. First operand 12940 states and 21792 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:44:47,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:47,955 INFO L93 Difference]: Finished difference Result 25889 states and 43758 transitions. [2025-01-09 03:44:47,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:44:47,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 129 [2025-01-09 03:44:47,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:48,022 INFO L225 Difference]: With dead ends: 25889 [2025-01-09 03:44:48,022 INFO L226 Difference]: Without dead ends: 13006 [2025-01-09 03:44:48,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:44:48,064 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 1189 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 2461 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 2779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 2461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:48,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 1580 Invalid, 2779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 2461 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 03:44:48,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13006 states. [2025-01-09 03:44:48,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13006 to 12940. [2025-01-09 03:44:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12940 states, 9725 states have (on average 1.6136760925449871) internal successors, (15693), 10338 states have internal predecessors, (15693), 2599 states have call successors, (2599), 449 states have call predecessors, (2599), 615 states have return successors, (3492), 2565 states have call predecessors, (3492), 2594 states have call successors, (3492) [2025-01-09 03:44:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12940 states to 12940 states and 21784 transitions. [2025-01-09 03:44:48,514 INFO L78 Accepts]: Start accepts. Automaton has 12940 states and 21784 transitions. Word has length 129 [2025-01-09 03:44:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:48,515 INFO L471 AbstractCegarLoop]: Abstraction has 12940 states and 21784 transitions. [2025-01-09 03:44:48,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:44:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 12940 states and 21784 transitions. [2025-01-09 03:44:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 03:44:48,517 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:48,517 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:48,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 03:44:48,518 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:48,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:48,518 INFO L85 PathProgramCache]: Analyzing trace with hash 319218097, now seen corresponding path program 1 times [2025-01-09 03:44:48,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:48,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278947169] [2025-01-09 03:44:48,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:48,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:48,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 03:44:48,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 03:44:48,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:48,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:44:48,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:48,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278947169] [2025-01-09 03:44:48,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278947169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:48,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:48,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:48,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100089173] [2025-01-09 03:44:48,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:48,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:48,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:48,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:48,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:48,599 INFO L87 Difference]: Start difference. First operand 12940 states and 21784 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:44:51,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:51,064 INFO L93 Difference]: Finished difference Result 42743 states and 74203 transitions. [2025-01-09 03:44:51,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:44:51,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 140 [2025-01-09 03:44:51,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:51,349 INFO L225 Difference]: With dead ends: 42743 [2025-01-09 03:44:51,349 INFO L226 Difference]: Without dead ends: 29848 [2025-01-09 03:44:51,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:44:51,442 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 1775 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1843 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:51,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1843 Valid, 914 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 03:44:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29848 states. [2025-01-09 03:44:52,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29848 to 28927. [2025-01-09 03:44:52,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28927 states, 21166 states have (on average 1.6060190872153455) internal successors, (33993), 22648 states have internal predecessors, (33993), 6465 states have call successors, (6465), 893 states have call predecessors, (6465), 1295 states have return successors, (10056), 6426 states have call predecessors, (10056), 6460 states have call successors, (10056) [2025-01-09 03:44:52,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28927 states to 28927 states and 50514 transitions. [2025-01-09 03:44:52,777 INFO L78 Accepts]: Start accepts. Automaton has 28927 states and 50514 transitions. Word has length 140 [2025-01-09 03:44:52,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:52,778 INFO L471 AbstractCegarLoop]: Abstraction has 28927 states and 50514 transitions. [2025-01-09 03:44:52,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:44:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 28927 states and 50514 transitions. [2025-01-09 03:44:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 03:44:52,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:52,782 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:52,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 03:44:52,782 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:52,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:52,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1305706523, now seen corresponding path program 1 times [2025-01-09 03:44:52,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:52,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116351764] [2025-01-09 03:44:52,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:52,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:52,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 03:44:52,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 03:44:52,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:52,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:44:52,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:52,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116351764] [2025-01-09 03:44:52,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116351764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:52,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:52,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:52,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600896476] [2025-01-09 03:44:52,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:52,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:52,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:52,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:52,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:52,862 INFO L87 Difference]: Start difference. First operand 28927 states and 50514 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:44:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:57,699 INFO L93 Difference]: Finished difference Result 97424 states and 177616 transitions. [2025-01-09 03:44:57,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:44:57,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 141 [2025-01-09 03:44:57,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:58,337 INFO L225 Difference]: With dead ends: 97424 [2025-01-09 03:44:58,338 INFO L226 Difference]: Without dead ends: 68542 [2025-01-09 03:44:58,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:44:58,508 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1777 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1844 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:58,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1844 Valid, 884 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 03:44:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68542 states. [2025-01-09 03:45:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68542 to 66508. [2025-01-09 03:45:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66508 states, 47239 states have (on average 1.5965833315692541) internal successors, (75421), 50883 states have internal predecessors, (75421), 16528 states have call successors, (16528), 1781 states have call predecessors, (16528), 2740 states have return successors, (30224), 16527 states have call predecessors, (30224), 16523 states have call successors, (30224) [2025-01-09 03:45:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66508 states to 66508 states and 122173 transitions. [2025-01-09 03:45:02,314 INFO L78 Accepts]: Start accepts. Automaton has 66508 states and 122173 transitions. Word has length 141 [2025-01-09 03:45:02,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:02,314 INFO L471 AbstractCegarLoop]: Abstraction has 66508 states and 122173 transitions. [2025-01-09 03:45:02,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:45:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 66508 states and 122173 transitions. [2025-01-09 03:45:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 03:45:02,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:02,320 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:02,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 03:45:02,320 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:02,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:02,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1642195953, now seen corresponding path program 1 times [2025-01-09 03:45:02,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:02,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140565211] [2025-01-09 03:45:02,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:02,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:02,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 03:45:02,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 03:45:02,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:02,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:45:02,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:02,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140565211] [2025-01-09 03:45:02,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140565211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:02,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:02,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:02,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206817080] [2025-01-09 03:45:02,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:02,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:02,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:02,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:02,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:02,404 INFO L87 Difference]: Start difference. First operand 66508 states and 122173 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:45:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:14,714 INFO L93 Difference]: Finished difference Result 227993 states and 443631 transitions. [2025-01-09 03:45:14,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:45:14,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 140 [2025-01-09 03:45:14,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:16,557 INFO L225 Difference]: With dead ends: 227993 [2025-01-09 03:45:16,557 INFO L226 Difference]: Without dead ends: 161530 [2025-01-09 03:45:16,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:45:16,959 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1771 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1839 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:16,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1839 Valid, 881 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 03:45:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161530 states.