./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec11_productSimulator.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/email_spec11_productSimulator.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 1c5af94617941f44648ac9498189d5e73562b4cbf6ae0ea00b10262137b50bb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:50:35,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:50:35,810 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:50:35,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:50:35,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:50:35,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:50:35,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:50:35,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:50:35,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:50:35,846 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:50:35,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:50:35,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:50:35,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:50:35,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:50:35,847 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:50:35,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:50:35,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:50:35,847 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:50:35,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:50:35,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:50:35,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:50:35,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:50:35,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:50:35,848 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:50:35,848 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:50:35,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:50:35,848 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:50:35,848 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:50:35,848 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:50:35,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:50:35,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:50:35,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:50:35,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:50:35,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:50:35,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:50:35,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:50:35,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:50:35,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:50:35,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:50:35,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:50:35,851 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:50:35,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:50:35,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:50:35,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:50:35,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:50:35,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:50:35,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:50:35,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:50:35,852 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 -> 1c5af94617941f44648ac9498189d5e73562b4cbf6ae0ea00b10262137b50bb0 [2025-01-09 03:50:36,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:50:36,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:50:36,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:50:36,153 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:50:36,154 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:50:36,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_productSimulator.cil.c [2025-01-09 03:50:37,514 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49092ca41/dae9475cc64b4ba08fbb071cf66f4946/FLAGca8f52201 [2025-01-09 03:50:37,910 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:50:37,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_productSimulator.cil.c [2025-01-09 03:50:37,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49092ca41/dae9475cc64b4ba08fbb071cf66f4946/FLAGca8f52201 [2025-01-09 03:50:38,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49092ca41/dae9475cc64b4ba08fbb071cf66f4946 [2025-01-09 03:50:38,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:50:38,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:50:38,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:50:38,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:50:38,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:50:38,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:50:38" (1/1) ... [2025-01-09 03:50:38,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46904ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:38, skipping insertion in model container [2025-01-09 03:50:38,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:50:38" (1/1) ... [2025-01-09 03:50:38,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:50:38,708 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/email_spec11_productSimulator.cil.c[48047,48060] [2025-01-09 03:50:38,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:50:38,792 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:50:38,805 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-01-09 03:50:38,806 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [168] [2025-01-09 03:50:38,807 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [754] [2025-01-09 03:50:38,807 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1126] [2025-01-09 03:50:38,808 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1492] [2025-01-09 03:50:38,808 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1698] [2025-01-09 03:50:38,808 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2095] [2025-01-09 03:50:38,808 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2112] [2025-01-09 03:50:38,809 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2378] [2025-01-09 03:50:38,809 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [2387] [2025-01-09 03:50:38,809 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [3447] [2025-01-09 03:50:38,897 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/email_spec11_productSimulator.cil.c[48047,48060] [2025-01-09 03:50:38,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:50:38,965 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:50:38,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:38 WrapperNode [2025-01-09 03:50:38,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:50:38,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:50:38,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:50:38,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:50:38,974 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:50:38" (1/1) ... [2025-01-09 03:50:39,007 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:50:38" (1/1) ... [2025-01-09 03:50:39,078 INFO L138 Inliner]: procedures = 151, calls = 262, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1308 [2025-01-09 03:50:39,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:50:39,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:50:39,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:50:39,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:50:39,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:38" (1/1) ... [2025-01-09 03:50:39,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:38" (1/1) ... [2025-01-09 03:50:39,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:38" (1/1) ... [2025-01-09 03:50:39,139 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-09 03:50:39,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:38" (1/1) ... [2025-01-09 03:50:39,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:38" (1/1) ... [2025-01-09 03:50:39,158 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:38" (1/1) ... [2025-01-09 03:50:39,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:38" (1/1) ... [2025-01-09 03:50:39,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:38" (1/1) ... [2025-01-09 03:50:39,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:38" (1/1) ... [2025-01-09 03:50:39,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:38" (1/1) ... [2025-01-09 03:50:39,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:50:39,223 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:50:39,223 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:50:39,223 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:50:39,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:38" (1/1) ... [2025-01-09 03:50:39,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:50:39,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:39,268 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:50:39,272 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:50:39,294 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:50:39,294 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:50:39,294 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-01-09 03:50:39,294 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-01-09 03:50:39,294 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-01-09 03:50:39,294 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-01-09 03:50:39,294 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:50:39,294 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:50:39,294 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:50:39,294 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:50:39,294 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:50:39,294 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:50:39,294 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:50:39,294 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:50:39,294 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-01-09 03:50:39,295 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-01-09 03:50:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:50:39,295 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:50:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-01-09 03:50:39,295 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-01-09 03:50:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:50:39,295 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:50:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:50:39,295 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:50:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:50:39,295 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:50:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-01-09 03:50:39,295 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-01-09 03:50:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-01-09 03:50:39,295 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-01-09 03:50:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:50:39,295 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:50:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:50:39,295 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:50:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:50:39,300 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:50:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-01-09 03:50:39,300 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-01-09 03:50:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:50:39,300 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:50:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-01-09 03:50:39,300 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-01-09 03:50:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:50:39,300 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:50:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-01-09 03:50:39,301 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-01-09 03:50:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:50:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:50:39,301 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:50:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:50:39,301 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:50:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-01-09 03:50:39,301 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-01-09 03:50:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-01-09 03:50:39,301 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-01-09 03:50:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-01-09 03:50:39,301 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-01-09 03:50:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:50:39,301 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:50:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:50:39,301 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:50:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:50:39,301 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:50:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:50:39,301 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:50:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:50:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:50:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:50:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:50:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:50:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:50:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-01-09 03:50:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-01-09 03:50:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-01-09 03:50:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-01-09 03:50:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:50:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:50:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:50:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:50:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:50:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:50:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:50:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:50:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:50:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:50:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-01-09 03:50:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-01-09 03:50:39,303 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-01-09 03:50:39,303 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-01-09 03:50:39,303 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:50:39,303 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:50:39,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:50:39,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:50:39,559 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:50:39,563 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:50:40,897 INFO L? ?]: Removed 626 outVars from TransFormulas that were not future-live. [2025-01-09 03:50:40,898 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:50:40,925 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:50:40,926 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:50:40,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:50:40 BoogieIcfgContainer [2025-01-09 03:50:40,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:50:40,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:50:40,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:50:40,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:50:40,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:50:38" (1/3) ... [2025-01-09 03:50:40,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2879065e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:50:40, skipping insertion in model container [2025-01-09 03:50:40,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:38" (2/3) ... [2025-01-09 03:50:40,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2879065e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:50:40, skipping insertion in model container [2025-01-09 03:50:40,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:50:40" (3/3) ... [2025-01-09 03:50:40,941 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec11_productSimulator.cil.c [2025-01-09 03:50:40,951 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:50:40,953 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec11_productSimulator.cil.c that has 44 procedures, 599 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:50:41,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:50:41,032 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;@7c02684c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:50:41,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:50:41,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 599 states, 445 states have (on average 1.5146067415730338) internal successors, (674), 465 states have internal predecessors, (674), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-01-09 03:50:41,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 03:50:41,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:41,062 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:41,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:41,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:41,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1285852940, now seen corresponding path program 1 times [2025-01-09 03:50:41,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:41,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34663152] [2025-01-09 03:50:41,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:41,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:41,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 03:50:41,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 03:50:41,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:41,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 03:50:41,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:41,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34663152] [2025-01-09 03:50:41,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34663152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:41,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:41,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:50:41,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860209118] [2025-01-09 03:50:41,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:41,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:41,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:41,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:41,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:50:41,890 INFO L87 Difference]: Start difference. First operand has 599 states, 445 states have (on average 1.5146067415730338) internal successors, (674), 465 states have internal predecessors, (674), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:42,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:42,076 INFO L93 Difference]: Finished difference Result 1161 states and 1744 transitions. [2025-01-09 03:50:42,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:42,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 156 [2025-01-09 03:50:42,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:42,100 INFO L225 Difference]: With dead ends: 1161 [2025-01-09 03:50:42,101 INFO L226 Difference]: Without dead ends: 592 [2025-01-09 03:50:42,113 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:50:42,116 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 0 mSDsluCounter, 2645 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3531 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:42,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3531 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:42,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-01-09 03:50:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-01-09 03:50:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 439 states have (on average 1.4965831435079726) internal successors, (657), 458 states have internal predecessors, (657), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 03:50:42,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 874 transitions. [2025-01-09 03:50:42,202 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 874 transitions. Word has length 156 [2025-01-09 03:50:42,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:42,205 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 874 transitions. [2025-01-09 03:50:42,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 874 transitions. [2025-01-09 03:50:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 03:50:42,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:42,218 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:42,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:50:42,218 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:42,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:42,219 INFO L85 PathProgramCache]: Analyzing trace with hash -585105577, now seen corresponding path program 1 times [2025-01-09 03:50:42,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:42,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594403099] [2025-01-09 03:50:42,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:42,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:42,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 03:50:42,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 03:50:42,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:42,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 03:50:42,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:42,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594403099] [2025-01-09 03:50:42,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594403099] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:42,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27369370] [2025-01-09 03:50:42,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:42,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:42,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:42,639 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:50:42,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:50:42,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 03:50:43,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 03:50:43,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:43,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:43,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 1400 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:50:43,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 03:50:43,192 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:43,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27369370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:43,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:43,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 03:50:43,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546999402] [2025-01-09 03:50:43,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:43,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:43,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:43,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:43,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:50:43,198 INFO L87 Difference]: Start difference. First operand 592 states and 874 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:43,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:43,252 INFO L93 Difference]: Finished difference Result 919 states and 1331 transitions. [2025-01-09 03:50:43,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:43,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 161 [2025-01-09 03:50:43,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:43,260 INFO L225 Difference]: With dead ends: 919 [2025-01-09 03:50:43,260 INFO L226 Difference]: Without dead ends: 594 [2025-01-09 03:50:43,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:50:43,263 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 1 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:43,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1742 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:43,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-01-09 03:50:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 593. [2025-01-09 03:50:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 440 states have (on average 1.4954545454545454) internal successors, (658), 459 states have internal predecessors, (658), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 03:50:43,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 875 transitions. [2025-01-09 03:50:43,314 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 875 transitions. Word has length 161 [2025-01-09 03:50:43,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:43,315 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 875 transitions. [2025-01-09 03:50:43,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 875 transitions. [2025-01-09 03:50:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 03:50:43,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:43,320 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:43,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:50:43,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:43,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:43,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:43,525 INFO L85 PathProgramCache]: Analyzing trace with hash 830955549, now seen corresponding path program 1 times [2025-01-09 03:50:43,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:43,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15173917] [2025-01-09 03:50:43,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:43,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:43,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 03:50:43,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 03:50:43,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:43,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:43,854 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-01-09 03:50:43,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:43,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15173917] [2025-01-09 03:50:43,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15173917] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:43,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039474343] [2025-01-09 03:50:43,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:43,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:43,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:43,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:50:43,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:50:44,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 03:50:44,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 03:50:44,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:44,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:44,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 1419 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:50:44,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 03:50:44,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:44,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039474343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:44,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:44,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-01-09 03:50:44,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124362111] [2025-01-09 03:50:44,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:44,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:50:44,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:44,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:50:44,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:50:44,402 INFO L87 Difference]: Start difference. First operand 593 states and 875 transitions. Second operand has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 7 states have internal predecessors, (100), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-01-09 03:50:44,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:44,528 INFO L93 Difference]: Finished difference Result 1133 states and 1679 transitions. [2025-01-09 03:50:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:50:44,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 7 states have internal predecessors, (100), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 167 [2025-01-09 03:50:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:44,537 INFO L225 Difference]: With dead ends: 1133 [2025-01-09 03:50:44,537 INFO L226 Difference]: Without dead ends: 598 [2025-01-09 03:50:44,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:50:44,542 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 4 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5154 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:44,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5154 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:50:44,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-01-09 03:50:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 597. [2025-01-09 03:50:44,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 442 states have (on average 1.493212669683258) internal successors, (660), 462 states have internal predecessors, (660), 109 states have call successors, (109), 43 states have call predecessors, (109), 45 states have return successors, (112), 108 states have call predecessors, (112), 108 states have call successors, (112) [2025-01-09 03:50:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 881 transitions. [2025-01-09 03:50:44,577 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 881 transitions. Word has length 167 [2025-01-09 03:50:44,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:44,578 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 881 transitions. [2025-01-09 03:50:44,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 7 states have internal predecessors, (100), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-01-09 03:50:44,578 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 881 transitions. [2025-01-09 03:50:44,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 03:50:44,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:44,583 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:44,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:50:44,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:44,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:44,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:44,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1195878261, now seen corresponding path program 1 times [2025-01-09 03:50:44,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:44,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798831645] [2025-01-09 03:50:44,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:44,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:44,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 03:50:44,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 03:50:44,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:44,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-01-09 03:50:45,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:45,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798831645] [2025-01-09 03:50:45,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798831645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:45,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:45,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:50:45,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674292129] [2025-01-09 03:50:45,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:45,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:50:45,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:45,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:50:45,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:50:45,083 INFO L87 Difference]: Start difference. First operand 597 states and 881 transitions. Second operand has 7 states, 6 states have (on average 16.5) internal successors, (99), 7 states have internal predecessors, (99), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-01-09 03:50:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:45,192 INFO L93 Difference]: Finished difference Result 1119 states and 1659 transitions. [2025-01-09 03:50:45,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:50:45,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.5) internal successors, (99), 7 states have internal predecessors, (99), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 168 [2025-01-09 03:50:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:45,197 INFO L225 Difference]: With dead ends: 1119 [2025-01-09 03:50:45,197 INFO L226 Difference]: Without dead ends: 600 [2025-01-09 03:50:45,199 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:50:45,200 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 4 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5154 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:45,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5154 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:50:45,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-01-09 03:50:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 599. [2025-01-09 03:50:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 443 states have (on average 1.492099322799097) internal successors, (661), 463 states have internal predecessors, (661), 109 states have call successors, (109), 43 states have call predecessors, (109), 46 states have return successors, (113), 109 states have call predecessors, (113), 108 states have call successors, (113) [2025-01-09 03:50:45,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 883 transitions. [2025-01-09 03:50:45,229 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 883 transitions. Word has length 168 [2025-01-09 03:50:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:45,229 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 883 transitions. [2025-01-09 03:50:45,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.5) internal successors, (99), 7 states have internal predecessors, (99), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-01-09 03:50:45,230 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 883 transitions. [2025-01-09 03:50:45,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 03:50:45,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:45,233 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:45,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:50:45,233 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:45,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash -652577321, now seen corresponding path program 2 times [2025-01-09 03:50:45,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:45,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6478434] [2025-01-09 03:50:45,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:50:45,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:45,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 169 statements into 2 equivalence classes. [2025-01-09 03:50:45,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 80 of 169 statements. [2025-01-09 03:50:45,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:50:45,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-01-09 03:50:45,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:45,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6478434] [2025-01-09 03:50:45,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6478434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:45,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:45,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:50:45,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305421022] [2025-01-09 03:50:45,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:45,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:45,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:45,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:45,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:50:45,398 INFO L87 Difference]: Start difference. First operand 599 states and 883 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 03:50:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:45,486 INFO L93 Difference]: Finished difference Result 1434 states and 2115 transitions. [2025-01-09 03:50:45,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:45,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 169 [2025-01-09 03:50:45,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:45,496 INFO L225 Difference]: With dead ends: 1434 [2025-01-09 03:50:45,496 INFO L226 Difference]: Without dead ends: 1117 [2025-01-09 03:50:45,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:50:45,499 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 792 mSDsluCounter, 2512 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 3387 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:50:45,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 3387 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:45,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-01-09 03:50:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1115. [2025-01-09 03:50:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 832 states have (on average 1.5096153846153846) internal successors, (1256), 868 states have internal predecessors, (1256), 198 states have call successors, (198), 81 states have call predecessors, (198), 84 states have return successors, (201), 196 states have call predecessors, (201), 196 states have call successors, (201) [2025-01-09 03:50:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1655 transitions. [2025-01-09 03:50:45,587 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1655 transitions. Word has length 169 [2025-01-09 03:50:45,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:45,588 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1655 transitions. [2025-01-09 03:50:45,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 03:50:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1655 transitions. [2025-01-09 03:50:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 03:50:45,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:45,596 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:45,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:50:45,596 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:45,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:45,599 INFO L85 PathProgramCache]: Analyzing trace with hash -897563367, now seen corresponding path program 1 times [2025-01-09 03:50:45,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:45,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38932542] [2025-01-09 03:50:45,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:45,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:45,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 03:50:45,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 03:50:45,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:45,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-01-09 03:50:45,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:45,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38932542] [2025-01-09 03:50:45,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38932542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:45,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:45,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:50:45,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953076386] [2025-01-09 03:50:45,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:45,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:50:45,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:45,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:50:45,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:50:45,857 INFO L87 Difference]: Start difference. First operand 1115 states and 1655 transitions. Second operand has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-01-09 03:50:45,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:45,993 INFO L93 Difference]: Finished difference Result 2155 states and 3209 transitions. [2025-01-09 03:50:45,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:50:45,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 170 [2025-01-09 03:50:45,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:46,002 INFO L225 Difference]: With dead ends: 2155 [2025-01-09 03:50:46,002 INFO L226 Difference]: Without dead ends: 1120 [2025-01-09 03:50:46,007 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:50:46,009 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 2 mSDsluCounter, 4312 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:46,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:50:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2025-01-09 03:50:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1117. [2025-01-09 03:50:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 833 states have (on average 1.5090036014405763) internal successors, (1257), 870 states have internal predecessors, (1257), 198 states have call successors, (198), 81 states have call predecessors, (198), 85 states have return successors, (204), 196 states have call predecessors, (204), 196 states have call successors, (204) [2025-01-09 03:50:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1659 transitions. [2025-01-09 03:50:46,072 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1659 transitions. Word has length 170 [2025-01-09 03:50:46,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:46,072 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1659 transitions. [2025-01-09 03:50:46,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-01-09 03:50:46,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1659 transitions. [2025-01-09 03:50:46,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 03:50:46,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:46,078 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:46,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:50:46,079 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:46,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:46,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2047713519, now seen corresponding path program 1 times [2025-01-09 03:50:46,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:46,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170210595] [2025-01-09 03:50:46,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:46,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:46,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 03:50:46,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 03:50:46,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:46,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:50:46,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:46,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170210595] [2025-01-09 03:50:46,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170210595] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:46,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201221100] [2025-01-09 03:50:46,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:46,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:46,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:46,265 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:50:46,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:50:46,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 03:50:46,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 03:50:46,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:46,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:46,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:50:46,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:50:46,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:50:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:50:46,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201221100] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:50:46,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:50:46,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:50:46,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302724593] [2025-01-09 03:50:46,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:50:46,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:50:46,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:46,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:50:46,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:50:46,871 INFO L87 Difference]: Start difference. First operand 1117 states and 1659 transitions. Second operand has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 03:50:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:47,143 INFO L93 Difference]: Finished difference Result 2401 states and 3643 transitions. [2025-01-09 03:50:47,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:50:47,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 171 [2025-01-09 03:50:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:47,159 INFO L225 Difference]: With dead ends: 2401 [2025-01-09 03:50:47,160 INFO L226 Difference]: Without dead ends: 1751 [2025-01-09 03:50:47,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:50:47,164 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 683 mSDsluCounter, 2293 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 3188 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:47,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 3188 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:50:47,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2025-01-09 03:50:47,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1711. [2025-01-09 03:50:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1342 states have (on average 1.5730253353204173) internal successors, (2111), 1389 states have internal predecessors, (2111), 283 states have call successors, (283), 81 states have call predecessors, (283), 85 states have return successors, (289), 281 states have call predecessors, (289), 281 states have call successors, (289) [2025-01-09 03:50:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2683 transitions. [2025-01-09 03:50:47,264 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2683 transitions. Word has length 171 [2025-01-09 03:50:47,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:47,265 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2683 transitions. [2025-01-09 03:50:47,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 03:50:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2683 transitions. [2025-01-09 03:50:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 03:50:47,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:47,275 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:47,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:50:47,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:47,476 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:47,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:47,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1585392442, now seen corresponding path program 1 times [2025-01-09 03:50:47,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:47,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580875788] [2025-01-09 03:50:47,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:47,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:47,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 03:50:47,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 03:50:47,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:47,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:47,593 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:50:47,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:47,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580875788] [2025-01-09 03:50:47,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580875788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:47,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:47,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:47,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554017022] [2025-01-09 03:50:47,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:47,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:47,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:47,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:47,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:47,596 INFO L87 Difference]: Start difference. First operand 1711 states and 2683 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:47,682 INFO L93 Difference]: Finished difference Result 3772 states and 5980 transitions. [2025-01-09 03:50:47,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:47,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2025-01-09 03:50:47,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:47,698 INFO L225 Difference]: With dead ends: 3772 [2025-01-09 03:50:47,698 INFO L226 Difference]: Without dead ends: 2177 [2025-01-09 03:50:47,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:47,706 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 173 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:47,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1716 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2177 states. [2025-01-09 03:50:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2177 to 2161. [2025-01-09 03:50:47,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2161 states, 1722 states have (on average 1.5859465737514518) internal successors, (2731), 1779 states have internal predecessors, (2731), 353 states have call successors, (353), 81 states have call predecessors, (353), 85 states have return successors, (359), 351 states have call predecessors, (359), 351 states have call successors, (359) [2025-01-09 03:50:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 3443 transitions. [2025-01-09 03:50:47,809 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 3443 transitions. Word has length 177 [2025-01-09 03:50:47,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:47,809 INFO L471 AbstractCegarLoop]: Abstraction has 2161 states and 3443 transitions. [2025-01-09 03:50:47,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 3443 transitions. [2025-01-09 03:50:47,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 03:50:47,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:47,822 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:47,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:50:47,823 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:47,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:47,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1355093808, now seen corresponding path program 1 times [2025-01-09 03:50:47,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:47,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170924682] [2025-01-09 03:50:47,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:47,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:47,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 03:50:47,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 03:50:47,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:47,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:50:47,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:47,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170924682] [2025-01-09 03:50:47,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170924682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:47,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:47,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:47,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829375942] [2025-01-09 03:50:47,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:47,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:47,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:47,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:47,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:47,918 INFO L87 Difference]: Start difference. First operand 2161 states and 3443 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:48,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:48,013 INFO L93 Difference]: Finished difference Result 4945 states and 7986 transitions. [2025-01-09 03:50:48,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:48,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 178 [2025-01-09 03:50:48,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:48,073 INFO L225 Difference]: With dead ends: 4945 [2025-01-09 03:50:48,073 INFO L226 Difference]: Without dead ends: 3128 [2025-01-09 03:50:48,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:48,082 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 171 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:48,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1743 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2025-01-09 03:50:48,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 3112. [2025-01-09 03:50:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3112 states, 2518 states have (on average 1.6092136616362192) internal successors, (4052), 2595 states have internal predecessors, (4052), 508 states have call successors, (508), 81 states have call predecessors, (508), 85 states have return successors, (514), 506 states have call predecessors, (514), 506 states have call successors, (514) [2025-01-09 03:50:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 5074 transitions. [2025-01-09 03:50:48,233 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 5074 transitions. Word has length 178 [2025-01-09 03:50:48,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:48,234 INFO L471 AbstractCegarLoop]: Abstraction has 3112 states and 5074 transitions. [2025-01-09 03:50:48,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 5074 transitions. [2025-01-09 03:50:48,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 03:50:48,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:48,252 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:48,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:50:48,252 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:48,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:48,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1203977729, now seen corresponding path program 1 times [2025-01-09 03:50:48,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:48,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917094271] [2025-01-09 03:50:48,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:48,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:48,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 03:50:48,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 03:50:48,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:48,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:50:48,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:48,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917094271] [2025-01-09 03:50:48,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917094271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:48,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:48,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:48,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272337056] [2025-01-09 03:50:48,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:48,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:48,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:48,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:48,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:48,341 INFO L87 Difference]: Start difference. First operand 3112 states and 5074 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:48,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:48,506 INFO L93 Difference]: Finished difference Result 7368 states and 12143 transitions. [2025-01-09 03:50:48,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:48,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 179 [2025-01-09 03:50:48,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:48,537 INFO L225 Difference]: With dead ends: 7368 [2025-01-09 03:50:48,537 INFO L226 Difference]: Without dead ends: 4531 [2025-01-09 03:50:48,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:48,549 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 169 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:48,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1750 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:48,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2025-01-09 03:50:48,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4515. [2025-01-09 03:50:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4515 states, 3712 states have (on average 1.6225754310344827) internal successors, (6023), 3817 states have internal predecessors, (6023), 717 states have call successors, (717), 81 states have call predecessors, (717), 85 states have return successors, (723), 715 states have call predecessors, (723), 715 states have call successors, (723) [2025-01-09 03:50:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 7463 transitions. [2025-01-09 03:50:48,780 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 7463 transitions. Word has length 179 [2025-01-09 03:50:48,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:48,781 INFO L471 AbstractCegarLoop]: Abstraction has 4515 states and 7463 transitions. [2025-01-09 03:50:48,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 7463 transitions. [2025-01-09 03:50:48,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 03:50:48,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:48,808 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:48,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:50:48,808 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:48,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1857275927, now seen corresponding path program 1 times [2025-01-09 03:50:48,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:48,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521095397] [2025-01-09 03:50:48,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:48,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:48,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 03:50:48,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 03:50:48,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:48,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:50:48,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:48,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521095397] [2025-01-09 03:50:48,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521095397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:48,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:48,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:48,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549618690] [2025-01-09 03:50:48,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:48,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:48,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:48,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:48,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:48,910 INFO L87 Difference]: Start difference. First operand 4515 states and 7463 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:49,178 INFO L93 Difference]: Finished difference Result 10649 states and 17757 transitions. [2025-01-09 03:50:49,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:49,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 180 [2025-01-09 03:50:49,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:49,225 INFO L225 Difference]: With dead ends: 10649 [2025-01-09 03:50:49,225 INFO L226 Difference]: Without dead ends: 6697 [2025-01-09 03:50:49,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:49,248 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 167 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:49,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1745 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:49,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6697 states. [2025-01-09 03:50:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6697 to 6681. [2025-01-09 03:50:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6681 states, 5592 states have (on average 1.6335836909871244) internal successors, (9135), 5743 states have internal predecessors, (9135), 1003 states have call successors, (1003), 81 states have call predecessors, (1003), 85 states have return successors, (1009), 1001 states have call predecessors, (1009), 1001 states have call successors, (1009) [2025-01-09 03:50:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6681 states to 6681 states and 11147 transitions. [2025-01-09 03:50:49,624 INFO L78 Accepts]: Start accepts. Automaton has 6681 states and 11147 transitions. Word has length 180 [2025-01-09 03:50:49,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:49,626 INFO L471 AbstractCegarLoop]: Abstraction has 6681 states and 11147 transitions. [2025-01-09 03:50:49,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 6681 states and 11147 transitions. [2025-01-09 03:50:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 03:50:49,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:49,664 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:49,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:50:49,664 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:49,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:49,665 INFO L85 PathProgramCache]: Analyzing trace with hash -822737640, now seen corresponding path program 1 times [2025-01-09 03:50:49,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:49,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111769014] [2025-01-09 03:50:49,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:49,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:49,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 03:50:49,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 03:50:49,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:49,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:50:49,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:49,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111769014] [2025-01-09 03:50:49,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111769014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:49,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:49,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:49,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863287997] [2025-01-09 03:50:49,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:49,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:49,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:49,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:49,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:49,802 INFO L87 Difference]: Start difference. First operand 6681 states and 11147 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:50,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:50,073 INFO L93 Difference]: Finished difference Result 15966 states and 26859 transitions. [2025-01-09 03:50:50,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:50,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 181 [2025-01-09 03:50:50,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:50,147 INFO L225 Difference]: With dead ends: 15966 [2025-01-09 03:50:50,147 INFO L226 Difference]: Without dead ends: 10270 [2025-01-09 03:50:50,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:50,174 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 165 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:50,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1744 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:50,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10270 states. [2025-01-09 03:50:50,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10270 to 10254. [2025-01-09 03:50:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10254 states, 8724 states have (on average 1.642709766162311) internal successors, (14331), 8955 states have internal predecessors, (14331), 1444 states have call successors, (1444), 81 states have call predecessors, (1444), 85 states have return successors, (1450), 1442 states have call predecessors, (1450), 1442 states have call successors, (1450) [2025-01-09 03:50:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10254 states to 10254 states and 17225 transitions. [2025-01-09 03:50:50,600 INFO L78 Accepts]: Start accepts. Automaton has 10254 states and 17225 transitions. Word has length 181 [2025-01-09 03:50:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:50,601 INFO L471 AbstractCegarLoop]: Abstraction has 10254 states and 17225 transitions. [2025-01-09 03:50:50,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 10254 states and 17225 transitions. [2025-01-09 03:50:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 03:50:50,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:50,651 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:50,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:50:50,651 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:50,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:50,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1433780389, now seen corresponding path program 1 times [2025-01-09 03:50:50,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:50,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998594916] [2025-01-09 03:50:50,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:50,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:50,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 03:50:50,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 03:50:50,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:50,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:50:50,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:50,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998594916] [2025-01-09 03:50:50,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998594916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:50,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:50,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:50,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427349447] [2025-01-09 03:50:50,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:50,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:50,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:50,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:50,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:50,752 INFO L87 Difference]: Start difference. First operand 10254 states and 17225 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:51,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:51,129 INFO L93 Difference]: Finished difference Result 25092 states and 42491 transitions. [2025-01-09 03:50:51,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:51,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 182 [2025-01-09 03:50:51,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:51,203 INFO L225 Difference]: With dead ends: 25092 [2025-01-09 03:50:51,204 INFO L226 Difference]: Without dead ends: 16419 [2025-01-09 03:50:51,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:51,245 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 163 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:51,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1745 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16419 states. [2025-01-09 03:50:52,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16419 to 16403. [2025-01-09 03:50:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16403 states, 13962 states have (on average 1.645824380461252) internal successors, (22979), 14339 states have internal predecessors, (22979), 2355 states have call successors, (2355), 81 states have call predecessors, (2355), 85 states have return successors, (2361), 2353 states have call predecessors, (2361), 2353 states have call successors, (2361) [2025-01-09 03:50:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16403 states to 16403 states and 27695 transitions. [2025-01-09 03:50:52,133 INFO L78 Accepts]: Start accepts. Automaton has 16403 states and 27695 transitions. Word has length 182 [2025-01-09 03:50:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:52,134 INFO L471 AbstractCegarLoop]: Abstraction has 16403 states and 27695 transitions. [2025-01-09 03:50:52,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 16403 states and 27695 transitions. [2025-01-09 03:50:52,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 03:50:52,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:52,232 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:52,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:50:52,232 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:52,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:52,232 INFO L85 PathProgramCache]: Analyzing trace with hash -161531901, now seen corresponding path program 1 times [2025-01-09 03:50:52,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:52,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510725470] [2025-01-09 03:50:52,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:52,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:52,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 03:50:52,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 03:50:52,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:52,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:50:52,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:52,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510725470] [2025-01-09 03:50:52,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510725470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:52,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:52,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:52,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081653574] [2025-01-09 03:50:52,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:52,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:52,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:52,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:52,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:52,341 INFO L87 Difference]: Start difference. First operand 16403 states and 27695 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:52,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:52,953 INFO L93 Difference]: Finished difference Result 41893 states and 71258 transitions. [2025-01-09 03:50:52,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:52,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 183 [2025-01-09 03:50:52,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:53,100 INFO L225 Difference]: With dead ends: 41893 [2025-01-09 03:50:53,101 INFO L226 Difference]: Without dead ends: 27767 [2025-01-09 03:50:53,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:53,168 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 161 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:53,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1742 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27767 states. [2025-01-09 03:50:54,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27767 to 27751. [2025-01-09 03:50:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27751 states, 23752 states have (on average 1.64992421690805) internal successors, (39189), 24405 states have internal predecessors, (39189), 3913 states have call successors, (3913), 81 states have call predecessors, (3913), 85 states have return successors, (3919), 3911 states have call predecessors, (3919), 3911 states have call successors, (3919) [2025-01-09 03:50:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27751 states to 27751 states and 47021 transitions. [2025-01-09 03:50:54,462 INFO L78 Accepts]: Start accepts. Automaton has 27751 states and 47021 transitions. Word has length 183 [2025-01-09 03:50:54,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:54,462 INFO L471 AbstractCegarLoop]: Abstraction has 27751 states and 47021 transitions. [2025-01-09 03:50:54,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:54,463 INFO L276 IsEmpty]: Start isEmpty. Operand 27751 states and 47021 transitions. [2025-01-09 03:50:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 03:50:54,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:54,580 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:54,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:50:54,581 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:54,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1077921907, now seen corresponding path program 1 times [2025-01-09 03:50:54,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:54,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688317644] [2025-01-09 03:50:54,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:54,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:54,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 03:50:54,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 03:50:54,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:54,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:50:54,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:54,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688317644] [2025-01-09 03:50:54,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688317644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:54,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:54,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:54,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425243191] [2025-01-09 03:50:54,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:54,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:54,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:54,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:54,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:54,686 INFO L87 Difference]: Start difference. First operand 27751 states and 47021 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:55,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:55,968 INFO L93 Difference]: Finished difference Result 68450 states and 115890 transitions. [2025-01-09 03:50:55,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:55,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 184 [2025-01-09 03:50:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:56,195 INFO L225 Difference]: With dead ends: 68450 [2025-01-09 03:50:56,195 INFO L226 Difference]: Without dead ends: 44563 [2025-01-09 03:50:56,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:56,260 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 159 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:56,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1727 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:56,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44563 states. [2025-01-09 03:50:57,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44563 to 44547. [2025-01-09 03:50:57,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44547 states, 38229 states have (on average 1.6329226503439798) internal successors, (62425), 39416 states have internal predecessors, (62425), 6232 states have call successors, (6232), 81 states have call predecessors, (6232), 85 states have return successors, (6238), 6230 states have call predecessors, (6238), 6230 states have call successors, (6238) [2025-01-09 03:50:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44547 states to 44547 states and 74895 transitions. [2025-01-09 03:50:58,279 INFO L78 Accepts]: Start accepts. Automaton has 44547 states and 74895 transitions. Word has length 184 [2025-01-09 03:50:58,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:58,279 INFO L471 AbstractCegarLoop]: Abstraction has 44547 states and 74895 transitions. [2025-01-09 03:50:58,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:50:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 44547 states and 74895 transitions. [2025-01-09 03:50:58,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-09 03:50:58,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:58,444 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:58,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:50:58,445 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:58,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:58,445 INFO L85 PathProgramCache]: Analyzing trace with hash 897116314, now seen corresponding path program 1 times [2025-01-09 03:50:58,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:58,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16044905] [2025-01-09 03:50:58,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:58,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 03:50:58,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 03:50:58,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:58,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:50:58,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:58,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16044905] [2025-01-09 03:50:58,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16044905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:58,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:58,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:58,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615768125] [2025-01-09 03:50:58,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:58,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:58,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:58,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:58,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:58,535 INFO L87 Difference]: Start difference. First operand 44547 states and 74895 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:51:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:00,560 INFO L93 Difference]: Finished difference Result 120360 states and 202847 transitions. [2025-01-09 03:51:00,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:00,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 185 [2025-01-09 03:51:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:00,976 INFO L225 Difference]: With dead ends: 120360 [2025-01-09 03:51:00,977 INFO L226 Difference]: Without dead ends: 80724 [2025-01-09 03:51:01,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:01,080 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 157 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:01,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1746 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:51:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80724 states. [2025-01-09 03:51:04,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80724 to 80708. [2025-01-09 03:51:04,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80708 states, 69604 states have (on average 1.6283403252686628) internal successors, (113339), 71315 states have internal predecessors, (113339), 11018 states have call successors, (11018), 81 states have call predecessors, (11018), 85 states have return successors, (11024), 11016 states have call predecessors, (11024), 11016 states have call successors, (11024) [2025-01-09 03:51:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80708 states to 80708 states and 135381 transitions. [2025-01-09 03:51:04,460 INFO L78 Accepts]: Start accepts. Automaton has 80708 states and 135381 transitions. Word has length 185 [2025-01-09 03:51:04,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:04,462 INFO L471 AbstractCegarLoop]: Abstraction has 80708 states and 135381 transitions. [2025-01-09 03:51:04,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:51:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 80708 states and 135381 transitions. [2025-01-09 03:51:04,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 03:51:04,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:04,715 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:04,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:51:04,715 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:04,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:04,716 INFO L85 PathProgramCache]: Analyzing trace with hash -185126426, now seen corresponding path program 1 times [2025-01-09 03:51:04,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:04,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943967004] [2025-01-09 03:51:04,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:04,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:04,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 03:51:05,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 03:51:05,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:05,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:51:05,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:05,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943967004] [2025-01-09 03:51:05,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943967004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:05,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:05,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:05,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067578133] [2025-01-09 03:51:05,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:05,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:05,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:05,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:05,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:05,206 INFO L87 Difference]: Start difference. First operand 80708 states and 135381 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:51:08,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:08,178 INFO L93 Difference]: Finished difference Result 223057 states and 375392 transitions. [2025-01-09 03:51:08,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:08,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 186 [2025-01-09 03:51:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:08,815 INFO L225 Difference]: With dead ends: 223057 [2025-01-09 03:51:08,816 INFO L226 Difference]: Without dead ends: 148740 [2025-01-09 03:51:08,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:08,989 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 155 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:08,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1747 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:09,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148740 states. [2025-01-09 03:51:13,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148740 to 148724. [2025-01-09 03:51:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148724 states, 128723 states have (on average 1.627044117989792) internal successors, (209438), 131995 states have internal predecessors, (209438), 19915 states have call successors, (19915), 81 states have call predecessors, (19915), 85 states have return successors, (19921), 19913 states have call predecessors, (19921), 19913 states have call successors, (19921) [2025-01-09 03:51:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148724 states to 148724 states and 249274 transitions. [2025-01-09 03:51:14,391 INFO L78 Accepts]: Start accepts. Automaton has 148724 states and 249274 transitions. Word has length 186 [2025-01-09 03:51:14,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:14,392 INFO L471 AbstractCegarLoop]: Abstraction has 148724 states and 249274 transitions. [2025-01-09 03:51:14,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:51:14,393 INFO L276 IsEmpty]: Start isEmpty. Operand 148724 states and 249274 transitions. [2025-01-09 03:51:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 03:51:14,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:14,720 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:14,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:51:14,720 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:14,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:14,721 INFO L85 PathProgramCache]: Analyzing trace with hash 385940832, now seen corresponding path program 1 times [2025-01-09 03:51:14,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:14,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99869786] [2025-01-09 03:51:14,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:14,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:14,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 03:51:14,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 03:51:14,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:14,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:51:14,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:14,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99869786] [2025-01-09 03:51:14,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99869786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:14,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:14,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:14,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915756892] [2025-01-09 03:51:14,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:14,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:14,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:14,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:14,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:14,815 INFO L87 Difference]: Start difference. First operand 148724 states and 249274 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:51:19,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:19,299 INFO L93 Difference]: Finished difference Result 280949 states and 470730 transitions. [2025-01-09 03:51:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:19,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 187 [2025-01-09 03:51:19,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:20,359 INFO L225 Difference]: With dead ends: 280949 [2025-01-09 03:51:20,359 INFO L226 Difference]: Without dead ends: 280299 [2025-01-09 03:51:20,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:20,465 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 148 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:20,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1763 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:20,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280299 states.