./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product31.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product31.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca4739abfecd00b8d2b799ccc2617c6e4b4e221f88b8a7e722070835771a8404 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:46:45,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:46:46,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:46:46,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:46:46,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:46:46,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:46:46,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:46:46,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:46:46,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:46:46,123 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:46:46,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:46:46,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:46:46,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:46:46,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:46:46,130 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:46:46,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:46:46,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:46:46,131 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:46:46,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:46:46,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:46:46,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:46:46,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:46:46,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:46:46,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:46:46,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:46:46,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:46:46,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:46:46,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:46:46,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:46:46,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:46:46,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:46:46,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:46:46,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:46:46,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:46:46,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:46:46,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:46:46,153 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:46:46,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:46:46,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:46:46,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:46:46,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:46:46,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:46:46,158 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ca4739abfecd00b8d2b799ccc2617c6e4b4e221f88b8a7e722070835771a8404 [2024-10-24 00:46:46,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:46:46,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:46:46,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:46:46,663 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:46:46,664 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:46:46,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product31.cil.c [2024-10-24 00:46:48,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:46:48,457 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:46:48,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product31.cil.c [2024-10-24 00:46:48,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0c78a7d4/25cf2bacaa0d407fb7b899bfb6349966/FLAGf0fa2f0dc [2024-10-24 00:46:48,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0c78a7d4/25cf2bacaa0d407fb7b899bfb6349966 [2024-10-24 00:46:48,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:46:48,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:46:48,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:46:48,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:46:48,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:46:48,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:46:48" (1/1) ... [2024-10-24 00:46:48,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc405f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:48, skipping insertion in model container [2024-10-24 00:46:48,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:46:48" (1/1) ... [2024-10-24 00:46:48,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:46:49,192 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product31.cil.c[64142,64155] [2024-10-24 00:46:49,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:46:49,216 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:46:49,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2024-10-24 00:46:49,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [66] [2024-10-24 00:46:49,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [108] [2024-10-24 00:46:49,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [489] [2024-10-24 00:46:49,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [855] [2024-10-24 00:46:49,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [992] [2024-10-24 00:46:49,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1217] [2024-10-24 00:46:49,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1255] [2024-10-24 00:46:49,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1537] [2024-10-24 00:46:49,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1934] [2024-10-24 00:46:49,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3001] [2024-10-24 00:46:49,330 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product31.cil.c[64142,64155] [2024-10-24 00:46:49,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:46:49,366 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:46:49,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:49 WrapperNode [2024-10-24 00:46:49,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:46:49,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:46:49,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:46:49,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:46:49,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:49" (1/1) ... [2024-10-24 00:46:49,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:49" (1/1) ... [2024-10-24 00:46:49,458 INFO L138 Inliner]: procedures = 131, calls = 204, calls flagged for inlining = 61, calls inlined = 56, statements flattened = 1029 [2024-10-24 00:46:49,458 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:46:49,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:46:49,459 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:46:49,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:46:49,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:49" (1/1) ... [2024-10-24 00:46:49,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:49" (1/1) ... [2024-10-24 00:46:49,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:49" (1/1) ... [2024-10-24 00:46:49,516 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]. [2024-10-24 00:46:49,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:49" (1/1) ... [2024-10-24 00:46:49,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:49" (1/1) ... [2024-10-24 00:46:49,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:49" (1/1) ... [2024-10-24 00:46:49,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:49" (1/1) ... [2024-10-24 00:46:49,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:49" (1/1) ... [2024-10-24 00:46:49,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:49" (1/1) ... [2024-10-24 00:46:49,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:46:49,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:46:49,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:46:49,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:46:49,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:49" (1/1) ... [2024-10-24 00:46:49,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:46:49,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:46:49,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 00:46:49,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 00:46:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-24 00:46:49,683 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-24 00:46:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-24 00:46:49,683 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-24 00:46:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-24 00:46:49,684 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-24 00:46:49,684 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-24 00:46:49,684 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-24 00:46:49,684 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-24 00:46:49,684 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-24 00:46:49,685 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-24 00:46:49,685 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-24 00:46:49,685 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-24 00:46:49,685 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-24 00:46:49,685 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-24 00:46:49,686 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-24 00:46:49,686 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-24 00:46:49,686 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-24 00:46:49,686 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-24 00:46:49,687 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-24 00:46:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-24 00:46:49,687 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-24 00:46:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-24 00:46:49,687 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-24 00:46:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:46:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-24 00:46:49,687 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-24 00:46:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-24 00:46:49,688 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-24 00:46:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-24 00:46:49,688 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-24 00:46:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-24 00:46:49,688 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-24 00:46:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-24 00:46:49,688 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-24 00:46:49,689 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-24 00:46:49,690 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-24 00:46:49,690 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-24 00:46:49,690 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-24 00:46:49,690 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-24 00:46:49,690 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-24 00:46:49,690 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-24 00:46:49,690 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-24 00:46:49,690 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-24 00:46:49,690 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-24 00:46:49,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:46:49,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 00:46:49,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 00:46:49,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 00:46:49,691 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-24 00:46:49,691 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-24 00:46:49,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:46:49,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:46:49,916 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:46:49,919 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:46:50,992 INFO L? ?]: Removed 476 outVars from TransFormulas that were not future-live. [2024-10-24 00:46:50,993 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:46:51,061 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:46:51,065 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 00:46:51,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:46:51 BoogieIcfgContainer [2024-10-24 00:46:51,065 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:46:51,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:46:51,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:46:51,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:46:51,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:46:48" (1/3) ... [2024-10-24 00:46:51,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e3e688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:46:51, skipping insertion in model container [2024-10-24 00:46:51,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:49" (2/3) ... [2024-10-24 00:46:51,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e3e688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:46:51, skipping insertion in model container [2024-10-24 00:46:51,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:46:51" (3/3) ... [2024-10-24 00:46:51,073 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec1_product31.cil.c [2024-10-24 00:46:51,091 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:46:51,091 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:46:51,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:46:51,185 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;@4795aaef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:46:51,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:46:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 338 states, 254 states have (on average 1.562992125984252) internal successors, (397), 258 states have internal predecessors, (397), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-24 00:46:51,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 00:46:51,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:51,209 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-24 00:46:51,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:51,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:51,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1921350872, now seen corresponding path program 1 times [2024-10-24 00:46:51,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:51,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025429529] [2024-10-24 00:46:51,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:51,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:46:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:46:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:46:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 00:46:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 00:46:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:46:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:46:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:46:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:46:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:46:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:46:51,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:51,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025429529] [2024-10-24 00:46:51,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025429529] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:46:51,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673735538] [2024-10-24 00:46:51,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:51,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:51,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:46:51,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:46:51,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 00:46:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 00:46:52,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:46:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:46:52,234 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:46:52,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673735538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:52,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:46:52,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-24 00:46:52,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051651288] [2024-10-24 00:46:52,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:52,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:46:52,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:52,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:46:52,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:46:52,270 INFO L87 Difference]: Start difference. First operand has 338 states, 254 states have (on average 1.562992125984252) internal successors, (397), 258 states have internal predecessors, (397), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:46:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:52,387 INFO L93 Difference]: Finished difference Result 531 states and 793 transitions. [2024-10-24 00:46:52,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:46:52,390 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 95 [2024-10-24 00:46:52,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:52,408 INFO L225 Difference]: With dead ends: 531 [2024-10-24 00:46:52,409 INFO L226 Difference]: Without dead ends: 335 [2024-10-24 00:46:52,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:46:52,419 INFO L432 NwaCegarLoop]: 495 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:52,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 495 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:46:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-10-24 00:46:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2024-10-24 00:46:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 252 states have (on average 1.5476190476190477) internal successors, (390), 255 states have internal predecessors, (390), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-24 00:46:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 507 transitions. [2024-10-24 00:46:52,488 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 507 transitions. Word has length 95 [2024-10-24 00:46:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:52,490 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 507 transitions. [2024-10-24 00:46:52,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:46:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 507 transitions. [2024-10-24 00:46:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 00:46:52,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:52,494 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-24 00:46:52,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 00:46:52,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-24 00:46:52,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:52,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:52,697 INFO L85 PathProgramCache]: Analyzing trace with hash -950275068, now seen corresponding path program 1 times [2024-10-24 00:46:52,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:52,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559956715] [2024-10-24 00:46:52,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:52,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:46:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:46:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:46:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:46:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:46:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:46:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:46:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:46:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:46:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:46:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:46:53,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:53,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559956715] [2024-10-24 00:46:53,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559956715] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:46:53,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120779631] [2024-10-24 00:46:53,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:53,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:53,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:46:53,073 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:46:53,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 00:46:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 00:46:53,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:46:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:46:53,331 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:46:53,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120779631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:53,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:46:53,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:46:53,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855411638] [2024-10-24 00:46:53,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:53,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:46:53,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:53,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:46:53,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:46:53,335 INFO L87 Difference]: Start difference. First operand 335 states and 507 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:46:53,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:53,410 INFO L93 Difference]: Finished difference Result 527 states and 780 transitions. [2024-10-24 00:46:53,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:46:53,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 96 [2024-10-24 00:46:53,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:53,414 INFO L225 Difference]: With dead ends: 527 [2024-10-24 00:46:53,414 INFO L226 Difference]: Without dead ends: 337 [2024-10-24 00:46:53,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:46:53,420 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 0 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:53,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 983 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:46:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-24 00:46:53,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2024-10-24 00:46:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 254 states have (on average 1.5433070866141732) internal successors, (392), 257 states have internal predecessors, (392), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-24 00:46:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 509 transitions. [2024-10-24 00:46:53,454 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 509 transitions. Word has length 96 [2024-10-24 00:46:53,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:53,456 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 509 transitions. [2024-10-24 00:46:53,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:46:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2024-10-24 00:46:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 00:46:53,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:53,463 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-24 00:46:53,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 00:46:53,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-24 00:46:53,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:53,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:53,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1736048719, now seen corresponding path program 1 times [2024-10-24 00:46:53,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:53,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514264185] [2024-10-24 00:46:53,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:53,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:46:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:46:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:46:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:46:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:46:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:46:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:46:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:46:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:46:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:46:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:46:53,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:53,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514264185] [2024-10-24 00:46:53,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514264185] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:46:53,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453672314] [2024-10-24 00:46:53,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:53,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:53,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:46:53,875 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:46:53,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 00:46:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:54,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:46:54,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:46:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:46:54,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:46:54,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453672314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:54,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:46:54,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:46:54,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208676996] [2024-10-24 00:46:54,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:54,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:46:54,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:54,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:46:54,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:46:54,194 INFO L87 Difference]: Start difference. First operand 337 states and 509 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:46:54,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:54,263 INFO L93 Difference]: Finished difference Result 704 states and 1077 transitions. [2024-10-24 00:46:54,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:46:54,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2024-10-24 00:46:54,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:54,267 INFO L225 Difference]: With dead ends: 704 [2024-10-24 00:46:54,268 INFO L226 Difference]: Without dead ends: 389 [2024-10-24 00:46:54,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:46:54,270 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 102 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:54,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 945 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:46:54,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-24 00:46:54,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 384. [2024-10-24 00:46:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 290 states have (on average 1.5586206896551724) internal successors, (452), 293 states have internal predecessors, (452), 70 states have call successors, (70), 23 states have call predecessors, (70), 23 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-24 00:46:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 591 transitions. [2024-10-24 00:46:54,286 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 591 transitions. Word has length 101 [2024-10-24 00:46:54,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:54,286 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 591 transitions. [2024-10-24 00:46:54,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:46:54,287 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 591 transitions. [2024-10-24 00:46:54,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 00:46:54,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:54,289 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-24 00:46:54,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 00:46:54,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:54,490 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:54,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:54,492 INFO L85 PathProgramCache]: Analyzing trace with hash -969168339, now seen corresponding path program 1 times [2024-10-24 00:46:54,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:54,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170506140] [2024-10-24 00:46:54,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:54,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:54,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:54,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:54,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:54,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:46:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:54,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:46:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:54,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:46:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:54,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 00:46:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:54,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:46:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:54,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:46:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:54,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:46:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:54,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:46:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:54,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:46:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:54,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:46:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:54,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:46:54,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:54,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170506140] [2024-10-24 00:46:54,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170506140] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:46:54,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129078529] [2024-10-24 00:46:54,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:54,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:54,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:46:54,770 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:46:54,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 00:46:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 00:46:55,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:46:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 00:46:55,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:46:55,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129078529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:55,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:46:55,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-24 00:46:55,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807713662] [2024-10-24 00:46:55,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:55,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:46:55,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:55,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:46:55,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:46:55,276 INFO L87 Difference]: Start difference. First operand 384 states and 591 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:46:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:55,515 INFO L93 Difference]: Finished difference Result 763 states and 1176 transitions. [2024-10-24 00:46:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:46:55,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 102 [2024-10-24 00:46:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:55,518 INFO L225 Difference]: With dead ends: 763 [2024-10-24 00:46:55,518 INFO L226 Difference]: Without dead ends: 386 [2024-10-24 00:46:55,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:46:55,520 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 2 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:55,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1925 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 00:46:55,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-10-24 00:46:55,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2024-10-24 00:46:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 291 states have (on average 1.556701030927835) internal successors, (453), 295 states have internal predecessors, (453), 70 states have call successors, (70), 23 states have call predecessors, (70), 24 states have return successors, (71), 69 states have call predecessors, (71), 69 states have call successors, (71) [2024-10-24 00:46:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 594 transitions. [2024-10-24 00:46:55,533 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 594 transitions. Word has length 102 [2024-10-24 00:46:55,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:55,533 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 594 transitions. [2024-10-24 00:46:55,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:46:55,534 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 594 transitions. [2024-10-24 00:46:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 00:46:55,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:55,535 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-24 00:46:55,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 00:46:55,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:55,736 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:55,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:55,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1952636339, now seen corresponding path program 1 times [2024-10-24 00:46:55,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:55,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913122022] [2024-10-24 00:46:55,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:55,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 00:46:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 00:46:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 00:46:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:46:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:46:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:46:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:46:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:46:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:46:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:46:55,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:55,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913122022] [2024-10-24 00:46:55,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913122022] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:46:55,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400711592] [2024-10-24 00:46:55,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:55,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:55,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:46:55,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:46:55,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 00:46:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:56,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 00:46:56,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:46:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 00:46:56,246 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:46:56,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400711592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:56,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:46:56,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-24 00:46:56,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856952439] [2024-10-24 00:46:56,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:56,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:46:56,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:56,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:46:56,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:46:56,248 INFO L87 Difference]: Start difference. First operand 386 states and 594 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:46:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:56,341 INFO L93 Difference]: Finished difference Result 765 states and 1181 transitions. [2024-10-24 00:46:56,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:46:56,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 103 [2024-10-24 00:46:56,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:56,344 INFO L225 Difference]: With dead ends: 765 [2024-10-24 00:46:56,345 INFO L226 Difference]: Without dead ends: 388 [2024-10-24 00:46:56,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:46:56,347 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 2 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:56,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1911 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:46:56,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-24 00:46:56,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-10-24 00:46:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 292 states have (on average 1.5547945205479452) internal successors, (454), 297 states have internal predecessors, (454), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (76), 69 states have call predecessors, (76), 69 states have call successors, (76) [2024-10-24 00:46:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 600 transitions. [2024-10-24 00:46:56,365 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 600 transitions. Word has length 103 [2024-10-24 00:46:56,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:56,365 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 600 transitions. [2024-10-24 00:46:56,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:46:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 600 transitions. [2024-10-24 00:46:56,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 00:46:56,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:56,367 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:56,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 00:46:56,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:56,572 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:56,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:56,573 INFO L85 PathProgramCache]: Analyzing trace with hash -125464356, now seen corresponding path program 1 times [2024-10-24 00:46:56,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:56,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673008933] [2024-10-24 00:46:56,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:56,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:56,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:56,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:56,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:56,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:56,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:56,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 00:46:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:56,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 00:46:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:56,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:46:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:56,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:46:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:56,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:46:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:56,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:46:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:56,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:46:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:56,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:46:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:56,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:46:56,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:56,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673008933] [2024-10-24 00:46:56,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673008933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:56,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:56,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:46:56,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537166339] [2024-10-24 00:46:56,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:56,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:46:56,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:56,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:46:56,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:46:56,906 INFO L87 Difference]: Start difference. First operand 388 states and 600 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:46:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:59,231 INFO L93 Difference]: Finished difference Result 901 states and 1406 transitions. [2024-10-24 00:46:59,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:46:59,231 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 104 [2024-10-24 00:46:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:59,235 INFO L225 Difference]: With dead ends: 901 [2024-10-24 00:46:59,235 INFO L226 Difference]: Without dead ends: 532 [2024-10-24 00:46:59,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:46:59,241 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1102 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2735 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 2735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:59,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 968 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 2735 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 00:46:59,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-10-24 00:46:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 388. [2024-10-24 00:46:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 292 states have (on average 1.5547945205479452) internal successors, (454), 297 states have internal predecessors, (454), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (75), 69 states have call predecessors, (75), 69 states have call successors, (75) [2024-10-24 00:46:59,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 599 transitions. [2024-10-24 00:46:59,287 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 599 transitions. Word has length 104 [2024-10-24 00:46:59,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:59,287 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 599 transitions. [2024-10-24 00:46:59,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:46:59,288 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 599 transitions. [2024-10-24 00:46:59,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 00:46:59,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:59,291 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:59,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 00:46:59,292 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:59,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:59,292 INFO L85 PathProgramCache]: Analyzing trace with hash 711121412, now seen corresponding path program 2 times [2024-10-24 00:46:59,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:59,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305862750] [2024-10-24 00:46:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:59,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:59,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:59,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:59,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:59,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:59,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:59,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 00:46:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:59,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 00:46:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:59,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 00:46:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:59,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:46:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:59,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:46:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:59,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:46:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:59,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:46:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:59,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:46:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:46:59,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:59,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305862750] [2024-10-24 00:46:59,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305862750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:59,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:59,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:46:59,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564589512] [2024-10-24 00:46:59,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:59,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:46:59,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:59,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:46:59,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:46:59,538 INFO L87 Difference]: Start difference. First operand 388 states and 599 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:47:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:01,549 INFO L93 Difference]: Finished difference Result 903 states and 1409 transitions. [2024-10-24 00:47:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:47:01,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 105 [2024-10-24 00:47:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:01,556 INFO L225 Difference]: With dead ends: 903 [2024-10-24 00:47:01,556 INFO L226 Difference]: Without dead ends: 534 [2024-10-24 00:47:01,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:47:01,559 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1098 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2746 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 3130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 2746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:01,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 968 Invalid, 3130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 2746 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 00:47:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-10-24 00:47:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 390. [2024-10-24 00:47:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 293 states have (on average 1.552901023890785) internal successors, (455), 299 states have internal predecessors, (455), 70 states have call successors, (70), 23 states have call predecessors, (70), 26 states have return successors, (77), 69 states have call predecessors, (77), 69 states have call successors, (77) [2024-10-24 00:47:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 602 transitions. [2024-10-24 00:47:01,606 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 602 transitions. Word has length 105 [2024-10-24 00:47:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:01,606 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 602 transitions. [2024-10-24 00:47:01,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:47:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 602 transitions. [2024-10-24 00:47:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 00:47:01,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:01,610 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:47:01,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 00:47:01,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:01,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:01,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1201433737, now seen corresponding path program 1 times [2024-10-24 00:47:01,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:01,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824082778] [2024-10-24 00:47:01,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:01,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:01,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:01,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:01,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:01,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:01,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:01,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:47:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:01,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 00:47:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:01,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:47:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:01,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:47:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:01,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:47:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:01,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:47:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:01,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:47:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:01,818 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:47:01,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:01,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824082778] [2024-10-24 00:47:01,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824082778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:01,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:01,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:47:01,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561546414] [2024-10-24 00:47:01,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:01,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:47:01,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:01,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:47:01,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:47:01,819 INFO L87 Difference]: Start difference. First operand 390 states and 602 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:47:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:04,413 INFO L93 Difference]: Finished difference Result 901 states and 1404 transitions. [2024-10-24 00:47:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:47:04,413 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 106 [2024-10-24 00:47:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:04,416 INFO L225 Difference]: With dead ends: 901 [2024-10-24 00:47:04,416 INFO L226 Difference]: Without dead ends: 534 [2024-10-24 00:47:04,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-24 00:47:04,418 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 1102 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 4552 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 4941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 4552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:04,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 1343 Invalid, 4941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 4552 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 00:47:04,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-10-24 00:47:04,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 390. [2024-10-24 00:47:04,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 293 states have (on average 1.552901023890785) internal successors, (455), 299 states have internal predecessors, (455), 70 states have call successors, (70), 23 states have call predecessors, (70), 26 states have return successors, (76), 69 states have call predecessors, (76), 69 states have call successors, (76) [2024-10-24 00:47:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 601 transitions. [2024-10-24 00:47:04,440 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 601 transitions. Word has length 106 [2024-10-24 00:47:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:04,440 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 601 transitions. [2024-10-24 00:47:04,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:47:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 601 transitions. [2024-10-24 00:47:04,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 00:47:04,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:04,442 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:47:04,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 00:47:04,442 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:04,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:04,443 INFO L85 PathProgramCache]: Analyzing trace with hash -2061833220, now seen corresponding path program 2 times [2024-10-24 00:47:04,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:04,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064590154] [2024-10-24 00:47:04,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:04,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:04,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:04,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:04,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:04,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:04,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:04,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:04,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:47:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:04,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 00:47:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:04,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:47:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:04,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:47:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:04,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:47:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:04,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:47:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:04,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:47:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:04,613 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:47:04,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:04,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064590154] [2024-10-24 00:47:04,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064590154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:04,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:04,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:47:04,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393932049] [2024-10-24 00:47:04,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:04,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:47:04,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:04,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:47:04,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:47:04,615 INFO L87 Difference]: Start difference. First operand 390 states and 601 transitions. Second operand has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:47:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:07,175 INFO L93 Difference]: Finished difference Result 903 states and 1410 transitions. [2024-10-24 00:47:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:47:07,176 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 107 [2024-10-24 00:47:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:07,179 INFO L225 Difference]: With dead ends: 903 [2024-10-24 00:47:07,180 INFO L226 Difference]: Without dead ends: 536 [2024-10-24 00:47:07,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-24 00:47:07,182 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1098 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 4581 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 4581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:07,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 1344 Invalid, 4968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 4581 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 00:47:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-10-24 00:47:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 392. [2024-10-24 00:47:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 294 states have (on average 1.5510204081632653) internal successors, (456), 301 states have internal predecessors, (456), 70 states have call successors, (70), 23 states have call predecessors, (70), 27 states have return successors, (81), 69 states have call predecessors, (81), 69 states have call successors, (81) [2024-10-24 00:47:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 607 transitions. [2024-10-24 00:47:07,243 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 607 transitions. Word has length 107 [2024-10-24 00:47:07,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:07,243 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 607 transitions. [2024-10-24 00:47:07,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:47:07,243 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 607 transitions. [2024-10-24 00:47:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 00:47:07,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:07,247 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:47:07,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 00:47:07,247 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:07,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:07,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1567920626, now seen corresponding path program 1 times [2024-10-24 00:47:07,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:07,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646907297] [2024-10-24 00:47:07,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:07,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:47:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:47:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:47:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:47:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:47:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:47:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:47:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:07,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:07,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646907297] [2024-10-24 00:47:07,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646907297] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:47:07,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011744523] [2024-10-24 00:47:07,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:07,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:47:07,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:47:07,362 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:47:07,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 00:47:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:47:07,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:47:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:07,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:47:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:07,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011744523] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:47:07,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:47:07,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-10-24 00:47:07,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718691675] [2024-10-24 00:47:07,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:47:07,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 00:47:07,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:07,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 00:47:07,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:47:07,705 INFO L87 Difference]: Start difference. First operand 392 states and 607 transitions. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 00:47:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:09,640 INFO L93 Difference]: Finished difference Result 1056 states and 1722 transitions. [2024-10-24 00:47:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 00:47:09,641 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 108 [2024-10-24 00:47:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:09,647 INFO L225 Difference]: With dead ends: 1056 [2024-10-24 00:47:09,647 INFO L226 Difference]: Without dead ends: 866 [2024-10-24 00:47:09,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:47:09,650 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 1448 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 2897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:09,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1375 Invalid, 2897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 2375 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 00:47:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-10-24 00:47:09,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 707. [2024-10-24 00:47:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 545 states have (on average 1.61651376146789) internal successors, (881), 552 states have internal predecessors, (881), 134 states have call successors, (134), 23 states have call predecessors, (134), 27 states have return successors, (155), 133 states have call predecessors, (155), 133 states have call successors, (155) [2024-10-24 00:47:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1170 transitions. [2024-10-24 00:47:09,679 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1170 transitions. Word has length 108 [2024-10-24 00:47:09,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:09,680 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1170 transitions. [2024-10-24 00:47:09,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 00:47:09,680 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1170 transitions. [2024-10-24 00:47:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 00:47:09,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:09,683 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-24 00:47:09,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 00:47:09,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:47:09,884 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:09,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:09,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1058713771, now seen corresponding path program 1 times [2024-10-24 00:47:09,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:09,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515346954] [2024-10-24 00:47:09,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:09,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:47:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:47:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:47:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:47:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:47:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:47:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:47:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:09,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:09,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515346954] [2024-10-24 00:47:09,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515346954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:09,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:09,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:09,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828133024] [2024-10-24 00:47:09,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:09,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:09,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:09,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:09,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:09,964 INFO L87 Difference]: Start difference. First operand 707 states and 1170 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:11,536 INFO L93 Difference]: Finished difference Result 1815 states and 3071 transitions. [2024-10-24 00:47:11,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:11,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2024-10-24 00:47:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:11,545 INFO L225 Difference]: With dead ends: 1815 [2024-10-24 00:47:11,545 INFO L226 Difference]: Without dead ends: 1168 [2024-10-24 00:47:11,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:47:11,552 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 1197 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:11,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 756 Invalid, 2042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 00:47:11,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2024-10-24 00:47:11,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1019. [2024-10-24 00:47:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 793 states have (on average 1.630517023959647) internal successors, (1293), 800 states have internal predecessors, (1293), 198 states have call successors, (198), 23 states have call predecessors, (198), 27 states have return successors, (229), 197 states have call predecessors, (229), 197 states have call successors, (229) [2024-10-24 00:47:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1720 transitions. [2024-10-24 00:47:11,595 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1720 transitions. Word has length 114 [2024-10-24 00:47:11,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:11,595 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1720 transitions. [2024-10-24 00:47:11,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1720 transitions. [2024-10-24 00:47:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 00:47:11,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:11,599 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-24 00:47:11,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 00:47:11,600 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:11,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1227501226, now seen corresponding path program 1 times [2024-10-24 00:47:11,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:11,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567889183] [2024-10-24 00:47:11,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:11,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:11,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:11,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:11,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:11,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:11,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:11,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:11,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:47:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:11,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:47:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:11,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:47:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:11,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:47:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:11,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:47:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:11,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:47:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:11,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:47:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:11,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:11,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567889183] [2024-10-24 00:47:11,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567889183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:11,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:11,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:11,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586715862] [2024-10-24 00:47:11,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:11,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:11,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:11,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:11,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:11,718 INFO L87 Difference]: Start difference. First operand 1019 states and 1720 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:13,537 INFO L93 Difference]: Finished difference Result 2564 states and 4389 transitions. [2024-10-24 00:47:13,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:13,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2024-10-24 00:47:13,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:13,547 INFO L225 Difference]: With dead ends: 2564 [2024-10-24 00:47:13,548 INFO L226 Difference]: Without dead ends: 1655 [2024-10-24 00:47:13,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:47:13,552 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1195 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:13,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 716 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 00:47:13,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2024-10-24 00:47:13,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1506. [2024-10-24 00:47:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1185 states have (on average 1.639662447257384) internal successors, (1943), 1192 states have internal predecessors, (1943), 293 states have call successors, (293), 23 states have call predecessors, (293), 27 states have return successors, (324), 292 states have call predecessors, (324), 292 states have call successors, (324) [2024-10-24 00:47:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2560 transitions. [2024-10-24 00:47:13,616 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2560 transitions. Word has length 115 [2024-10-24 00:47:13,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:13,617 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2560 transitions. [2024-10-24 00:47:13,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2560 transitions. [2024-10-24 00:47:13,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 00:47:13,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:13,625 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-24 00:47:13,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 00:47:13,626 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:13,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:13,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1516541741, now seen corresponding path program 1 times [2024-10-24 00:47:13,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:13,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193117944] [2024-10-24 00:47:13,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:13,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:13,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:13,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:13,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:13,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:13,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:13,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:13,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:47:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:13,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:47:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:13,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:47:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:47:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:13,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:47:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:13,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:47:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:13,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 00:47:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:13,759 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:13,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:13,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193117944] [2024-10-24 00:47:13,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193117944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:13,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:13,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:13,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854052203] [2024-10-24 00:47:13,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:13,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:13,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:13,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:13,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:13,762 INFO L87 Difference]: Start difference. First operand 1506 states and 2560 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:15,247 INFO L93 Difference]: Finished difference Result 3666 states and 6348 transitions. [2024-10-24 00:47:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:15,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2024-10-24 00:47:15,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:15,263 INFO L225 Difference]: With dead ends: 3666 [2024-10-24 00:47:15,263 INFO L226 Difference]: Without dead ends: 2390 [2024-10-24 00:47:15,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:47:15,269 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1193 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:15,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 708 Invalid, 1974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:47:15,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2024-10-24 00:47:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2241. [2024-10-24 00:47:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 1797 states have (on average 1.6471897607122983) internal successors, (2960), 1804 states have internal predecessors, (2960), 416 states have call successors, (416), 23 states have call predecessors, (416), 27 states have return successors, (463), 415 states have call predecessors, (463), 415 states have call successors, (463) [2024-10-24 00:47:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3839 transitions. [2024-10-24 00:47:15,413 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 3839 transitions. Word has length 116 [2024-10-24 00:47:15,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:15,413 INFO L471 AbstractCegarLoop]: Abstraction has 2241 states and 3839 transitions. [2024-10-24 00:47:15,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3839 transitions. [2024-10-24 00:47:15,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 00:47:15,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:15,423 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-24 00:47:15,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 00:47:15,423 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:15,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:15,423 INFO L85 PathProgramCache]: Analyzing trace with hash 209029513, now seen corresponding path program 1 times [2024-10-24 00:47:15,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:15,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754995162] [2024-10-24 00:47:15,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:15,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:15,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:15,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:15,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:15,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:15,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:15,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:15,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:47:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:15,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:47:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:15,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:47:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:15,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:47:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:15,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:47:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:15,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:47:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:15,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:47:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:15,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:15,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754995162] [2024-10-24 00:47:15,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754995162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:15,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:15,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:15,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318568550] [2024-10-24 00:47:15,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:15,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:15,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:15,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:15,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:15,540 INFO L87 Difference]: Start difference. First operand 2241 states and 3839 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:17,058 INFO L93 Difference]: Finished difference Result 5376 states and 9398 transitions. [2024-10-24 00:47:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:17,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2024-10-24 00:47:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:17,080 INFO L225 Difference]: With dead ends: 5376 [2024-10-24 00:47:17,081 INFO L226 Difference]: Without dead ends: 3562 [2024-10-24 00:47:17,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:47:17,087 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1191 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 437 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 437 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:17,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 708 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [437 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:47:17,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2024-10-24 00:47:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3413. [2024-10-24 00:47:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3413 states, 2790 states have (on average 1.6523297491039426) internal successors, (4610), 2797 states have internal predecessors, (4610), 595 states have call successors, (595), 23 states have call predecessors, (595), 27 states have return successors, (668), 594 states have call predecessors, (668), 594 states have call successors, (668) [2024-10-24 00:47:17,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3413 states to 3413 states and 5873 transitions. [2024-10-24 00:47:17,216 INFO L78 Accepts]: Start accepts. Automaton has 3413 states and 5873 transitions. Word has length 117 [2024-10-24 00:47:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:17,216 INFO L471 AbstractCegarLoop]: Abstraction has 3413 states and 5873 transitions. [2024-10-24 00:47:17,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3413 states and 5873 transitions. [2024-10-24 00:47:17,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 00:47:17,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:17,226 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-24 00:47:17,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 00:47:17,226 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:17,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:17,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1532009975, now seen corresponding path program 1 times [2024-10-24 00:47:17,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:17,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141415557] [2024-10-24 00:47:17,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:17,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:17,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:17,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:17,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:17,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:17,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:17,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:17,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:47:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:17,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:47:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:17,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:47:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:17,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:47:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:17,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:47:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:17,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:47:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:17,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:47:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:17,320 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:17,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:17,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141415557] [2024-10-24 00:47:17,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141415557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:17,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:17,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:17,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800622213] [2024-10-24 00:47:17,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:17,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:17,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:17,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:17,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:17,323 INFO L87 Difference]: Start difference. First operand 3413 states and 5873 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:18,896 INFO L93 Difference]: Finished difference Result 8231 states and 14452 transitions. [2024-10-24 00:47:18,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:18,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-10-24 00:47:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:18,928 INFO L225 Difference]: With dead ends: 8231 [2024-10-24 00:47:18,928 INFO L226 Difference]: Without dead ends: 5532 [2024-10-24 00:47:18,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:47:18,940 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 1189 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:18,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 737 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 1590 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:47:18,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2024-10-24 00:47:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5383. [2024-10-24 00:47:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5383 states, 4384 states have (on average 1.6425638686131387) internal successors, (7201), 4391 states have internal predecessors, (7201), 971 states have call successors, (971), 23 states have call predecessors, (971), 27 states have return successors, (1088), 970 states have call predecessors, (1088), 970 states have call successors, (1088) [2024-10-24 00:47:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5383 states to 5383 states and 9260 transitions. [2024-10-24 00:47:19,196 INFO L78 Accepts]: Start accepts. Automaton has 5383 states and 9260 transitions. Word has length 118 [2024-10-24 00:47:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:19,197 INFO L471 AbstractCegarLoop]: Abstraction has 5383 states and 9260 transitions. [2024-10-24 00:47:19,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:19,197 INFO L276 IsEmpty]: Start isEmpty. Operand 5383 states and 9260 transitions. [2024-10-24 00:47:19,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 00:47:19,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:19,218 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-24 00:47:19,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 00:47:19,218 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:19,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:19,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1118331803, now seen corresponding path program 1 times [2024-10-24 00:47:19,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:19,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255001389] [2024-10-24 00:47:19,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:19,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:19,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:19,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:19,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:19,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:19,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:19,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:19,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:47:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:19,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:47:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:19,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:47:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:19,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:47:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:19,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:47:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:19,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:47:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:19,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 00:47:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:19,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:19,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255001389] [2024-10-24 00:47:19,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255001389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:19,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:19,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:19,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844438632] [2024-10-24 00:47:19,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:19,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:19,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:19,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:19,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:19,335 INFO L87 Difference]: Start difference. First operand 5383 states and 9260 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:20,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:20,963 INFO L93 Difference]: Finished difference Result 13368 states and 23473 transitions. [2024-10-24 00:47:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:20,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2024-10-24 00:47:20,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:21,051 INFO L225 Difference]: With dead ends: 13368 [2024-10-24 00:47:21,054 INFO L226 Difference]: Without dead ends: 9065 [2024-10-24 00:47:21,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:47:21,088 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1187 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:21,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 709 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 00:47:21,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9065 states. [2024-10-24 00:47:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9065 to 8916. [2024-10-24 00:47:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8916 states, 7311 states have (on average 1.640951990151826) internal successors, (11997), 7318 states have internal predecessors, (11997), 1577 states have call successors, (1577), 23 states have call predecessors, (1577), 27 states have return successors, (1772), 1576 states have call predecessors, (1772), 1576 states have call successors, (1772) [2024-10-24 00:47:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8916 states to 8916 states and 15346 transitions. [2024-10-24 00:47:21,532 INFO L78 Accepts]: Start accepts. Automaton has 8916 states and 15346 transitions. Word has length 119 [2024-10-24 00:47:21,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:21,534 INFO L471 AbstractCegarLoop]: Abstraction has 8916 states and 15346 transitions. [2024-10-24 00:47:21,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 8916 states and 15346 transitions. [2024-10-24 00:47:21,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 00:47:21,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:21,554 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-24 00:47:21,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 00:47:21,554 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:21,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:21,555 INFO L85 PathProgramCache]: Analyzing trace with hash 506924713, now seen corresponding path program 1 times [2024-10-24 00:47:21,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:21,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157678113] [2024-10-24 00:47:21,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:21,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:21,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:21,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:21,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:21,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:21,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:47:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:21,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:47:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:21,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:47:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:21,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:47:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:21,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:47:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:21,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:47:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:21,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 00:47:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:21,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:21,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157678113] [2024-10-24 00:47:21,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157678113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:21,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:21,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:21,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730138115] [2024-10-24 00:47:21,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:21,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:21,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:21,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:21,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:21,645 INFO L87 Difference]: Start difference. First operand 8916 states and 15346 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:23,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:23,261 INFO L93 Difference]: Finished difference Result 23140 states and 40607 transitions. [2024-10-24 00:47:23,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:23,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2024-10-24 00:47:23,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:23,336 INFO L225 Difference]: With dead ends: 23140 [2024-10-24 00:47:23,337 INFO L226 Difference]: Without dead ends: 15737 [2024-10-24 00:47:23,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:47:23,361 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 1185 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 1579 mSolverCounterSat, 437 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 437 IncrementalHoareTripleChecker+Valid, 1579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:23,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 770 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [437 Valid, 1579 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 00:47:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15737 states. [2024-10-24 00:47:23,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15737 to 15588. [2024-10-24 00:47:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15588 states, 12780 states have (on average 1.6320813771517997) internal successors, (20858), 12787 states have internal predecessors, (20858), 2780 states have call successors, (2780), 23 states have call predecessors, (2780), 27 states have return successors, (3119), 2779 states have call predecessors, (3119), 2779 states have call successors, (3119) [2024-10-24 00:47:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15588 states to 15588 states and 26757 transitions. [2024-10-24 00:47:23,933 INFO L78 Accepts]: Start accepts. Automaton has 15588 states and 26757 transitions. Word has length 120 [2024-10-24 00:47:23,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:23,934 INFO L471 AbstractCegarLoop]: Abstraction has 15588 states and 26757 transitions. [2024-10-24 00:47:23,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 15588 states and 26757 transitions. [2024-10-24 00:47:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 00:47:23,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:23,962 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-24 00:47:23,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 00:47:23,962 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:23,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:23,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1059107364, now seen corresponding path program 1 times [2024-10-24 00:47:23,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:23,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828840945] [2024-10-24 00:47:23,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:23,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:24,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:24,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:24,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:24,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:24,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:24,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:24,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:47:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:24,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:47:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:24,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:47:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:24,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:47:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:24,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:47:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:24,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:47:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:24,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 00:47:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:24,092 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:24,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:24,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828840945] [2024-10-24 00:47:24,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828840945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:24,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:24,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:24,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896059213] [2024-10-24 00:47:24,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:24,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:24,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:24,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:24,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:24,095 INFO L87 Difference]: Start difference. First operand 15588 states and 26757 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:26,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:26,281 INFO L93 Difference]: Finished difference Result 41307 states and 72407 transitions. [2024-10-24 00:47:26,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:26,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2024-10-24 00:47:26,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:26,382 INFO L225 Difference]: With dead ends: 41307 [2024-10-24 00:47:26,382 INFO L226 Difference]: Without dead ends: 27852 [2024-10-24 00:47:26,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:47:26,420 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1183 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:26,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 712 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 1548 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 00:47:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27852 states. [2024-10-24 00:47:27,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27852 to 27703. [2024-10-24 00:47:27,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27703 states, 22856 states have (on average 1.6285439271963598) internal successors, (37222), 22863 states have internal predecessors, (37222), 4819 states have call successors, (4819), 23 states have call predecessors, (4819), 27 states have return successors, (5432), 4818 states have call predecessors, (5432), 4818 states have call successors, (5432) [2024-10-24 00:47:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27703 states to 27703 states and 47473 transitions. [2024-10-24 00:47:27,409 INFO L78 Accepts]: Start accepts. Automaton has 27703 states and 47473 transitions. Word has length 121 [2024-10-24 00:47:27,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:27,410 INFO L471 AbstractCegarLoop]: Abstraction has 27703 states and 47473 transitions. [2024-10-24 00:47:27,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:27,410 INFO L276 IsEmpty]: Start isEmpty. Operand 27703 states and 47473 transitions. [2024-10-24 00:47:27,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 00:47:27,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:27,437 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-24 00:47:27,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 00:47:27,437 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:27,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:27,438 INFO L85 PathProgramCache]: Analyzing trace with hash 118598503, now seen corresponding path program 1 times [2024-10-24 00:47:27,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:27,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778721505] [2024-10-24 00:47:27,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:27,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:47:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:47:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:47:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:47:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:47:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:47:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 00:47:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:27,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:27,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778721505] [2024-10-24 00:47:27,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778721505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:27,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:27,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:27,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491077784] [2024-10-24 00:47:27,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:27,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:27,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:27,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:27,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:27,523 INFO L87 Difference]: Start difference. First operand 27703 states and 47473 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:30,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:30,283 INFO L93 Difference]: Finished difference Result 75499 states and 131596 transitions. [2024-10-24 00:47:30,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:30,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2024-10-24 00:47:30,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:30,797 INFO L225 Difference]: With dead ends: 75499 [2024-10-24 00:47:30,797 INFO L226 Difference]: Without dead ends: 50676 [2024-10-24 00:47:30,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:47:30,859 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1181 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:30,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 720 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 00:47:30,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50676 states. [2024-10-24 00:47:32,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50676 to 50527. [2024-10-24 00:47:32,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50527 states, 41965 states have (on average 1.6236387465745263) internal successors, (68136), 41972 states have internal predecessors, (68136), 8534 states have call successors, (8534), 23 states have call predecessors, (8534), 27 states have return successors, (9679), 8533 states have call predecessors, (9679), 8533 states have call successors, (9679) [2024-10-24 00:47:32,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50527 states to 50527 states and 86349 transitions. [2024-10-24 00:47:32,846 INFO L78 Accepts]: Start accepts. Automaton has 50527 states and 86349 transitions. Word has length 122 [2024-10-24 00:47:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:32,846 INFO L471 AbstractCegarLoop]: Abstraction has 50527 states and 86349 transitions. [2024-10-24 00:47:32,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 50527 states and 86349 transitions. [2024-10-24 00:47:33,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 00:47:33,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:33,304 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-24 00:47:33,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 00:47:33,305 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:33,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:33,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1201086500, now seen corresponding path program 1 times [2024-10-24 00:47:33,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:33,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307147364] [2024-10-24 00:47:33,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:33,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:33,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:33,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:33,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:33,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:33,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:33,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:33,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:47:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:33,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:47:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:33,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:47:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:33,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:47:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:33,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:47:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:33,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 00:47:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:33,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 00:47:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:33,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:33,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307147364] [2024-10-24 00:47:33,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307147364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:33,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:33,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:33,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470324128] [2024-10-24 00:47:33,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:33,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:33,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:33,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:33,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:33,446 INFO L87 Difference]: Start difference. First operand 50527 states and 86349 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:37,028 INFO L93 Difference]: Finished difference Result 94246 states and 164759 transitions. [2024-10-24 00:47:37,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:37,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2024-10-24 00:47:37,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:37,450 INFO L225 Difference]: With dead ends: 94246 [2024-10-24 00:47:37,450 INFO L226 Difference]: Without dead ends: 94056 [2024-10-24 00:47:37,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:47:37,501 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1176 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 440 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:37,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 718 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [440 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:47:37,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94056 states. [2024-10-24 00:47:41,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94056 to 93907. [2024-10-24 00:47:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93907 states, 78546 states have (on average 1.6172306673796246) internal successors, (127027), 78553 states have internal predecessors, (127027), 15333 states have call successors, (15333), 23 states have call predecessors, (15333), 27 states have return successors, (17524), 15332 states have call predecessors, (17524), 15332 states have call successors, (17524) [2024-10-24 00:47:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93907 states to 93907 states and 159884 transitions. [2024-10-24 00:47:42,093 INFO L78 Accepts]: Start accepts. Automaton has 93907 states and 159884 transitions. Word has length 123 [2024-10-24 00:47:42,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:42,094 INFO L471 AbstractCegarLoop]: Abstraction has 93907 states and 159884 transitions. [2024-10-24 00:47:42,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 93907 states and 159884 transitions. [2024-10-24 00:47:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 00:47:42,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:42,138 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-24 00:47:42,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 00:47:42,138 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:42,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:42,139 INFO L85 PathProgramCache]: Analyzing trace with hash 961517096, now seen corresponding path program 1 times [2024-10-24 00:47:42,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:42,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367548839] [2024-10-24 00:47:42,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:42,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:42,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:42,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:42,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:42,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:42,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:42,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:42,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:47:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:42,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:47:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:42,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:47:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:42,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:47:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:42,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:47:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:42,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:47:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:42,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 00:47:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:42,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:42,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367548839] [2024-10-24 00:47:42,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367548839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:42,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:42,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-24 00:47:42,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54364920] [2024-10-24 00:47:42,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:42,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 00:47:42,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:42,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 00:47:42,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-10-24 00:47:42,655 INFO L87 Difference]: Start difference. First operand 93907 states and 159884 transitions. Second operand has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-10-24 00:47:55,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:55,650 INFO L93 Difference]: Finished difference Result 187933 states and 331875 transitions. [2024-10-24 00:47:55,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-24 00:47:55,651 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 124 [2024-10-24 00:47:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:56,683 INFO L225 Difference]: With dead ends: 187933 [2024-10-24 00:47:56,683 INFO L226 Difference]: Without dead ends: 187748 [2024-10-24 00:47:56,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=863, Invalid=3967, Unknown=0, NotChecked=0, Total=4830 [2024-10-24 00:47:56,767 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 4165 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 9043 mSolverCounterSat, 1481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4176 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 10524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1481 IncrementalHoareTripleChecker+Valid, 9043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:56,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4176 Valid, 2367 Invalid, 10524 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1481 Valid, 9043 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-10-24 00:47:56,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187748 states. [2024-10-24 00:48:04,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187748 to 187076. [2024-10-24 00:48:04,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187076 states, 156528 states have (on average 1.6180427782888684) internal successors, (253269), 156433 states have internal predecessors, (253269), 30476 states have call successors, (30476), 62 states have call predecessors, (30476), 71 states have return successors, (38135), 30586 states have call predecessors, (38135), 30473 states have call successors, (38135) [2024-10-24 00:48:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187076 states to 187076 states and 321880 transitions. [2024-10-24 00:48:05,248 INFO L78 Accepts]: Start accepts. Automaton has 187076 states and 321880 transitions. Word has length 124 [2024-10-24 00:48:05,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:48:05,249 INFO L471 AbstractCegarLoop]: Abstraction has 187076 states and 321880 transitions. [2024-10-24 00:48:05,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-10-24 00:48:05,249 INFO L276 IsEmpty]: Start isEmpty. Operand 187076 states and 321880 transitions. [2024-10-24 00:48:05,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 00:48:05,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:48:05,314 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-24 00:48:05,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 00:48:05,314 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:48:05,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:48:05,315 INFO L85 PathProgramCache]: Analyzing trace with hash 920559229, now seen corresponding path program 1 times [2024-10-24 00:48:05,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:48:05,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203314606] [2024-10-24 00:48:05,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:48:05,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:48:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:48:05,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:48:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:48:05,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:48:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:48:05,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:48:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:48:05,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:48:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:48:05,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:48:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:48:05,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:48:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:48:05,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:48:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:48:05,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:48:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:48:05,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:48:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:48:05,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:48:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:48:05,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:48:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:48:05,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:48:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:48:05,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 00:48:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:48:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:48:05,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:48:05,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203314606] [2024-10-24 00:48:05,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203314606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:48:05,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:48:05,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 00:48:05,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662704301] [2024-10-24 00:48:05,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:48:05,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 00:48:05,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:48:05,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 00:48:05,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:48:05,511 INFO L87 Difference]: Start difference. First operand 187076 states and 321880 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 5 states have call successors, (15), 7 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13)